资源列表
NetStream
- 已知一个网络对应的邻接矩阵，求该网络上的最大流。属于数据结构中的问题。-a network known counterparts in the adjacent matrix, the network for the maximum flow. Data structures belonging to the problem.
ieee33
- 应用牛顿法的直角坐标系下的33节点潮流计算-33 node flow calculation
monituihuo
- 用蒙特卡罗方法求解函数的最值问题。步骤清晰！-Function using the Monte Carlo method to solve the problem the most value. Steps to clear!
nqueen
- 用概率算法求解N皇后问题。1、拉斯维加斯概率算法 每一行得到了几个摆放位置时，不是按顺序进行摆放，而是随机摆放的。因此程序每次运行的时间都不一样。用拉斯维加斯算法除非找不到解，如果找到，答案就一定是正确的。-Probabilistic algorithm with N queens problem. 1, Las Vegas probabilistic algorithms have several display each line position, not by placing the
Kruskal-algorithm
- 本程序是用C语言来实现Kruskal算法，希望能对别人有帮助！-This procedure is used to implement Kruskal' s algorithm in C, hoping to help others!
topological-sort-count
- 本程序使用C语言来实现拓扑排序算，希望对别人有帮助！-This program uses the C language to implement topological sort count, want to help others!
eight_queens
- 八皇后演示程序，图形界面，递归经典程序演示-Eight Queens demo program, graphical interface, classic program demonstrates the recursive
communicability_alg
- 复杂网络计算程序，获得communicability alg-Get communicability alg
3-1-2maze
- 这是一个迷宫算法的实现，使用C++程序编写的，-Maze algorithm, using the program written in C++
beibaoPSO
- 粒子群算法用于背包问题情况 典型组合优化问题-Particle swarm optimization for the case of the more popular knapsack problem
LP_pdi_feasible_eqined
- 应用内点法中原-对偶路径跟踪法，求解线性规划问题，也可以用于求解最优潮流问题，不过KKT方程较复杂。-using the original- dual path following method is used to solve linear programming problems
envelope
- envelope detection based on low passs filtering