Communication network graphs for clique algorithms
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
• 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
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