搜索资源列表
buddy-2.4.tar
- 当前最完善的OBDD程序实现。可用于并行计算分析，网络图论分析-At present, the most perfect realization of OBDD procedures. Analysis can be used for parallel computing, network graph theory analysis
20031221563281
- 著名图论问题之一。邮递员从邮局出发送信，要求对辖区内每条街，都至少通过一次，再回邮局。在此条件下，怎样选择一条最短路线?此问题由中国数学家管梅谷于1960年首先研究并给出算法，故名。-Well-known graph theory problems. Postman deliver a letter from the post office proceed to require every street within the right area, at least through the ti
2007101220331726911
- 著名图论问题之一。邮递员从邮局出发送信，要求对辖区内每条街，都至少通过一次，再回邮局。在此条件下，怎样选择一条最短路线?此问题由中国数学家管梅谷于1960年首先研究并给出算法，故名。-Well-known graph theory problems. Postman deliver a letter from the post office proceed to require every street within the right area, at least through the ti
111
- 城市铁路交通路线查询系统，主要用到了图论最短路径的知识，输入起点和终点能够查出对应的路径和最小用时-City rail line inquiry system, the main use of the knowledge of graph theory, shortest path, enter the start and end be able to find corresponding path and minimum use of time
333
- 利用图论的知识实现了最小生成树的算法，包括创建图，然后遍历图的每个节点输出生成树的节点-Knowledge of graph theory to achieve the minimum spanning tree algorithms, including the creation of maps, and then traverse the graph spanning tree output nodes for each node
dijkstra
- implements dijkstra algorithm in c related to graph theory
node_generator
- It s high end node generator for applications in graph theory.
allroute
- 该程序遍历了源点到终点的所有路径，能够所搜得到所有的路径并写入到记事本中，在图论中有广泛的应用。-The program traverses all the paths of the source point to the end point, be able to search to get all of the paths and written into Notepad, and a wide range of applications in graph theory.
tulun
- 图论文档，图论代码的模板，适用于ACM比赛及对算法有兴趣的人-Graph Theory documents, graph theory template code for ACM Contest and who are interested in the algorithm