Location:
Search - topology graph
Search list
Description: 主要用于对图论和三角测量的研究的工具箱，包含很多分析模拟网络拓扑的函数-mainly for the Graph Theory and Research Triangle measurement toolkit include many analyze the function of the network topology
Platform: |
Size: 673587 |
Author: 包海洁 |
Hits:
Description: Network Weathermap4RRD is a php or perl script that generates picture network links utilization. Data used to create graph are acquired from RRDTool databases or MRTG HTML files and are displayed as two ways colored arrows on a map representing the logical topology of the network.
Platform: |
Size: 2789220 |
Author: dontcry2008 |
Hits:
Description: 摘要：本程序将建立一个用邻接表方式存储的有向图，可以进行插入顶点或边的操作，可以输出有向图的信息或输出该有向图的拓扑有向序列。-Abstract: This procedure will create a stored using adjacency list of the directed graph that can be inserted into the operation of vertex or edge, you can output to the map information or the output of the topology graph has to have the sequence.
Platform: |
Size: 3072 |
Author: |
Hits:
Description: 一个通信节点拓扑图,可动态添加,删除节点,连线等.-A communication node topology, dynamically add, delete nodes, connections and so on.
Platform: |
Size: 31744 |
Author: 李春亮 |
Hits:
Description: Network Weathermap4RRD is a php or perl script that generates picture network links utilization. Data used to create graph are acquired from RRDTool databases or MRTG HTML files and are displayed as two ways colored arrows on a map representing the logical topology of the network.
Platform: |
Size: 2789376 |
Author: dontcry2008 |
Hits:
Description: 拓扑排序：对给定的AOV网判断网中是否存在环，检测的办法是对有向图构造其顶点的拓扑有序序列，若网中所有顶点都在它的拓扑有序序列中，则该AOV网中必定不存在环。在拓扑排序的基础上实现关键路径的的求解。-Topological Sort: AOV of a given network to determine the existence of ring network to detect the approach is the directed graph topological structure of its vertices in an orderly sequence, if all vertex network topology in its orderly sequence, the AOV network does not exist is bound to ring. In the topological sort on the basis of solving the critical path.
Platform: |
Size: 243712 |
Author: feixue_12 |
Hits:
Description: 所谓拓扑排序是指将顶点按照拓扑次序排列。有几种简单的算法可以求出一个图的拓扑次序。一种算法的思想如下：
（1）在有向图中查找一个没有后继（或前驱）的顶点并添加到顶点表中。
（2）从图中删除该顶点和所有以该顶点为头（尾）的弧。
-The so-called topological sorting refers to the vertex order in accordance with the topology. There are several simple algorithm can find the order of a topological map. The idea of an algorithm as follows: (1) in the directed graph to find a follow-up (or precursor) is added to the vertex and vertex table. (2) from the plan to remove all of the vertex and the vertex for the head (tail) of the arc.
Platform: |
Size: 1024 |
Author: zong |
Hits:
Description: A graph topology in a paralel computing
Platform: |
Size: 1024 |
Author: gabi4488 |
Hits:
Description: This application is a simulation of a wireless sensor network. Such a network is used to detect and report certain events across an expanse of a remote area - e.g., a battlefield sensor network that detects and reports troop movements. The idea behind this network is that it can be deployed simply by scattering sensor units across the area, e.g. by dropping them out of an airplane the sensors should automatically activate, self-configure as a wireless network with a mesh topology, and determine how to send communications packets toward a data collector (e.g., a satellite uplink.) Thus, one important feature of such a network is that collected data packets are always traveling toward the data collector, and the network can therefore be modeled as a directed graph (and every two connected nodes can be identified as "upstream" and "downstream.") -This application is a simulation of a wireless sensor network. Such a network is used to detect and report certain events across an expanse of a remote area- e.g., a battlefield sensor network that detects and reports troop movements. The idea behind this network is that it can be deployed simply by scattering sensor units across the area, e.g. by dropping them out of an airplane the sensors should automatically activate, self-configure as a wireless network with a mesh topology, and determine how to send communications packets toward a data collector (e.g., a satellite uplink.) Thus, one important feature of such a network is that collected data packets are always traveling toward the data collector, and the network can therefore be modeled as a directed graph (and every two connected nodes can be identified as "upstream" and "downstream.")
Platform: |
Size: 438272 |
Author: Imran |
Hits:
Description: 以邻接矩阵的方式确定有向网，完成：
A．建立并显示出它的邻接链表；
B．以非递归方式进行深度优先遍历，显示遍历的结果，（并随时显示栈的入出情况）；
C．对该图进行拓补排序，显示拓补排序的结果，并随时显示入度域的变化情况；
D．给出某一确定顶点到所有其他顶点的最短路径-Adjacency matrix to determine a directed network, the completion of: A. To establish and demonstrate its adjacency list B. Non-recursive approach to depth-first traversal, display the results of traversal, (and to keep out of the situation into the show stack) C. Sort of the graph topology, showing topology sort results and shows changes over time into the degree of changes in the domain D. Given a vertex to all other vertices to determine the shortest path
Platform: |
Size: 3072 |
Author: li |
Hits:
Description: 链路状态路由算法实现。链路状态算法又叫最短路径优先SPF（Short Path First）算法。按照SPF的要求，路由器中路由表依赖于一张能表示整个个网络拓扑结构的无向图G（V，E）。-Link state routing algorithm. Link State algorithm called the shortest path first SPF (Short Path First) algorithm. In accordance with the requirements of SPF, the router relies on a routing table can be said that the entire network topology undirected graph G (V, E).
Platform: |
Size: 2048 |
Author: yiyi |
Hits:
Description: 提出一种新的指纹匹配算法.在配准阶段,引入局部方向场匹配,并结合局部细节点拓扑结构匹配以进行指纹对齐 在对齐后的匹配中,首先在两个指纹的细节点集之间进行弹性匹配,得到一个由匹配的细节点对组成的相集,然后以相似集中的细节点做顶点,以各顶点之间的连线为边,为输入指纹和模板指纹组对应的拓扑图进行图匹配 还引入了全局方向场匹配,并与细节点集匹配进行融合,以提高算法的精度.采用FVC2002公布的指纹库进行对比实验,结果证明了算法的有效性.-A new fingerprint matching algorithm. In the registration phase, the introduction of local orientation field matching, combined with the topology of local minutiae matching for fingerprint alignment in alignment after the match, the first two fingerprint minutiae elastic matching between sets, get the details of a matching set of points on the phase composition, and then focus on the details of the points made similar peak to the connection between the vertices for the edge of the input fingerprint and template fingerprint groups corresponding graphs, graph matching also introduces the global orientation field matching, point set match with the details of the fusion to improve the algorithm accuracy. FVC2002 published fingerprint database using comparative experiment results demonstrate the effectiveness of the algorithm.
Platform: |
Size: 333824 |
Author: 李辉艳 |
Hits:
Description: 给定一个有向图，实现图的深度优先, 广度优先遍历算法，拓扑有序序列，并输出相关结果。
功能要求：输入图的基本信息，并建立图存储结构（有相应提示），输出遍历序列，然后进行拓扑排序，并测试该图是否为有向无环图，并输出拓扑序列-Given a directed graph, realize the depth chart first, breadth-first traversal algorithm, topology and orderly sequence, and outputs the relevant results. Functional requirements: the basic information input graph, and the establishment of graph storage structure (with the appropriate prompt), the output traversal sequences, then the topological sort and test the plan is to have directed acyclic graph, and the output sequence topology
Platform: |
Size: 2048 |
Author: 朱慧明 |
Hits:
Description: （1）根据选课表建立对应的图
（2）求出至少一种拓扑有序序列
（3）如果能实现求出所有拓扑有序序列，则加分
-(1) According to the enrollment form to establish the corresponding graph (2) find the ordered sequence of at least one topology (3) If all the topology to achieve an orderly sequence obtained, then a plus
Platform: |
Size: 122880 |
Author: 谢浩 |
Hits:
Description: 设有一个有向图存储在邻接表中。试设计一个算法，按深度优先搜索策略对其进行拓扑排序。并以右图为例检验你的算法的正确性。-There is a directed graph stored in the adjacent table. Trial design an algorithm, depth-first search strategy by the topology of its sort. And to test your example picture on the right algorithm.
Platform: |
Size: 7168 |
Author: 冯灿灿 |
Hits:
Description: It is used to build simple wireless or wired ns simulation topology.NSG2 can form a tcl file derived from the graph you draw.
Platform: |
Size: 105472 |
Author: Wendy |
Hits:
Description: Flex源码，一个用于绘制拓扑图形的例子。-Flex source code, an example is used to draw topology graph.
Platform: |
Size: 50176 |
Author: sam |
Hits:
Description: 输入为一个有向图。边数为n，每条边的起点、终点均需输入。判断该有向图中是否存在拓扑结构，如果存在则输出，如果不存在则输出该有向图中的圈。-Enter as a directed graph. The number of edges is n, the starting point of each edge, end required input. The judge has the topology of the existence of the figure, if there is output, if there is a directed graph in the output of the loop.
Platform: |
Size: 1024 |
Author: yunya |
Hits:
Description: 模拟距离向量路由算法的路由表交换过程，演示每轮交换后路由表的变化，动态生成网络拓扑图，从初始路由表开始，进行交换路由表，演示每轮交换后的路由表的变化。观察和讨论多少轮交换后路由表稳定。-
模拟距离向量路由算法的路由表交换过程，演示每轮交换后路由表的变化，动态生成网络拓扑图，从初始路由表开始，进行交换路由表，演示每轮交换后的路由表的变化。观察和讨论多少轮交换后路由表稳定。
The routing table exchange process is simulated by the distance vector routing algorithm, which demonstrates the changes of the routing table after each round of the switch, and dynamically generates the network topology graph, the initial routing table, and the exchange routing table. Observation and discussion of how many rounds of exchange routing table stability.
Platform: |
Size: 2048 |
Author: Tom |
Hits:
Description: 基于SNMP协议的网络拓扑结构发现程序，以一个路由器作为起点开始搜索，输入路由器的IP 地址后，可以发现与之相连的其他网络设备，并得出其本的拓扑结构图。同时也可以得到路由器的系统信息，路由表及子网结构-Based on SNMP protocol network topology discovery process, to a router as a starting point to start the search, enter the router s IP address can be found which is connected with the other network equipment, and the topological structure of a graph was derived. At the same time, we can get the system information, the routing table and the sub network structure of the router.
Platform: |
Size: 29696 |
Author: 刘宇 |
Hits: