Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - graph plan

Search list

[OpenGL program] OpenGL基础

Description: OpenGL基础 对初学OpenGL的朋友可以看看 里面对于基本图形绘制说的很明白 是本不错的书-OpenGL foundation to the friend which begins studies OpenGL may have a look to say regarding the basic graph plan understood very much is this good book
Platform: | Size: 287697 | Author: yang | Hits:

[Other resource] plotmap

Description: 图形绘制- The graph plan/demonstration graph plan/demonstration graph plan/demonstration graph plan/demonstration graph plan/demonstrated
Platform: | Size: 266581 | Author: 殷宏云 | Hits:

[Graph program] dibimage

Description: 一个可以存为bmp、jpeg等图形格式的图形绘制、编辑程序- May save is graph form the and so on bmp, jpeg graph plan, the edit routine
Platform: | Size: 454656 | Author: 站长 | Hits:

[Graph program] CDrawLine

Description: 绘制图形的CGraph类，可以绘制各种图形如走势线、直方图、饼图- The plan graph CGraph kind, may draw up each kind of graph like trend line, the histogram, the cake chart
Platform: | Size: 29696 | Author: 站长 | Hits:

[Embeded-SCM Develop] PocketScribble

Description: 这是一个在WindowsCE 环境下进行图形绘制的源程序。- This is carries on the graph plan under the WindowsCE environment the source program.
Platform: | Size: 92160 | Author: 刘梦 | Hits:

[OpenGL program] OpenGL基础

Description: OpenGL基础 对初学OpenGL的朋友可以看看 里面对于基本图形绘制说的很明白 是本不错的书-OpenGL foundation to the friend which begins studies OpenGL may have a look to say regarding the basic graph plan understood very much is this good book
Platform: | Size: 287744 | Author: yang | Hits:

[Graph Drawing] plotmap

Description: 图形绘制- The graph plan/demonstration graph plan/demonstration graph plan/demonstration graph plan/demonstration graph plan/demonstrated
Platform: | Size: 266240 | Author: 殷宏云 | Hits:

[Mathimatics-Numerical algorithms] bellman

Description: 用C语言实现最短路径算法中的Bellman-Ford算法，这个算法可以用来解决信号处理中的一些问题。bellman_ford.c为源程序；distance.txt文件存放各界点之间的距离，以99999表示无穷大；bellman_ford.txt文件是输出文件，存放每轮循环得到的中间值，以及最后得到的到各个节点的最短距离，如果图包含负回路，文件中返回FALSE。-C language shortest path algorithm to achieve the Bellman-Ford algorithm, The algorithm can be used to solve signal processing some of the problems. Bellman_ford.c to source; distance.txt document repository all the distance between points, to 99,999 infinite said. bellman_ford.txt document output files, storage cycle round the middle value, and, finally, the various nodes of the shortest distance, if the plan contains negative loop, the paper returns FALSE.
Platform: | Size: 103424 | Author: 李文 | Hits:

[Data structs] Diagram

Description: 图的操作,包括,图的基本存储方法,有关图的操作算法并用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.
Platform: | Size: 1024 | Author: 林静 | Hits:

[Other] 00000766

Description: Multirobot Plan Generation in a Continuous Domain: Planning by Use of Plan Graph and Avoiding Collisions Among Robots
Platform: | Size: 742400 | Author: 刘军 | Hits:

[Data structs] graph

Description: 这个是有关数据结构中有关图的存储问题,包含了邻接表,和邻接巨阵的存储代码-This is the data structure of a related plan of storage issues, including the adjacent table, and adjacent giant storage array code
Platform: | Size: 3072 | Author: GXL | Hits:

[Data structs] graph

Description: 实现了图的主要操作:（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.
Platform: | Size: 20480 | Author: 李雅芳 | Hits:

[Data structs] Graph

Description: 是一个在学习数据结构时编写的图结构，主要是用两种方法生成需要的图结构，其中有一个头文件都注释了，要是要使用的话，只需要将另一个头文件注释并把这个取消注释，在main方法中改一个类名就好了-Is a data structure in the learning plan to prepare the structure, is mainly used two methods to generate the need for the graph structure, in which there is a header file are annotated, if you want to use words, just another header file to the Notes and the cancellation of Notes, in the main method to a class name like the
Platform: | Size: 7168 | Author: 王龙飞 | Hits:

[Data structs] lujin

Description: 最短路径问题（用无向图表示n个城市之间的交通网络建设规划，顶点表示城市，边上的权表示该线路的造价，试设计一个方案，使得这个交通网的总造价最小。）-The shortest path problem (with undirected graph n cities that transport links between the construction plan, vertex, said city, said the right edge of the construction cost of the line and try to design a program, making the transport network of the total cost of the smallest.)
Platform: | Size: 13312 | Author: uliantong | Hits:

[Other] DiscreteMathematics

Description: 本课程为本专业(独立本科段)的一门专业基础课。课程内容为：命题逻辑和一阶谓词逻辑的基本概念和基本演算；集合的概念和运算、二元关系和函数；代数运算和代数系统的基本性质、半群和群、队和域、格和布尔代数；图的基本概念、树、欧拉图和哈密顿图、平面图、图着色、赋权图、二部图等。 通过本课程的学习，使应考者有抽象思维和逻辑推理能力，掌握计算机科学技术常用的离散数学中的概念、性质和运算。 自学教材：<<离散数学>>(全国考委组编) 左孝凌 主编 经济科学出版社 参考用书 ：<<离散数学>> 左孝凌等编 上海科技出版社 1982 -he major curriculum centered (independent undergraduate paragraph) of a major foundation courses. Curriculum content are: propositional logic and first order predicate logic the basic concepts and basic calculus collection of concepts and computation, binary relations and functions algebraic operations and the basic properties of algebraic systems, semi-groups and groups, teams and domain, grid and Boolean algebra map the basic concepts, trees, Euler and Hamiltonian graph map, plan, map coloring, weighted graph, etc. Figure 2. Through the study of the curriculum so that candidates have abstract thinking and logical reasoning ability, computer science and technology have often used the concept of discrete mathematics, nature, and computing. Self-study materials: <<Discrete Mathematics>> (全国考委Unit) ZUO Xiao-Ling Economic Science Press editor-in-chief Reference book: <<Discrete Mathematics>> ZUO Xiao-Ling et al 1982, Shanghai Science and Technology P
Platform: | Size: 1098752 | Author: alse | Hits:

[Windows Develop] graph

Description: c++实现的图基础算法的包装类，提供了关于图的一些基础操作-c++ to achieve the plan based on the packaging type of algorithm provides a foundation on the map operation
Platform: | Size: 27648 | Author: li | Hits:

[Data structs] graph

Description: 图： 调试图的邻接链表存储的程序，解决下列问题： 根据教科书P157页的G2图（无向图），输入数据运行程序；再适当修改程序使它适用于G1图（有向图），输入数据运行程序。-Adjacency list graph debug stored procedures, to address the following issues: According to the textbook page G2 Fig P157 (undirected graph), input data to run programs modify the program so that it no longer appropriate for G1 plan (directed graph), input data run the program.
Platform: | Size: 107520 | Author: 奈奈 | Hits:

[Data structs] multiStageGraph

Description: 使用动态规划求多段图的C++源程序，用于满足最优化问题且问题能转换成一个有向图问题的求解，可以直接运行！-The use of dynamic programming for multi-stage plan of C++ source code, designed to meet the optimization problem and the problem can be converted into a directed graph to solve the problem, you can directly run!
Platform: | Size: 229376 | Author: 张凯兵 | Hits:

[Data structs] graph

Description: 根据现有图，实现求关键路径的算法，自己编写的，有什么问题请指教-Under the existing plan, the realization of the algorithm for critical path
Platform: | Size: 492544 | Author: 天天 | Hits:

[Other] graph

Description: 本程序描述图的算法的表述，可以通过该程序学习图的程序设计-This procedure describes the graph algorithm representation, you can learn through the process of program design plan
Platform: | Size: 4096 | Author: 于孟磊 | Hits:
« 12 3 4 5 »

CodeBus www.codebus.net