搜索资源列表
toolbox_graph
- 主要用于对图论和三角测量的研究的工具箱，包含很多分析模拟网络拓扑的函数-mainly for the Graph Theory and Research Triangle measurement toolkit include many analyze the function of the network topology
php-weathermap-0.95b
- Network Weathermap4RRD is a php or perl scr ipt 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
NSG2
- It is used to build simple wireless or wired ns simulation topology.NSG2 can form a tcl file derived from the graph you draw.
topologicalorder
- 本程序用VC++实现有向图，无向图，有向网，无向网的拓扑排序-This program with VC++ to achieve a directed graph, undirected graph, a directed network, the network topology without sorting
WirelessSensorNetworkSimulator1
- 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 behin
HopeRunTopo
- HopeRunTopo是flex方面的实现客户端的网络拓扑发现的设备关联图-HopeRunTopo flex area is to achieve the client' s network topology discovery incidence graph of the equipment
Graph_Theory_Reinhard_Diestel
- 图论，研究拓扑学，工程设计等的国外经典教程，英文原版，非常清晰，非扫描图片-Graph theory, topology studies, engineering design tutorials foreign classics, English original, very clear, non-scan images
tuopu
- 拓扑排序：对给定的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
Topsort
- 所谓拓扑排序是指将顶点按照拓扑次序排列。有几种简单的算法可以求出一个图的拓扑次序。一种算法的思想如下： （1）在有向图中查找一个没有后继（或前驱）的顶点并添加到顶点表中。 （2）从图中删除该顶点和所有以该顶点为头（尾）的弧。 -The so-called topological sorting refers to the vertex order in accordance with the topology. There are several simple algor
top_graf
- A graph topology in a paralel computing
directed_network
- 以邻接矩阵的方式确定有向网，完成： A．建立并显示出它的邻接链表； B．以非递归方式进行深度优先遍历，显示遍历的结果，（并随时显示栈的入出情况）； C．对该图进行拓补排序，显示拓补排序的结果，并随时显示入度域的变化情况； D．给出某一确定顶点到所有其他顶点的最短路径-Adjacency matrix to determine a directed network, the completion of: A. To establish and demonstrate its adj
linkStateRouting
- 链路状态路由算法实现。链路状态算法又叫最短路径优先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 S
1
- 给定一个有向图，实现图的深度优先, 广度优先遍历算法，拓扑有序序列，并输出相关结果。 功能要求：输入图的基本信息，并建立图存储结构（有相应提示），输出遍历序列，然后进行拓扑排序，并测试该图是否为有向无环图，并输出拓扑序列-Given a directed graph, realize the depth chart first, breadth-first traversal algorithm, topology and orderly sequence, and outputs the
tudeyingyong
- （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 obtai
BBB
- 设有一个有向图存储在邻接表中。试设计一个算法，按深度优先搜索策略对其进行拓扑排序。并以右图为例检验你的算法的正确性。-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 algor
topo
- Flex源码，一个用于绘制拓扑图形的例子。-Flex source code, an example is used to draw topology graph.
TOPOLOGY
- 输入为一个有向图。边数为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 outp
RIP
- 模拟距离向量路由算法的路由表交换过程，演示每轮交换后路由表的变化，动态生成网络拓扑图，从初始路由表开始，进行交换路由表，演示每轮交换后的路由表的变化。观察和讨论多少轮交换后路由表稳定。- 模拟距离向量路由算法的路由表交换过程，演示每轮交换后路由表的变化，动态生成网络拓扑图，从初始路由表开始，进行交换路由表，演示每轮交换后的路由表的变化。观察和讨论多少轮交换后路由表稳定。 The routing table exchange process is simulated by the dist
Network-topology-discovery-programl
- 基于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
Graph-based clustering and data visualization algorithms
- This Matlab package is written specifically for the book Ágnes Vathy–Fogarassy and János Abonyi: Graph-based clustering and data visualization algorithms. The purpose of the package is to demonstrate a wide range of graph-based clustering and visuali