搜索资源列表
-
0下载：
Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, \"g++ -o span_forest span_forest.c\". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper t
-
-
0下载：
程序采用C++编写，在C++Builder6.0中编译通过，用于计算简单图结构的连通度和结合度。-Using C++ program written in C++ Builder6.0 in compiles, used to calculate the simple graph structure, degree of connectivity and integration.
-
-
0下载：
使用邻接表存储结构，编写一个程序，实现对有向图遍历操作。是用C++编写的程序源代码。-Storage structure using the adjacency list, write a program to achieve a directed graph traversal operations. Is a program written in C++ source code.
-
-
0下载：
用C语言数据结构描述的演示用邻接矩阵存图的小程序-Described in C language data structures stored adjacency matrix of graph presentation with a small program
-
-
0下载：
C++迷宫游戏源码，程序中，坐标点，如（1,1），在输入时不需要输括号，直接输1,1。该程序寻找的是最佳路径。该程序可以图形显示迷宫。
-C++ maze game code, the program, coordinate point, such as (1, 1), in the input don t need to lose parentheses, the direct lose 1, 1.
The program is the best route for.
The p
-
-
0下载：
1.掌握图的基本存储方法：邻接矩阵和邻接表（本程序中使用邻接矩阵）；
2.掌握有关图的基本操作算法并能使用高级语言实现（本程序使用C语言）；
3.掌握图的深度优先搜索遍历和广度优先搜索遍历算法；
4.掌握图的最小生成树的两种算法：prim算法和kruskal算法。
5.掌握图的最短路径的两种算法：DIJ算法和floyd算法。
-1 The basic storage methods mastered graph: adjacency matrix and adjacency
-
