Location:
Search - graph distance
Search list
Description: 用applet显示的Dijkstra算法,用于计算图论中点到点的最短距离-using applet shows the Dijkstra algorithm used in the calculation of graph theory point-to-point shortest distance
Platform: |
Size: 8657 |
Author: aaa |
Hits:
Description: 由graph.txt读出源图并用临街链表显示出，然个用dijkstra算法算出给定两点的最短路径和任一给定点到其它各点的距离，graph.txt放在源代码同一目录，内附graph.txt示例-graph.txt read out by the source map and used chain along the street shows, However use the dijkstra algorithm to calculate the scheduled 2:00 and the shortest path as a sentinel for other points of the distance, graph.txt on the same source code directory, containing examples graph.txt
Platform: |
Size: 283983 |
Author: 比为 |
Hits:
Description: 这个是我设计的城市交通无向图程序，里面的地点、距离已经给定（当然可以修改），运行时输入起点和终点即可。-this is my design of urban traffic undirected graph procedures inside the location, distance has been given (of course can be revised), running importation will be starting and finishing points.
Platform: |
Size: 10404 |
Author: 陈慧 |
Hits:
Description: 网络考试系统旨在实现考试的无纸化管理，对一些科目的考试可以通过互联网络或局域网进行，方便校方考务的管理，也方便了考生，尤其适合考生分布广，不易集中的远程教育。本系统包括系统管理、考生管理、在线考试、在线制作试卷、控制学生考试、试卷审批中心等功能。本论文主要介绍了系统的分析，设计和开发的全部过程。运用数据流图，ER图，程序流程图等对系统的设计过程进行详细的说明。全文共分为前言、需求分析、系统设计、开发技术、关键技术解决，结论六部分。西统采用B/S开发模式，开发工具选择JAVA、JSP、Javas cript、Html语言，采用Tomcat服务器技术，后台数据库选用SQL Server 2000。
-network test system designed to achieve paperless examination of the management, Some of the subjects of the examination through the Internet or LAN, so that the school authorities Examination management has facilitated the candidates, especially suitable candidates widely distributed, difficult to concentrate on the long-distance education. The systems include systems management, management candidates, online examinations, online production of the papers, control examinations of students, paper processing centers, and other functions. This paper presents a systematic analysis, design and development of the whole process. Using the data flow graph, ER maps, flow charts and other procedures to the system design process in detail. The full text of the preamble is divided into, needs analysis
Platform: |
Size: 34547 |
Author: wangfei |
Hits:
Description: 用applet显示的Dijkstra算法,用于计算图论中点到点的最短距离-using applet shows the Dijkstra algorithm used in the calculation of graph theory point-to-point shortest distance
Platform: |
Size: 8192 |
Author: aaa |
Hits:
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:
Description: 由graph.txt读出源图并用临街链表显示出，然个用dijkstra算法算出给定两点的最短路径和任一给定点到其它各点的距离，graph.txt放在源代码同一目录，内附graph.txt示例-graph.txt read out by the source map and used chain along the street shows, However use the dijkstra algorithm to calculate the scheduled 2:00 and the shortest path as a sentinel for other points of the distance, graph.txt on the same source code directory, containing examples graph.txt
Platform: |
Size: 702464 |
Author: 比为 |
Hits:
Description: 这个是我设计的城市交通无向图程序，里面的地点、距离已经给定（当然可以修改），运行时输入起点和终点即可。-this is my design of urban traffic undirected graph procedures inside the location, distance has been given (of course can be revised), running importation will be starting and finishing points.
Platform: |
Size: 266240 |
Author: 陈慧 |
Hits:
Description: The algorith divides rows in to four equal groups. The rows are then used to from a distance graph which is then transformed into a matrix. girth of eight is maintained by avoiding six-cycles in the graph construction
Platform: |
Size: 2048 |
Author: 古立峰 |
Hits:
Description: Implementations of a queue in C with algoritmo BFS, that calculates the minimum distance in a graph.
Platform: |
Size: 1024 |
Author: Joao |
Hits:
Description: 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
Platform: |
Size: 882688 |
Author: 谷 |
Hits:
Description: this program shortpathes node using graph for decide short distance in networking
Platform: |
Size: 4096 |
Author: bayu setyo |
Hits:
Description: to calculate the maximum distance between n number of points in a graph
Platform: |
Size: 1024 |
Author: uche |
Hits:
Description: 关于复杂网络社团结构的相关程序，其中包括求节点间最短距离，求边介数等等。-There are some procedures about community structure of comlex network which includes the shortest distance between nodes and betweeness and so on.
Platform: |
Size: 2782208 |
Author: 李想 |
Hits:
Description: DIJKSTRA_OPENMP is a C++ program which illustrates the use of the OpenMP application program interface by implementing Dijkstra s minimum graph distance algorithm
Platform: |
Size: 4096 |
Author: nader |
Hits:
Description: 连通图的遍历（深度优先算法）求2个城市的最短距离，以及任何一条最短的路径-Connected graph traversal (depth-first algorithm) Find the shortest distance two cities, as well as any one shortest path
Platform: |
Size: 1024 |
Author: tscorner |
Hits:
Description: 计算质心坐标(c)与边界与质心间的距离r(i)，并绘制theta 与r_histogram 的关系曲线图-Calculating the centroid coordinates (c) between the boundary and the centroid distance r (i), and the mapping relationship between theta and r_histogram graph
Platform: |
Size: 1024 |
Author: 林彥彤 |
Hits:
Description: Graph measuring the Shortest Distance to vertex, class file for the The Path.java program.
Platform: |
Size: 2048 |
Author: bibs |
Hits:
Description: 求无向图任意两个顶点是否存在距离为k且不含回路的路径(Whether any two vertex of an undirected graph has a path with a distance of K and no loop)
Platform: |
Size: 11264 |
Author: 赵氏天儿
|
Hits:
Description: 基于RSSI的三点定位测算距离，并将坐标显示在图形中(Three RSSI-based localization estimates the distance, and the coordinates are displayed in the graph)
Platform: |
Size: 1024 |
Author: 戴文正 |
Hits: