搜索资源列表
RIPprogram
- a RIP distance vector implementation for a simple graph
MinimumSpanningTree
- 在图形中若于个边(edge)上加上一些值,此数值称为比重( weight ) 。而此图形称为比重图形(Weight Graph ) ,若weight是成本( cost )或距离( distance ) ,则称此图形为网路( Network )。根据Spanning Tree的定义,知一个图形可有许多不同spanning tree ,在network中找出一个具有最小成本( Cost )的Spanning tree ,则此Spanning tree称为最小成本生成树。-If in the grap
min_distance
- 算法原理:对由所有绿洲以及起点/终点构成的图,运用广度搜索进行遍历, 同时动态更新图中当前遍历node以及其子节点对应的distance矩阵数据项, 遍历完毕后,distance矩阵中存储的即为各个node到起点的最佳路线距离。 -Algorithm: all the Oasis, as well as by the origin/destination consisting of maps, use to traverse the breadth of search, at t
Dijkstra_AdjMtrx
- 用c++实现的以邻接矩阵为输入的Dijkstra算法,可以输出图中任意两点间的最短距离矩阵-Using c++ implementation of the adjacency matrix as input to the Dijkstra algorithm can output the graph of the shortest distance between any two matrices
supermarket
- 学校超市选址问题(带权有向图的中心点) 设计要求:对于某一学校超市,其他各单位到其的距离不同,同时各单位人员去超市的频度也不同。请为超市选址,要求实现总体最优 -School Supermarket location problem (with the right of the center of a directed graph) design requirements: For a school supermarkets and other units to its
dijkstra
- 求解图中起点到任意一个点的最小距离 输出len 和 meth分别记录长度 和 父亲点-Solving the graph point of origin to any point of a minimum distance of the output record length len, and meth and father respectively, point
3dActive_src
- 一个3d可视化控件 ,不需要在进行编译 遵循Cpol-The control can perform the following functions: Axis customization, including customizable font, colors, and titles. Plot a large number of points and updating one or more plots on the graph with new data, replacin
daoyouxitong
- 设计校园导游程序,完成校园信息的维护以及为来访的客人提供服务。 (1) 记录校内各景点信息:景点名称、代号、简介等; (2) 记录景点之间道路信息包括:两点距离、所需时间等相关信息; (3) 数据的输入可以是键盘输入或文件导入; (3) 提供对校园景点信息的编辑(如:添加、删除、修改等)的功能; (5) 为来访客人提供图中任意景点相关信息的查询; (4) 为来访客人提供从校门口到图中任意景点的问路查询,查询出距离最短的往返方案;-Cam
bellman-ford.c
- bellman-ford algorithm to find shortest distance in a graph. useful for path planning.
kechengsheji
- 对于某一学校超市,其他各单位到其的距离不同,同时各单位人员去超市的频度也不同。请为超市选址,要求实现总体最优。(带权有向图的中心点)-Schools for a supermarket, other units of the distance of its different units while the frequency of the supermarket staff are also different. Please supermarket location, required to
nixushuzuiduanlujing
- 该文件夹中包括几个acm比赛中用到的模板 求逆序数,无向图的bfs收索,有向图中的两点间的最短距离。希望对大家有用。-The folder includes several templates used in the game acm find reverse numbers, income bfs undirected graph cable, directed graph in the shortest distance between two points. Hope that use
lisanshuxushiyan3
- 以偶对的形式输入一个无向简单图的边,建立该图的邻接矩阵,判断图是否连通(A)。并计算任意两个结点间的距离(B)。对不连通的图输出其各个连通支(C)。-Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (A). And calculate any distance betwe
chaoshixuanzhiwenti
- 对于某一学校超市,其他各单位到其的距离不同,同时各单位人员去超市的频度也不同。请为超市选址,要求实现总体最优。通过该题目的设计过程,可以加深理解图数据结构,掌握某些基本运算的实现,进一步理解和熟练掌握课本中所学的各种数据结构,学会如何把学到的知识用于解决实际问题,培养学生的动手能力。-For a school the supermarket, and other units to its distance from different units who go to the supermarke
MINIMALpATH
- A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph constructed so that the distance between a selected root node and all other nodes is minimal. It is a tree because if there are two paths between the root node
ALGORITHME-DIJKSTRA-SUR-CARTE-FRANCE___Page
- Application of Dijkstra s algorithm on a map of France (bottle) with 8 cities (the distance in kilometers and tps are in villes.txt). Seeks the shortest path between two points of a graph (link> 0)
Snake-model-bsegmentation-method
- 改进的T- Snake 算法首先在分水岭法中, 对相邻区域以其像素数、灰度均值和灰度方差定义距离, 并据其在图像上建立新的连通图, 以对图像过度分割而产生的一些过小区域合并 其次, 在模型跨边缘时, 利用已分割断层图像中模型内部区域的统计特征, 用区域生长法获取内点并重新参数化模型, 使模型不再跨边缘, 以保证模型形变到正确的边缘-Improved T-Snake algorithm first law in the watershed, the number of pixels in its
fenzhijiexianfa
- 分支界限法是由“分支”和“界限”策略两个部分组成,其中“分支”策略是对问题空间按照广度优先的策略进行搜索;“限界”策略是为了加速搜索速度而采用启发信息剪枝的策略。 使用分支限界法来解决单源最短路径问题时主要利用结点控制关系剪枝,在一般情况下,如果解空间树中以结点Y为根的子树中所含的解优于以结点X为根的子树中所含的解,则结点Y控制了结点X,以被控制的结点X为根的子树可以剪去。算法实现时,使用邻接矩阵表示图,二维数组存储图的邻接矩阵,使用数组记录源到各顶点的距离和路径上的前驱顶点。 -Br
cebk_tsp
- 用离散数学或图论的术语来说,假设有一个图g=(v,e),其中v是顶点集,e是边集,设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵,旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。 -Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge se
Kruskal
- 编程实现Kruskal算法,生成最小代价生成树,其中利用最小堆算法实现。 (随机生成n个点,且随机生成k条边,形成连通图) 根据输入的顶点数的不同,分析时间复杂度。-Implement Kruskal’s algorithm based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected com
Prim
- 编程实现Prim算法,基于最小堆数据结构,生成最小代价生成树。 (其中随机生成点和边,形成连通图) 根据输入的顶点数的不同,分析时间复杂度。-Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for