搜索资源列表
Regular PEG
- 此程序 是一个C++程序. 通过PEG算法来构造 LDPC parity-check 矩正的Tanner 图.-This is a C++ program, which is used to construct Tanner graph of LDPC codes with the famous PEG algorithm.
matlabmap
- 图论的算法，包括floyd和其他一些应用于求最短路径问题的matlab程序-Algorithms of graph theory, including the floyd and other used for the shortest path problem in matlab program
lab2
- 编程计算图形的面积。程序可计算圆形、长方形、正方形的面积，运行时先提示用户选择图形的类型，然后，对圆形要求用户输入半径值，对长方形要求用户输入长和宽的值，对正方形要求用户输入边长的值，计算出面积的值后将其显示出来。-Calculate the area of graphics programming. Program calculates circular, rectangular, square area, run-time prompts the user to first select t
DFS
- A program to find the depth first search on a given graph.It contains a source code, input file and an output file.
bfs
- a program to find the breadth first traversal on a graph.it will work for a graph and not for forest
study_networkx.tar
- networkx example. A program of learning graph algorithms.
complete_graph.tar
- NetworkX example program to crate complete graph on python code.
connectivity
- 使用C++实现的一个计算图的连通度的程序 该算法使用Edmonds-Karp算法，基于网络流的计算而成。-this program is implemented by c++ and it is for the calculation of Graph Connectivity Degree,it uses Edmonds-Karp algorithm,which is famous for calculating network flow.
regular-LDPC-code
- Low Density Parity Check (LDPC) 信道编码的C程序。二部图连接关系的输入在20000.10000.3.631.txt 文件中。文件中的参数包括check，ariable节点的度数，具体的连接关系。可根据具体需要，需改你所需的txt文件，从而实现任意参数的LDPC程序仿真。经验证，此程序的性能正确，符合理论文献中的结果。-Low Density Parity Check (LDPC) codes simulation C program. This program i
TanLan
- 图论贪婪算法详解，有算法原程序以及各种例子，而且还有pdf，ppt讲解。是学习的很好工具。-Graph theory greedy algorithm Xiangjie algorithm original program as well as a variety of examples, but also pdf, ppt to explain. Is a good tool for learning.
tulun
- 最小费用最大流问题通用LINGO程序。解决图论问题的必备。-Minimum cost maximum flow problem common LINGO program. Essential to solve the problem of graph theory.
metis-5.1.0
- Graph partitioning program. Just compile and use. Accepts graph file as input
shortest-path
- C++ program for Dijkstra s single source shortest path algorithm.The program is for adjacency matrix representation of the graph
TspSolver
- TSP Solver is a very intuitive and user-friendly program that demonstrates two common ways of solving the TSP (Traveling Salesman Problem) of the Graph Theory. For a brief descr iption of the TSP, along with a quick reference to the solution
DLA
- 进行单中心DLA模型的模拟， 至少用两种方法计算模拟 得到的DLA图形的分形维数,要求:(1)编写计算分形维 数的程序 (2)对每种方法都作出双对数图。-Single center DLA model simulation, simulation of at least two ways to calculate the fractal dimension obtained DLA graphics requirements: (1) the preparation of computi