Search - graph - CodeBus

Search - graph - List

[Data structs] graph, heap, sorting, timing source code-- common datastruct DL : 0: graph, heap, sorting, timing source code
Date : 2011-08-05 Size : 107.36kb User : china_rmb@sohu.com
[Data structs] GraphTheory DL : 0: 一篇很全的图论知识的概论，很适合初学者观看-a very full knowledge of graph theory to the Introduction, which is perfect for beginners to watch
Date : 2026-01-01 Size : 578kb User : sunnie
[Data structs] mColor DL : 0: 图论：图的M着色问题 GraphM.h GraphOpr.h mColor.cpp mColor.dsp mColor.dsw mColor.h mColor.ncb mColor.opt mColor.plg test test.gph-graph theory : Figure M Coloring GraphM.h GraphOpr.h mColor.cpp mColo r.dsp mColor.dsw mColor.h mColor.ncb mColor. opt mColor.plg test test.gph
Date : 2026-01-01 Size : 12kb User : silwol
[Data structs] graphicsalgorithmy DL : 0: 一套很好的图论算法源码,包括图的遍历,最短路径的实现，有向图计算、拓扑排序等多个算法的源码。-a good graph algorithm source code, including the traverse map, the shortest path, and it is to map, many other topological sorting algorithm source code.
Date : 2026-01-01 Size : 9kb User : xiaofeng
[Data structs] span_forest DL : 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 triangular part. -Computes estimates for the number of fores ts 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 wit h 0 diagonal. but uses only the upper triangular part.
Date : 2026-01-01 Size : 3kb User : 卢松
[Data structs] oulat DL : 0: 欧拉图的使用，和它的源码，还有欧拉图的原理和解释，希望大家能用到-Graphs use, and its source code, there is a graph theory and explained that the hope that everyone can be
Date : 2026-01-01 Size : 4kb User : 赵寰
[Data structs] DataStructure-Graph DL : 0: 纯C写的图操作的一些程序,对于初学数据结构的朋友了解图的一些性质有很大帮助.程序很简洁明了,文本选择界面,无图形界面.-write pure C plans to operate some of the procedures, data structure for the novice friends to understand the nature of the map will be of great help. procedures are clear and concise text selection interface, no graphical interface.
Date : 2026-01-01 Size : 2kb User : wei
[Data structs] Diagram DL : 0: 图的操作,包括,图的基本存储方法,有关图的操作算法并用C语言编程实现,图的搜索路径的遍历方法,以邻接矩阵和邻接表的方式存储连通图。然后分别用优先深度算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。深度优先遍历的递归算法（1）深度优先遍历算法（2）邻接表表示的深度优先搜索算法（3）邻接矩阵表示的深度优先搜索算法.-plan of operation, including, map the basic storage methods, the operation of the map algorithm and C language programming. map of the search path traversal methods to the adjacency matrix and adjacency list of storage connected graph. Then, using the priority traversal algorithm depth of the matrix adjacent to the storage map and the adjacent forms storage plans. Depth-first traversal of the recursive algorithm (1) depth-first traversal algorithm (2) adjoining table depth-first search algorithm ( 3) adjacency matrix of depth-first search algorithm.
Date : 2026-01-01 Size : 1kb User : 林静
[Data structs] Code DL : 0: 这是关于图论算法里面的一些代码,图论基本的思想代码的实现-This is on the graph theory algorithm inside some code, graph theory, the idea of the basic code realize
Date : 2026-01-01 Size : 5kb User : panbowen
[Data structs] ljb DL : 0: 用邻接表实现个图的存储，在VISUAL C++环境中实现-Realize using adjacency list of graph storage, in VISUAL C++ Environment
Date : 2026-01-01 Size : 1kb User : pallas
[Data structs] tu DL : 0: 数据结构中图的实现源代码，用C语言实现，有测试代码。-Graph data structure to achieve the source code, using C language, there is test code.
Date : 2026-01-01 Size : 4kb User : 黄勇
[Data structs] shortestway DL : 0: 数据结构最短路径算法实现，可实现有向图，无向图，有向网，无向网四种最短路径求解，最后打印路径，和路径长度-Data structure to achieve the shortest path algorithm can be realized digraph, undirected graph, to the network, without the four shortest path to the network to solve the final print path, and path length
Date : 2026-01-01 Size : 184kb User : ling
[Data structs] graph DL : 0: 图的广度优先遍历和深度优先遍历,C语言程序 -Graph breadth-first traversal and depth-first traversal, C Programming Language
Date : 2026-01-01 Size : 1kb User : 张熙
[Data structs] graph DL : 0: 实现无向图(或有向图)的存储表示,并输出对该图的广度优先（或深度优先）遍历。系统具备如下的功能： 1．初始化。从键盘输入图的顶点数与边数。 2．输出图的相应的存储表示。 3．输出图的广度优先遍历序列。 4．输出图的深度优先遍历序列。-Realize undirected graph (or digraph) express storage and output of the graph breadth-first (or depth-first) traversal. The system has the following features: 1. Initialization. From the keyboard input graph Vertices and edges. 2. The corresponding output map of the store said. 3. Output graph breadth-first traversal sequence. 4. Output graph depth-first traversal sequence.
Date : 2026-01-01 Size : 86kb User : 张娟
[Data structs] graph DL : 1: 实现了图的主要操作:（1）分别用邻接矩阵和邻接表实现图的基本操作（包括图的广度和深度优先搜索）；(2）判断该图是否连通，输出该图的连通分量数目；（3）输出一个每一个连通分量的最小生成树。-The main achievement of the plan steps: (1), respectively, with adjacency matrix and adjacency list to achieve the basic map operations (including map the breadth and depth-first search) (2) to determine whether the connectivity of the graph, the output of the graph the number of connected components (3) the output of a connected component of every minimum spanning tree.
Date : 2026-01-01 Size : 20kb User : 李雅芳
[Data structs] graph DL : 0: 图论的算法，最短路，最小生成树，连通，匹配，网络流及应用。-Graph theory, algorithms, shortest path, minimum spanning tree, connectivity, matching, network flow and applications.
Date : 2026-01-01 Size : 39kb User : young
[Data structs] graph DL : 0: 刘儒佳的“图”教材，总结得相当的不错，建议-graph
Date : 2026-01-01 Size : 575kb User : 林炳忠
[Data structs] graph DL : 0: 该压缩文件中包含了图论当中的一些重要算法，包括前序中序和后序遍历、最小二叉树、DFS、BFS以及拓扑排序。-The compressed file contains a graph theory among a number of important algorithms, including the former order in the order and postorder traversal, the smallest binary tree, DFS, BFS, and topological sort.
Date : 2026-01-01 Size : 926kb User : 许娜娜
[Data structs] graph DL : 0: 有向图采用邻接表存储 DFS和BFS方法遍历为方便表示,结点数小于10 用V0-V9表示不同的结点的-Directed graph using adjacency list method of storing DFS and BFS traversal for the convenience that the number of nodes is less than 10 with V0-V9 for different node
Date : 2026-01-01 Size : 2kb User : 刘少东
[Data structs] adjacency matrix to represent the graph DL : 0: (1)使用邻接矩阵表示图，定义相应的抽象数据类型。 (2)实现两个图ADTs的上述函数。 (3)从空图开始，生成图形对象表示图1所示的图形，将顶点和边逐一插入。 (4)以BFS方式遍历图。((1) Use adjacency matrix to represent graphs and define the corresponding abstract data type. (2) Realize all the above functions for the two graph ADTs. (3) Starting from an empty graph, generate a graph object represent the graph shown in Fig. 1 by inserting the vertices and edges one by one. (4) Traverse the graph in BFS manner.)
Date : 2026-01-01 Size : 13kb User : mia_shao

« 12 3 4 5 6 7 8 9 10 ... 49 »