搜索资源列表
fm
- 基于图的二分算法，使用c++编写，执行效率非常高，特别适用于网络划分-Bipartite graph-based algorithm, the use of c++ Preparation, implementation efficiency is very high, especially for network segmentation
Bipartite-graph-matching-template
- 求二分图匹配多种算法，网络流最大流的部分模板-Find a variety of bipartite graph matching algorithms, network flow part of the template maximum flow
ACM.algorithm
- 各种算法模板（二分图最大匹配匈牙利算法、最小生成树prime和kruskal算法、Dijkstra算法、两点最短路径负权值边SPFA算法、图任意两点最短路径Floy算法、网络最大流SAP算法、网络最大流最小费用算法、乘法逆元gcd扩展求解算法、线段树区间划分统计算法、矩阵n次方分治法求解、gcd算法、整数划分问题、函数最小点问题、十进制转ACM算法、素数筛选法和欧拉函数求解、快模算法、字符串匹配KMP算法、字典全排列算法、快排、三维度排序、）-Various algorithms templat
km
- 完全二分图算法（KM算法）的网络流算法实现，利用最小费用最大网络流算法-Complete bipartite graph algorithms (KM algorithm) network flow algorithm, using the minimum cost maximum network flow algorithm
bipartite_network
- 利用泊松分布构建的复杂网络的二分网络演化建模-Poisson distribution building complex networks of Bipartite network evolution model
calculate_R_matrix
- use the HeatS+ProbS hybrid algorithm introduced by Zhou et al. [74] on the two bipartite networks to determine the edge weight in both miRNA projections. By which, the resource transfer process, as one of the weighting methods for one-mode projection