Location:
Search - graphbfs
Search list
Description: 图论：最短路径算法实现
Graph.gph
GraphBFS.h
GraphM.h
GraphOpr.h
Queue.h
sample.gph
ShortPth.cpp
ShortPth.dsp
ShortPth.dsw
ShortPth.ncb
ShortPth.opt
ShortPth.plg-graph theory : the shortest path algorithm Graph.gph GraphBFS.h GraphM.h Graph Opr.h Queue.h sample.gph ShortPth.cpp ShortP th.dsp ShortPth.dsw ShortPth.ncb ShortPth.o pt ShortPth.plg
Platform: |
Size: 17017 |
Author: silwol |
Hits:
Description: 读图并输出图的邻接链表，输入两个结点，用广度优先寻找它们之间的最短路径并输出，并判断其是否是树，是否连通，是否有环，有要打印出来环．-interpret drawings and prints of adjacent chain, the importation of two nodes, with breadth between them priority for the shortest path and output, and a judgment whether it is trees, connectivity, whether in Central, to print out a ring.
Platform: |
Size: 4133 |
Author: micang |
Hits:
Description: 图论：最短路径算法实现
Graph.gph
GraphBFS.h
GraphM.h
GraphOpr.h
Queue.h
sample.gph
ShortPth.cpp
ShortPth.dsp
ShortPth.dsw
ShortPth.ncb
ShortPth.opt
ShortPth.plg-graph theory : the shortest path algorithm Graph.gph GraphBFS.h GraphM.h Graph Opr.h Queue.h sample.gph ShortPth.cpp ShortP th.dsp ShortPth.dsw ShortPth.ncb ShortPth.o pt ShortPth.plg
Platform: |
Size: 16384 |
Author: silwol |
Hits:
Description: 读图并输出图的邻接链表，输入两个结点，用广度优先寻找它们之间的最短路径并输出，并判断其是否是树，是否连通，是否有环，有要打印出来环．-interpret drawings and prints of adjacent chain, the importation of two nodes, with breadth between them priority for the shortest path and output, and a judgment whether it is trees, connectivity, whether in Central, to print out a ring.
Platform: |
Size: 4096 |
Author: |
Hits:
Description: it describes how berth first search is computed in graphs
Platform: |
Size: 1024 |
Author: Murali krishna |
Hits: