搜索资源列表
topologicalorder
- 本程序用VC++实现有向图，无向图，有向网，无向网的拓扑排序-This program with VC++ to achieve a directed graph, undirected graph, a directed network, the network topology without sorting
ER-SW-BA
- 此程序是关于随机图、小世界网络、无标度网络的仿真程序，很有用的-This program is about the random graph, small world network, scale-free network simulation program, very useful
schooltravel
- 随着社会的发展，各界人士不断走进高校进行考查。随着旅游业的发展，各高校也可能成为旅游的景点。人们关心的问题是如何在有限的时间内能高效率的参观完一所学校的景点。对于这个问题，可以用一个图结构来表示交通网络系统，利用计算机建立一个校园导游咨询系统，方便参观者查询各个景点间的最短距离。-With the development of society, from all walks of life continued into the colleges and universities to carry
Graph
- 复杂网络的一些节点面对攻击的代码，包括模型的产生。-Some of the complexity of the network nodes of the face of attack code, including the selection of models.
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
NEXTADSLDailer
- ADSL Dialer and Network graph monitor for yout PC traffic (upload and download)
directed_network
- 以邻接矩阵的方式确定有向网，完成： A．建立并显示出它的邻接链表； B．以非递归方式进行深度优先遍历，显示遍历的结果，（并随时显示栈的入出情况）； C．对该图进行拓补排序，显示拓补排序的结果，并随时显示入度域的变化情况； D．给出某一确定顶点到所有其他顶点的最短路径-Adjacency matrix to determine a directed network, the completion of: A. To establish and demonstrate its adj
graph.cpp
- The graph network in c language
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
ShortRoute_Dijkstra
- 图论中最短路径计算D算法MATLAB源代码，修改网络上D算法的错误，并编写通用的MATLAB函数-Graph theory, shortest path algorithm for computing D MATLAB source code, modify the network D algorithm error, and the preparation of general MATLAB function
KRUSCAL
- KRUSCAL算法实现演示程序，利用KRUSCAL算法求网的最小生成树，网中的节点和边由系统自动生成，图为带权图。-KRUSCAL algorithm demo program, using KRUSCAL minimum spanning tree algorithm to solve network, network nodes and edges generated automatically by the system, photo shows a weighted graph.
Graph
- 无向图 无向网 有向图 有向网的邻接矩阵的实现-Undirected graph directed graph undirected network with the network implementation of the adjacency matrix
Graph
- malab图论工具包 聚类系数 度 度分布 网络直径 小世界网络构造-malab clustering coefficient graph theory Kit degree degree distribution network diameter small world network structure
ljnew
- 读取矩阵，算出上三角矩阵，根据随机建立的点，然后进行连接矩阵网络图。-Read the matrix, calculate the upper triangular matrix, based on the random set up points, and then the connection matrix of the network graph.
biaohao
- 图论中基于网络中顶点标号的最短增广链算法，用于解决最大流问题-Based on network graph theory shortest augmenting chain algorithm vertex label, for solving the maximum flow problem
matlab-networks-toolbox-master
- 一个基于matlab的m文件组成的网络分析的matlab工具包。包括图统计，网络理论指标的计算，以及网络可视化等功能-This is a repository of functions relevant to network/graph analysis, organized by functionality. These routines are useful for someone who wants to start hands-on work with networks fairly
Graph
- matlab的复杂网络工具箱,包括网络度分布、介数、聚集系数和BA模型等-Complex Network toolbox for matlab
create
- 有圈无向图的创建，可生成大规模的无标度人际网络(The creation of circular undirected graph can generate large-scale scale-free interpersonal networks.)
project_manage
- 有关项目进度管理需要掌握的知识有如下一些： （1）项目进度管理的过程有哪一些。 （2）活动定义与WBS（Work Breakdown Structure，工作分解结构）的定义，有关WBS的一些专业术语理解，如检查点、里程碑、基线、工作包、活动等。 （3）活动定义采用的一些工具和技术，如分解、模板、滚动式规划、专家判断等。 （4）掌握前导图法（即单代号网络图）和箭线图法（双代号网络图），会作图、看图，会找关键路径，掌握虚路径的概念，理解术语并会计算ES、LS、EF、LF、FF、TF，并能对
Bayesian-Network-Structure-Learning-master
- 一般贝叶斯网络的构建是首先由相关领域的专家根据事物间的关系来确定出结构模型，即有向无环图，然后再利用其它方法确定每个节点的条件概率，但这样构建的网络模型无法保证其客观性和可靠性．(In general, the construction of Bayesian network is to determine the structural model, i.e. directed acyclic graph, by experts in related fields according to th