Search - tudebianli

Search - tudebianli - List

[WEB Code] tudebianli DL : 0: 一、程序分析 1．以邻接多重表为存储结构，实现连通或非连通的无向图的深度优先与广度优先遍历。 2．设图的结点不超过30个，每个结点用一个编号表示。通过输入图的边输入一个图，每条边为一个数对。 3．问题描述： 4．以第一个结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边。
Date : 2008-10-13 Size : 19.28kb User : 姚晶晶
[Other resource] tudebianli DL : 0: 数据结构与算法图的遍历算法
Date : 2008-10-13 Size : 7.46kb User : 夏涛
[Mathimatics-Numerical algorithms] tudebianli DL : 0: 图的遍历，搜索-traverse map, search
Date : 2008-10-13 Size : 43.01kb User : 郭健
[Other resource] tudeBianli DL : 0: 图的遍历算法的演示，数据结构的课程设计，演示具体的具体操作，有文档资料
Date : 2008-10-13 Size : 48.26kb User : 高先生
[Other resource] tuDeBianLi DL : 0: 以邻接表为存储结构，选择图的类型（有向图或无向图），创建相应的图。对创建的图按深度优先和广度优先的遍历。（文档中含代码）
Date : 2008-10-13 Size : 24.81kb User : 展令杨
[Mathimatics-Numerical algorithms] tudebianli DL : 0: 图的遍历，搜索-traverse map, search
Date : 2025-07-08 Size : 175kb User : 郭健
[Documents] tudebianli DL : 0: 一、程序分析 1．以邻接多重表为存储结构，实现连通或非连通的无向图的深度优先与广度优先遍历。 2．设图的结点不超过30个，每个结点用一个编号表示。通过输入图的边输入一个图，每条边为一个数对。 3．问题描述： 4．以第一个结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边。 -First, program analysis 1. To the adjacent multi-table for the storage structure, to achieve connectivity and non-connected undirected graph with a depth-first breadth-first traversal. 2. Node-based map is not more than 30, each node with a number that. Map by entering the input side of a graph, and each side for a few right. 3. Problem Description: 4. To the first node as a starting point, respectively, under the output of each node traversal visit sequences and the corresponding spanning tree edge.
Date : 2025-07-08 Size : 19kb User : 姚晶晶
[Data structs] tudebianli DL : 0: 数据结构与算法图的遍历算法-Data structure and algorithm graph traversal algorithm
Date : 2025-07-08 Size : 7kb User : 夏涛
[Data structs] tudeBianli DL : 0: 图的遍历算法的演示，数据结构的课程设计，演示具体的具体操作，有文档资料-Graph traversal algorithm demo, data structure of curriculum design, presentation of specific concrete operation, have documentation
Date : 2025-07-08 Size : 48kb User : 高先生
[Data structs] tuDeBianLi DL : 0: 以邻接表为存储结构，选择图的类型（有向图或无向图），创建相应的图。对创建的图按深度优先和广度优先的遍历。（文档中含代码） -To the adjacent table for the storage structure, select the type of graph (directed graph or undirected graph), create a corresponding map. To create the graph by depth-first and breadth-first traversal. (The document containing the code)
Date : 2025-07-08 Size : 25kb User : 展令杨
[Other] tudebianli DL : 0: 222 2分别通过深度和广度对图进行遍历-222 2, respectively, through the depth and breadth of the graph traversal
Date : 2025-07-08 Size : 2kb User : 张岳鹏
[Data structs] tudebianli DL : 0: 图的遍历和生成树求解实现（邻接矩阵、邻接表 ―图的深度广度遍历算法的实现和最小生成树PRIM和KRUSCAL算法的实现） -Graph Traversal and Spanning Tree Solution implementation (adjacency matrix, adjacency list- map the depth of breadth traversal algorithm and implementation of the minimum spanning tree algorithm PRIM and implementation KRUSCAL)
Date : 2025-07-08 Size : 9kb User : xqx
[source in ebook] tudebianliywc DL : 0: 只要就是用来实现图的遍历的功能，用c++语言实现的，是比较精简的数据结构。-shixian tudebianli gongneng
Date : 2025-07-08 Size : 2kb User : yanweu
[File Format] tudebianli DL : 0: 这个是图的遍历演示源程序代码，是用c语言写的，大家可以参考一下这个算法-This is a graph traversal demo source code is written in c language, we can refer to this algorithm
Date : 2025-07-08 Size : 4kb User : yeah
[Other] tudebianli DL : 0: 图的遍历包括深度优先搜索和广度优先搜索，大家可以看看。-Graph traversal, including depth-first search and breadth-first search, we can look at.
Date : 2025-07-08 Size : 2kb User : zhangfei
[Windows Develop] tudebianli DL : 0: 图的遍历，查照最短路径，利用递归和迭代的算法-Graph traversal, shortest path looked at the use of recursive and iterative algorithms
Date : 2025-07-08 Size : 368kb User : gg
[Data structs] tudebianli DL : 0: 能够进行图的遍历，其中包括有队列的出对入队运算。-Graph traversal can be carried out, including a queue out the right into the team operation.
Date : 2025-07-08 Size : 6kb User : luojinke
[Other] tudebianli DL : 0: 图的遍历问题数据结构 C C++ 源码课程设计严蔚敏版的书-yrteryryer
Date : 2025-07-08 Size : 9kb User : mafan
[Data structs] tudebianli DL : 0: 实现图的深度优先, 广度优先遍历算法，并输出原图结构及遍历结果。初步完成总体设计，搭好框架；最低要求：两种遍历都要实现，写出画图的思路；进一步要求：画出图的结构，有兴趣的同学可以进一步改进图的效果。 -Implementation of Depth-first, breadth-first traversal algorithm, and outputs the original image structure and the traversal result. Completed the initial design, and setting up the framework minimum requirement: Two traversal must realize, the idea to write drawing further requirements: Draw Graphs, interested students can further improve the pattern performance.
Date : 2025-07-08 Size : 112kb User : zhangjunyan
[Other] tudebianli DL : 0: 图的深度遍历和广度遍历（以邻接表为存储结构）-The depth and breadth traversal graph traversal (in the adjacent table for the storage structure)
Date : 2025-07-08 Size : 234kb User : 清风煕

« 12 »