sample.gph

图论：最短路径算法实现 Graph.gph GraphBFS.h GraphM.h GraphOpr.h Queue.h sample.gph ShortPth.cpp ShortPt

# Graph example from book for connected components
# use '#' to start a remark line
8               # Number of vertices
U               # Directed/Undirected graph
# D -- Directed graph
# U -- Undirected graph
# List of edges
# input edges sample:
# v1 v2 w   ;set an edge with length of w from vertice v1 to vertice v2
# v1 v2   ;set an edge with length of 1 (default) from v1 to v2
1 2 1
2 4 3
4 0
1 3
6 5