Description: Map-building (including the adjacency matrix and adjacency list approach): directed graph, undirected graph, and to the network to the network. To map depth-first and breadth-first traversal, and for the minimum spanning tree graph, the directed graph for topological sorting, and single-source shortest path (Dijkstra algorithm), Floyd algorithm
- [jige] - This is the mathematical modeling of gra
- [Dijkstra] - Dijkstra algorithm, that is, find the sh
- [sjjg] - Minimum spanning tree algorithm [data st
- [Dijkstra] - The issue of the shortest path problem a
- [yuandaima] - The general knapsack problem greedy algo
- [Ncut] - Normalize Cut
- [shortpath] - 1, read into the city node data*//* 2, t
- [tu3] - Create a storage structure of a given gr
- [UnDirectGraph] - This procedure achieved a " data str
- [Group] - Implementation diagrams, the traverse an
File list (Check if you may need any files):
新建文件夹
..........\Debug
..........\.....\graph1.exe
..........\.....\graph1.ilk
..........\.....\graph1.obj
..........\.....\graph1.pch
..........\.....\graph1.pdb
..........\.....\vc60.idb
..........\.....\vc60.pdb
..........\graph1.cpp
..........\graph1.dsp
..........\graph1.dsw
..........\graph1.ncb
..........\graph1.opt
..........\graph1.plg
Download