Description: Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs and undirected graph adjacency list and the adjacency matrix is easy to form on the screen output, at the same time, can realize the undirected graph depth first traversal and breadth traversal output output Kruskal algorithm and Prim algorithm to achieve the creation of the Oki Nariki Dijkstra algorithm the shortest path calculation and the calculation of minimum eccentricity.
To Search:
File list (Check if you may need any files):
图\Adjacency_List.h
..\Adjacency_Matrix.h
..\CSTree.h
..\Debug\main.obj
..\.....\vc60.idb
..\.....\vc60.pdb
..\.....\图.exe
..\.....\图.ilk
..\.....\图.pch
..\.....\图.pdb
..\Graph.h
..\main.cpp
..\MinHeap.h
..\MinSpanTree.h
..\Queue.h
..\ShorttestPath.h
..\UFSets.h
..\图.dsp
..\图.dsw
..\图.ncb
..\图.opt
..\图.plg
..\图.txt
..\Debug
图
Download