Search - graph - CodeBus

Search - graph - List

[VC/MFC] pca2011 DL : 0: About graph study writings industry plan NURBS curved surface -About graph study writings industry plan N spline curved surface
Date : 2026-01-01 Size : 4kb User : lee
[VC/MFC] VC++code DL : 0: 关于vc++深入学习源码知识，非常有用的，很完善。-About vc++ Depth study of source of knowledge, very useful, very perfect.
Date : 2026-01-01 Size : 1.68mb User : 袁炼勇
[VC/MFC] 3 DL : 0: 图论的算法与程序设计电子书_学科_计算机-Graph Theory Algorithms and Programming computer e-books _ disciplines _
Date : 2026-01-01 Size : 5.05mb User : refine
[VC/MFC] DSF DL : 0: 无向图的深度优先搜索算法/c语言实现其中图采用邻接矩阵存储 -Undirected graph of the depth-first search algorithm/c language in which Fig realize the use of adjacency matrix storage
Date : 2026-01-01 Size : 1kb User : 罗军
[VC/MFC] Graph DL : 0: 对vc中的mfc的相应控件进行说明，适合初学者-Mfc on vc in the corresponding controls that for beginners
Date : 2026-01-01 Size : 410kb User : yiva
[VC/MFC] souce DL : 0: 编写一个非递归算法求有向无环图G的每个顶点出发的最长路径的长度（每条弧的长度均为1）并存入mpl域中。-The preparation of a non-recursive algorithm for directed acyclic graph G each vertex based on the longest path length (the length of each arc are 1) and deposited mpl domain.
Date : 2026-01-01 Size : 4kb User : shilei
[VC/MFC] prod DL : 0: 一个在MFC下可以动态显示产品产量的柱形图程序，适合MFC初学者学习-MFC can be a dynamic display of the bar graph output procedures, suitable for beginners to learn MFC
Date : 2026-01-01 Size : 45kb User : 金朋轩
[VC/MFC] boost_graph_library DL : 0: 关于boost graph library的文档，值得好好研究一下-Boost graph library on the document, it is worth a good look
Date : 2026-01-01 Size : 1.12mb User : hahaha
[VC/MFC] Graph_Theory_and_Its_Implementation_Algorithm DL : 0: 图论算法及其实现许多学生在学习图论时，都迫切地想知道如何用程序实现图论中的算法，以及如何将这些算法思想用来求解实际问题。而市面上侧重于用程序实现图论算法、并通过例题阐述图论算法思想 -Graph Theory and Its Implementation Algorithm for a number of students in learning graph theory, they urgently want to know how to program the algorithm in graph theory, and thinking of how these algorithms will be used to solve practical problems. And the market focused on the use of procedures to achieve graph theory algorithms, and through the example of graph theory algorithm for thinking
Date : 2026-01-01 Size : 5.12mb User : sinkangel
[VC/MFC] dijkstra DL : 1: dijkstra算法问题描述目前网络上电子地图的使用很普遍。利用电子地图可以很方便地确定从一个地点到另一个地点的路径。特别地，可确定在城市中的公交换乘路线。电子地图可以看成是一个图，而公交线路图可看成是带权有向图G =(V,E)，其中每条边的权是非负实数。你的任务：对给定的一个（无向）图G，及G中的两点s、t，计算从顶点s到顶点t的最短距离和最少路段数。输入输入文件中有若干组测试数据（组数不超过20）。每组测试数据的第1行是一个正整数n，表示地图G的顶点数，n<50。接下来的n行采用邻接矩阵方式描述这一个地图，第i行有n个数，依次表示第i个顶点与第1、2、3、…、n个顶点的路径长。假如两个顶点间无边相连，用一个-1表示。相邻的两个整数之间用空格隔开。注意，图中每个顶点 i处都没有自己到自己的边。再在下面的一行上给出两个整数s、t，表示上述地图上的两个顶点。每组测试数据输入结束后空一行。输入直到文件结束。-Description of the problem At present the use of electronic maps on the network are common. The use of electronic maps can be easily identified from one location to another location path. In particular, can be determined in the cities bus transfer routes. E-map can be seen as a map, while the bus route map can be seen as a weighted directed graph G = (V, E), in which each edge of the right of a non-negative real number. Your task: given a (undirected) Figure G, and G, two points s, t, calculated from the vertex s to vertex t, the shortest distance and the minimum number of sections. Input Input file there are several groups of test data (group of not more than 20). Each test data row 1 is a positive integer n, said the map of G, vertices, n <50. The next n lines describe the use of adjacency matrix, a map, the first i have n number of rows in turn said that the first i vertices with the first 1,2,3, ..., n vertices of the path length. If the two ver
Date : 2026-01-01 Size : 862kb User : 谷
[VC/MFC] graph DL : 0: 图的所有操作实现，邻接图邻接表遍历、打印，等-Graph traversal implementation of all operations, printing, etc.
Date : 2026-01-01 Size : 38kb User : 朱胜强
[VC/MFC] Graph DL : 0: 图算法，按照算法导论书上得来，简单易用。-Graph algorithms, according to the book Introduction to Algorithms, come on, easy to use.
Date : 2026-01-01 Size : 24kb User : ywwqgreat
[VC/MFC] Graph DL : 0: Code of problem in text book as following Data Structures: A Pseudocode Approach with C-Graph
Date : 2026-01-01 Size : 3kb User : allenlin
[VC/MFC] Graph-traversal- DL : 0: 在vc6.0环境下，实现图的深度优先遍历和广度优先遍历-In vc6.0 environment, to achieve depth-first graph traversal and breadth-first traversal
Date : 2026-01-01 Size : 177kb User : plum
[VC/MFC] The.Boost.Graph.Library DL : 0: The Boost Graph Library
Date : 2026-01-01 Size : 1.12mb User : dianthus83
[VC/MFC] graph DL : 0: 中文版电子书，与图形学相关,不过要用到超星阅读器-This is a book about drawing graph with vc++ 6.0, if you do not know Chinese ,you can not read it.
Date : 2026-01-01 Size : 5.21mb User : 朱鹏举
[VC/MFC] CPP-algorithm-graph-edition-3 DL : 0: 本书介绍了图的基本算法，讲的较为详细，且结合实际应用，推荐-This is the graph algorithm with C++, which introduces the basic concepts and algoriths for the graph, very good!
Date : 2026-01-01 Size : 14.81mb User : 杨志成
[VC/MFC] graph DL : 0: 其中包括图的实现（数组表示，邻接表表示，十字链表表示，邻接多重表表示）；图的连通性（无向图的生成树，有向图的连通分量，最小生成树，关节点）；图的应用（拓扑排序，关键路径，Dijkstra算法，Floyd算法）。-Including the implementation of a map (array, said adjoining table, cross-linked, said the adjacent multi-table representation) graph connectivity (spanning undirected graph, directed graph of connected components, minimum spanning tree, joints) diagram of (topological sorting, critical path, Dijkstra algorithm, Floyd algorithm).
Date : 2026-01-01 Size : 2.61mb User : 郭悠悠
[VC/MFC] Graph DL : 0: 该ppt包含了图的数据结构及基本操作，同时还有图的最短路径，深度，广度遍历等-This ppt contains the graph data structure and basic operation, as well as the shortest path, depth, breadth traversal
Date : 2026-01-01 Size : 55kb User : 谢文婷
[VC/MFC] Graph-Theory DL : 0: 图论学习，图论学习，图论学习。-Learning Graph Theory
Date : 2026-01-01 Size : 693kb User : sy

« 12 3 4 5 6 »