npmjs.org "max flow" keyword
View the packages on the npmjs.org package registry that are tagged with the "max flow" keyword.
Top 2.2% on npmjs.org
13 versions - Latest release: almost 8 years ago - 9 dependent packages - 428 dependent repositories - 412 thousand downloads last month - 153 stars on GitHub - 1 maintainer
js-graph-algorithms 1.0.18
Package implements data structures and algorithms for processing various types of graphs13 versions - Latest release: almost 8 years ago - 9 dependent packages - 428 dependent repositories - 412 thousand downloads last month - 153 stars on GitHub - 1 maintainer
@algorithm.ts/dinic 4.0.4
The dinic algorithm implemented in typescript53 versions - Latest release: about 1 year ago - 2 dependent packages - 141 downloads last month - 98 stars on GitHub - 1 maintainer
@algorithm.ts/mcmf 4.0.4
The MCMF algorithm implemented in typescript53 versions - Latest release: about 1 year ago - 2 dependent packages - 2.67 thousand downloads last month - 98 stars on GitHub - 1 maintainer
@algorithm.ts/isap 4.0.4
The ISAP algorithm implemented in typescript53 versions - Latest release: about 1 year ago - 2 dependent packages - 1.19 thousand downloads last month - 98 stars on GitHub - 1 maintainer
Related Keywords
网络流
3
network flow
3
algorithm
3
graph
1
breadth-first-search
1
connected-components
1
depth-first-search
1
dijkstra-shortest-path
1
kruskal-algorithm
1
maxflow
1
mincut
1
minimum-spanning-trees
1
prim-algorithm
1
strongly-connected-components
1
topological-sort
1
dinic
1
MCMF
1
ISAP
1
weighted graph
1
digraph
1
directed graph
1
connected components
1
strongly connected components
1
min cut
1
dijkstra
1
bellman-ford
1
minimum spanning tree
1
depth first search
1
breadth first search
1
directed cycles
1
topological sort
1
ford-fulkerson
1
prim
1
kruskal
1
bellman-ford-algorithm
1