本实验实现邻接表表示下无向图的广度优先遍历。



程序的输入是图的顶点序列和边序列(顶点序列以*为结束标志，边序列以-1,-1为结束标志)。程序的输出为图的邻接表和广度优先遍历序列。例如：





程序输入为：

a

b

c

d

e

f

*

0,1

0,4

1,4

1,5

2,3

2,5

3,5

-1,-1





程序的输出为：

the ALGraph is

a 4 1

b 5 4 0

c 5 3

d 5 2

e 1 0

f 3 2 1

the Breadth-First-Seacrh list:aebfdc

-In this experiment, 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