搜索资源列表
JGoWebApp
- java web graph program, can generate many network graph ,
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
graph
- 用了三年多时间打造的基于跨平台开发技术qt开发的图形组态系统，运用模板能组合成任意图元，运用脚本能，定义出图元根据属性的变化，做出相应的动态效果，首先应用于电力系统网路图，监控电网状态。可以应用于实时监控应用领域。超一流的绘制效果，在完成电力系统一次接线图比组态王、三维力控有更好的绘制效果.增加实时数据、web浏览器、后台进程取数，qwt做实时曲线，vista风格等、升级到4.5.2等(部分源) 有更新版本！-Spent more than three years to build cross-
graph
- 图论的算法，最短路，最小生成树，连通，匹配，网络流及应用。-Graph theory, algorithms, shortest path, minimum spanning tree, connectivity, matching, network flow and applications.
Wireless_MESH_Network_Channel_Assignment_general_M
- 基于粒子群优化的无线MESH网信道分配算法通用MATLAB源码，本算法基于冲突图的粒子群优化算法而来。-Particle Swarm Optimization for Wireless MESH Network Channel Assignment General MATLAB source code, the algorithm is based on the conflict graph from PSO.
buddy-2.4.tar
- 当前最完善的OBDD程序实现。可用于并行计算分析，网络图论分析-At present, the most perfect realization of OBDD procedures. Analysis can be used for parallel computing, network graph theory analysis
networkandgraph
- network and graph optimal algrithom classic book
fm
- 基于图的二分算法，使用c++编写，执行效率非常高，特别适用于网络划分-Bipartite graph-based algorithm, the use of c++ Preparation, implementation efficiency is very high, especially for network segmentation
lujin
- 最短路径问题（用无向图表示n个城市之间的交通网络建设规划，顶点表示城市，边上的权表示该线路的造价，试设计一个方案，使得这个交通网的总造价最小。）-The shortest path problem (with undirected graph n cities that transport links between the construction plan, vertex, said city, said the right edge of the construction cost of
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
network_flow
- 最大流算法,对于给定的有向图，计算出该图上的最大流-Maximum flow algorithm, for a given directed graph is calculated on the graph of maximum flow
Graph
- 复杂网络的一些节点面对攻击的代码，包括模型的产生。-Some of the complexity of the network nodes of the face of attack code, including the selection of models.
RoutingSystem
- The task in this assignment is to implement an airline routing system. Your system should be able to read in a ight network as a graph from a le, where airports are represented as vertices and ights between airports are represented as ed
measure-delay
- 无线ns网络仿真 筛选延时程序 可用于对ns运行生成的数据进行筛选分析-Wireless network simulation ns delay screening procedures
NEXTADSLDailer
- ADSL Dialer and Network graph monitor for yout PC traffic (upload and download)
Graph_Theory
- 图论模型及方法 搞计算机算法和数学建模的人都知道图论是一个很重要的内容。本资料介绍了图论中的最短路算法、匹配、邮递员和货郎问题、最小生成树、网络流等经典问题。而且有非常经典易懂的Matlab程序。-Graph theory and methodology of engaging in computer algorithms and mathematical modeling of the people know that graph theory is a very important cont
Algorithms.In.C.3rd.Ed.Part5.Graph.Algorithms
- 经典算法书(中文版)。这一套算法系列书介绍了当今最重要的算法，共分3卷，这是第2卷（第五部分），集中讲解图算法。本书共有6章（第17章～第22章）。第17章详细讨论图性质和类型，第18章~第22章分别讲解图搜索、有向图和DAG、最小生成树、最短路径以及网络流。书中提供了用C语言描述的完整算法源程序，并且配有丰富的插图和练习。-Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewi
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
graph theory
- 高随祥的图论与网络流理论，介绍在网络里如何利用图论进行问题的分析，对于庞大的网络流有相当的帮助。(Gao Suixiang's graph theory and network flow theory, introduced in the network how to use graph theory to analyze the problem, for a large network flow quite helpful.)
graph
- 运用graph；寻找最短路径（最短时间/最少换乘）(Suppose following weighted directed graph representing a local subway route network, the vertices in the graph represent the important sites in the area, the arcs represents the existing subway routs, and the weight represen