Description:
The experimental realization of the adjacency list shows the breadth first traversal of undirected graph.
The input of the program is the sequence of vertices and edges of the graph (the end of the vertex sequence is a symbol, and the edge sequence is-1,-1 is the end symbol). The output of the program is the adjacency list and the breadth first traversal sequence. For example:
Program input:
A
B
C
D
E
F
*
0,1
0,4
1,4
1,5
2,3
2,5
3,5
-1,-1
The output of the program is:
ALGraph is the
A 41
B 540
C 53
D 52
E 10
F 321
Breadth-First-Seacrh list:aebfdc the
To Search:
File list (Check if you may need any files):
Untitled4.cpp
Download