搜索资源列表
GraphAlgorithm
- 用applet显示的Dijkstra算法,用于计算图论中点到点的最短距离-using applet shows the Dijkstra algorithm used in the calculation of graph theory point-to-point shortest distance
dijkstraCPP
- 由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 sho
chengshi
- 这个是我设计的城市交通无向图程序，里面的地点、距离已经给定（当然可以修改），运行时输入起点和终点即可。-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.
zxksxt123
- 网络考试系统旨在实现考试的无纸化管理，对一些科目的考试可以通过互联网络或局域网进行，方便校方考务的管理，也方便了考生，尤其适合考生分布广，不易集中的远程教育。本系统包括系统管理、考生管理、在线考试、在线制作试卷、控制学生考试、试卷审批中心等功能。本论文主要介绍了系统的分析，设计和开发的全部过程。运用数据流图，ER图，程序流程图等对系统的设计过程进行详细的说明。全文共分为前言、需求分析、系统设计、开发技术、关键技术解决，结论六部分。西统采用B/S开发模式，开发工具选择JAVA、JSP、Javas
最短路径导游的程序
- 校园导游咨询：编制一个为来访客人进行最短路径导游的程序从厦门大学漳州校区的平面图中选取10个有代表性的景点，抽象成一个无向带权图。以图中顶点表示景点，边上的权值表示两地之间的距离。 2.本程序的目的是为用户提供路径咨询。根据用户指定的始点和终点输出相应路径，或者根据用户指定的景点输出景点的信息。--Campus Tour consulting: the preparation of a shortest path for visiting guests to the program guide
Dijkstra
- Dijkstra算法的研究对象是赋权有向图（图用加权矩阵表示）的单源最短路径问题。可以求出任意节点到其他所有节点的最短距离。-The research object is the Dijkstra algorithm of weighted directed graph ( graph with weighted matrix) of single source shortest path problem. Can be obtained any node to all other nodes
floyd
- 弗洛伊德算法求图中每两点最短距离，图论经典算法，数学建模-Floyd Algorithm for Finding the shortest distance two points in each chart, graph theory, the classical algorithm, mathematical modeling
Girth-eightQC-LDPC
- 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
schooltravel
- 随着社会的发展，各界人士不断走进高校进行考查。随着旅游业的发展，各高校也可能成为旅游的景点。人们关心的问题是如何在有限的时间内能高效率的参观完一所学校的景点。对于这个问题，可以用一个图结构来表示交通网络系统，利用计算机建立一个校园导游咨询系统，方便参观者查询各个景点间的最短距离。-With the development of society, from all walks of life continued into the colleges and universities to carry
ShortDistance
- 或得一个连通图两两之间最短路径的代码，算法导论上的算法，自己实现的-a funtion to get the shortest distance between each to noeds in a graph
K
- Implementations of a queue in C with algoritmo BFS, that calculates the minimum distance in a graph.
dijkstra
- this program shortpathes node using graph for decide short distance in networking
graph
- to calculate the maximum distance between n number of points in a graph
Graph
- 关于复杂网络社团结构的相关程序，其中包括求节点间最短距离，求边介数等等。-There are some procedures about community structure of comlex network which includes the shortest distance between nodes and betweeness and so on.
dijkstra_openmp
- DIJKSTRA_OPENMP is a C++ program which illustrates the use of the OpenMP application program interface by implementing Dijkstra s minimum graph distance algorithm
graph
- 连通图的遍历（深度优先算法）求2个城市的最短距离，以及任何一条最短的路径-Connected graph traversal (depth-first algorithm) Find the shortest distance two cities, as well as any one shortest path
Find-Center-of-Mass-and-Distance
- 计算质心坐标(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
Graph
- Graph measuring the Shortest Distance to vertex, class file for the The Path.java program.
Node Similarity-based Graph Clustering and Visualization
- The basis of the presented methods for the visualization and clustering of graphs is a novel similarity and distance metric, and the matrix describing the similarity of the nodes in the graph. This matrix represents the type of connections between th
a path with a distance of K and no loop
- 求无向图任意两个顶点是否存在距离为k且不含回路的路径(Whether any two vertex of an undirected graph has a path with a distance of K and no loop)