搜索资源列表
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.
graphy_theory
- 关于图论的一些算法和应用。 网络流、上下界网络流、km最佳匹配，弦图判定，一般图最大匹配，有向图最小生成树。-Some on the graph theory algorithms and applications. Network flows, network flow bounds, km best match the string diagram as to the general graph maximum matching, minimum spanning tree directed
aaa
- 对任意给定的图（顶点数不小于20，边数不少于30，图的类型可以是有向图、无向图、有向网、无向网），能够输入图的顶点和边（或弧）的信息，并存储到相应存储结构（邻接矩阵、邻接表、十字链表、邻接多重表，任选其中两种类型），对自己所创建的图完成以下操作： 对无向图求每个顶点的度，或对有向图求每个顶点的入度和出度（5分） 完成插入顶点和边（或弧）的功能（5分） 完成删除顶点和边（或弧）的功能（5分） 两种存储结构的转换（5分），如果其中一种存储结构为十字链表或邻接多重表则增加5分。
CreatGraph
- 存储图，无论有向图无向图或有向网无向网.可以存储任何类型-Memory map, regardless of the undirected graph or network to network without the
createtu
- 用邻接矩阵创建图并将其输出：本程序可以有四种图形式：分别为有向图，无向图，有向网，无向网；-Create a map with the adjacency matrix and the output: This program can graph four forms: namely a directed graph, undirected graph, the network, not to the network
20071521203297
- 数据图形分析，系统环境：PB9.0 系统包括：包括：计划表、K线图、均衡器、网络拓扑图、计划监视等。 -Data, graphical analysis, system environment: PB9.0 system includes: includes: schedule, K line graph, equalizer, network topology, plan monitoring.
TraversingGraph
- 数据结构中的图的遍历问题。 设计一个网络蜘蛛系统，用有向网表示网页的链接网络，其中，顶点表示某个网页，有向弧表示网络之间的链接关系。并且分别以a. 深度优先搜索，b. 广度优先搜索的策略抓取网页。-The graph data structure traversal problem. Design a web spider system, with a link to the web page that network, where vertices a page, there is the
IntroductiononFactorGraphs
- 因子图的介绍，属于最新的图形应用，很长有用的。用于译码以及一些神经网络之类。-Factor graph presentation, is the latest graphics applications, a very long useful. And some neural network for decoding and the like.
tpop2
- This scr ipt give u the performance analysis to 3 congestion control algorithm Tahoe,Reno and Vegas with the help of x-graph on sample network topology.
topo2RED
- This scr ipt give u the performance analysis to 3 congestion control algorithm Tahoe,Reno and Vegas with the help of x-graph using RED queue mechanism on sample network topology.
Csuanfa2
- 这是刚才C算法的第二卷，主要讲解树，图，网络的算法，很详细-This is just C algorithm II, mainly on the tree, graph, network algorithms, in detail
ACM.ICPC_Code_base_MyLib(For_ACM)
- 吉林大学. ACM/ICPC 代码库,关于图论、数据结构、网络流、树论、递归方法求解排列组合问题,以及ACM/ICPC之STL.-Jilin University. ACM/ICPC code base, on the graph theory, data structures, network flows, the tree of recursive method for solving permutation and combination, as well as ACM/ICPC of t
BayesianNetworks
- Application that loads a Bayesian Network, and computes inference by enumeration on it. Also tests if the net is DAG and show the nets graph.
COMPLEXnet
- 复杂网络研究与建模 总起来说这是一个关于矩阵的运算，用到了c语言里面的东西，实现一个矩阵的逆运算和矩阵的转置等，最终实现的是一个初始节点为4个节点的有向图，随即扩展为一个10000*10000的巨型矩阵，得到该有向图的图形， 与计算机图形学类似，该程序是在构建了一个算法后，用MATLAB实现了一个无标度网络的图形中的各个节点的概率密度，并根据各个节点的概率密度绘出该图 -将中文译成英语 And modeling complex networks Collectively t
Matlab-kongzaibingwangfangzhen
- 变速恒频风力发电系统的空载并网技术在matlab环境下的仿真图-VSCF wind power system load and network environment in the simulation graph matlab
1-103
- 有向图，有向网，无向图，无向网的邻接表存储、增删顶点和边。-Directed graph, directed networks, undirected graph without adjacent to the network table to store, add and delete vertices and edges.
1
- 采用分层图方法实现光网络路由，并计算阻塞率-Layered graph method used to achieve optical network routing, and calculate the blocking probability
Complex-brain-networks
- 图论在脑功能网络的应用介绍，涵盖EEG，MEG，FMRI等多数据类型的综述-Graph Theory in the network to the application of brain function, covering the EEG, MEG, FMRI, and other data types overview
hospital-mang
- network simulation codes containg graph files and the tcl files
mcmc
- MC（蒙特卡罗）算法计算多节点的通信网性能分析。双向链路可靠性相同。一个有图一个无图-MC (Monte Carlo) algorithm to calculate the multi-node communication network performance analysis. The same two-way link reliability. A diagram of a non-graph