Funded by the European Union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Education and Culture Executive Agency (EACEA). Neither the European Union nor EACEA can be held responsible for them.


Maximum flow algorithm

Users: 1 - Average Rating: 5.00

The algorithm has the following main features:
• It finds shortest path between two given nodes
• Two underlying algorithms can be chosen
• Linked to performance evaluation via related benchmark
• Extendable to other methods

Scientific Area:


Target Group:

Author of the review:
Andrej Košir
University of Ljubljana


You have to login to leave a comment. If you are not registered click here