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.

Login

Benchmarks

  1. Home
  2. Benchmarks
  3. Report

Communication network graph for maximum flow problem

Main characteristics:
• Directed graph representing communication network including edge capacities
• Configurable network generator expandable by Python library networkx graph generation functions
• Easy to modify for different types of graphs and edge capacities
• Simple 5-node case to verify basic properties
• Allows algorithm time dependency testing
Scientific Area:
Optimization
Language/Environments:
Python
Target Group:
Basic
Link:
https://nbviewer.org/github/andrejkk/OPvTK/tree/HEAD/CodeLuncher/02-MaximalFlowAlgorithm/
Author of the review:
Andrej Košir
University of Ljubljana


Reviews

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

Back to the Benchmarks List