الگوریتم دینیک
Sign in to saveAlso known as Dinitz's algorithm
algorithm for computing the maximal flow of a network
In the Vinony graph
Vinony's link graph records 114 inbound references to الگوریتم دینیک, and connects out to mathematical optimization, greedy algorithm and Bellman–Ford algorithm.
Vinony files it under Graph algorithms and Network flow problem.
Vinony links it to 14 Wikipedia language editions.
Connections
mathematical optimization
Entity
greedy algorithm
Entity
Bellman–Ford algorithm
Entity
maximum flow problem
Entity
convex optimization
Entity
International Standard Book Number
Entity
function
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
gradient
Entity
linear programming
Entity
Dijkstra's algorithm
Entity
dynamic programming
Entity
depth-first search
Entity
breadth-first search
Entity
Technion – Israel Institute of Technology
Entity
simplex algorithm
Entity
Prim's algorithm
Entity
evolutionary algorithm
Entity
minimum spanning tree
Entity