Introduction - If you have any usage issues, please Google them yourself
This software around the me of directed graph, use the graphical interface to achieve the establishment of an undirected graph, showing the adjacent table, the dynamic construction of minimum spanning tree (Prim algorithm and Kruscal algorithm), find the shortest path.
Specific features:
Given a graph, complete:
(1) to establish and demonstrate its adjacency lists
(2) the algorithm of Prim and Kruskal algorithm construct the minimum spanning tree, ready to show the process of its construction
(3) gives the shortest path to determine a vertex to all other vertices
(4) gives the shortest path between each pair of vertices
Description: used in program development and source files in the folder "supporting documents". Attach a separate sheet document.