Question

数据结构 图的操作

Input: the number of vertex, the number of edge, all edges (Vi,Vj) and its weight in a graph.
Output:
(1).print the graph.
(2).print the sequence of vertex names getting from Depth-First Search.
(3). print the sequence of vertex names getting from Breadth-First Search.

For example (See Figure 1):
Input:
6 11 // indicate the graph including six vertexes and eleven edges.
0 1 50 // indicate an edge from V0 to V1.
0 2 10
0 4 45
1 2 15
1 4 10
2 0 20
2 3 15
3 1 20
3 4 35
4 3 30
5 3 3

Figure 2
Output:
0：1 2 4
1：2 4
2：0 3
3：1 4
4：3
5：3

The sequence of vertex names getting from Depth-First Search (from ‘V1’):
V1 V2 V0 V4 V3 V5
The sequence of vertex names getting from Breadth-First Search (from ‘V1’):
V1 V2 V4 V0 V3 V5
Shortest paths from v0 to each vertex are
V0 to V1 45
V0 to V2 10
V0 to V3 25
V0 to V4 45
V0 to V5 1000
(“1000” means no path.)
有向图

Answer 1

1．
按邻接矩阵创建图（包括无向图/无向网）
CreateGraph
2．
求无向图的深度优先遍历和广度优先遍历
DFSTraverse
BFSTraverse
3．
求输出无向网的最小生成树（Prim和Kruskal算法都可以）
MST_Prim
MST_Kruskal
数据结构很重要，尤其是编程思想。
www.onwit.cn
我个人站点。

Answer 2

太专业了...这里回答的都是生活常识类的,知识类的..
建议你去专业的论坛发帖子求助..
偶尔看到期的问题,进来的,提醒下你..
祝福你如愿以偿.