Network Diagram Of A Computer Algorithm, And Display Methods

This paper deals with the algorithms of the graph display, the connectivity of the graph and the shortest path in the graph. Based on the adjacency multilist, the author gives the algorithms of the graph display and creates a interactive system about the display and query of the graph. To decrease runtime, the author has improved the DFS algorithm that determins the connectivity of the graph. The paper proposes an algorithm that can find all routes with the same length and perfect functions. A new algorithm is proposed, which solves the shortest path in a graph with the same length of the edges. Compared with the algorithms in graph theory, the algorithm has more efficiency.