Question

java编程高手请进！！急！！！

我同学的作业~~ 要求用JAVA编写~~~请尽快哇
计算机高手们快点来 快点来 帮帮小妹~~~题目如下！！！
谢谢大家了！！！

Data Storage and Manipulation
Aim: To give you practice in implement graphs and graph algorithms.
Background: Warshall's Allgorithm which allowed us to determine whether or not a path existed between any two nodes in a graph. I briefly outlined the way in which the algorithm could be extended to record the actual path, and its length. In this coursework you are required to implement an extended form of Warshall's Algorithm in order to record the shortest path between any two nodes.
Tasks:
1. Define a class to represent an unweighted directed graph. Nodes may be identified by an integer.
2. Write a method which will construct a graph object by first reading in the number of nodes in the graph and then reading a series of lines containing two integers. The first integer will represent a start node for an arc in a graph, and the second an end node for an arc in a graph.
3. Write a method which will output in a neat format the adjacency matrix for a graph of the form created by the method defined in 2.
4. Write a method to implement an extended form of Warshall's Algorithm which not only determines whether or not there exists a path between two nodes, but also records the shortest path between two nodes.
5. Write a version of the adjacency display method which displays the shortest paths between nodes( this will be a list of integers representing the intermediate nodes).
6. Demonstrate that your definitions work by creating a graph(task2), displays the adjacency matrix(task3), calculates the shortest paths(task 4) and displays a matrix of these(task 5)

Answer 1

昏，都是洋文，偶洋文不好，家穷人丑，一米四九。小学文化，农村户口。破屋三间，薄田一亩。冷锅热灶，老婆没有。一年四季，药不离口，今日上网，广征女友，革命路上，并肩携手……

Answer 2

看过之后我明白一件事，不会英语JAVA一样能学好。这位小妹妹，你还是用中文发出来吧

Answer 3

偶的神啊 ， 你翻译好啊 。离开学校的 大多数 英文都看不懂了
翻译好补充 在下面

Answer 4

尽管过了四级但是看了这个，觉得还是几乎等于没学阿。

Answer 5

我英语专业,但是看了还是觉得很麻烦