Description: 1. The establishment of the network adjacency matrix.
Requirements: No input from the keyboard to the network, the number of vertices and edges and then, "vertex 1, vertex 2, the right value" means input graph on all sides, the establishment of the adjacency matrix storage, and output of all vertices and adjacency matrix.
2. To the nets for non-depth-first traversal, the output traversal sequence.
3. To determine a given undirected network whether it is connected?
Requirements: from the keyboard to enter a starting point to search traversal, the output traversal sequence.
To Search:
- [zhijiecharupaixu] - Direct Insertion Sort algorithm, directl
- [graph] - Title: map (have to, undirected, weighte
- [shortestpath] - Topic: establishment of a network to der
- [Graph] - Greedy algorithm use graph structure,sta
- [KRUSCAL] - KRUSCAL algorithm demo program, using KR
File list (Check if you may need any files):
Graph\邻接矩阵1.cpp
Graph
Download