Description: For any given figure (vertices not less than 20, the side for not less than 30, graph the type can be directed graph, no to figure, was the nets, no to the nets), can input figure of vertex and edge (or arc) information, and storage to the corresponding storage structure (the adjacency matrix, contiguous table, ten medium watch, watch, choose which adjacency multiple two types)
To Search:
File list (Check if you may need any files):
邻接表存储\ALGraph.c
......转换成邻接矩阵\change.c
....................\change.exe
....................\change.o
....矩阵\Mgraph.c
一个点到所有点的最短路径\Dijstra.c
最小生成树\prim.c
邻接表存储
邻接表转换成邻接矩阵
邻接矩阵
一个点到所有点的最短路径
最小生成树
Download