搜索资源列表
redundantpaths
- c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that u
tt
- 采用连接矩阵表示法，构造无向网G,并且对图G进行广度优先遍历。-Connection matrix notation used to construct an undirected network G, and the graph G breadth-first traversal.
systemabouttranfic
- 用图的机构表示实际的城际交通网络。 找到图中从某个源点到其余各顶点的最短路径。找到图中每一对顶点间的最短路径。 找到图中任意一对顶点间中转次数最少的路径。 -Represents the actual use of intercity transportation network diagram institution. Find the figure a source point to the rest of the shortest path to each vertex
Web-Spider
- 图的遍历。若用有向网表示网页的链接网络，其中顶点表示某个网页，有向弧表示网页之间的链接关系。试设计一个网络蜘蛛系统，分别以广度优先和深度优先的策略抓取网页。-Graph traversal. If the web page to the network by indicating links network where vertices represent a page, there are links to the arcs represent the relationship between
BP_approximator
- BP网络Matlab仿真_BP网络逼近，完整源程序代码，并附有仿真结果图，仅供参考。-BP network Matlab simulation _BP network approach, complete source code, together with the simulation result graph for reference only.
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
OWNS
- optical wired network with graph partitioning algorithm for all nodes