Previous topic


Next topic


This Page


max_bandwidth(graph, source='source', freq_name='count', epsilon=0.001)[source]

Given a graph G = (V,E) with capacity over vertices and a source, find the set of paths which maximize the bandwidth (minimize the bottleneck) from the source.

Parameters :

graph : NetworkX Graph

Graph to find the maximum bandwidth path of.

source : str (optional, default=”source”)

Name of the source vertex to begin the search from.

freq_name : str (optional, default=”count”)

Name of the frequency or count property to use.

epsilon : float (optional, default=1e-3)

Threshold for edge values to consider.

Returns :

bandwidth_and_paths : (dict, dict) tuple

Dictionary of the bandwidth from the source to a node along with the dictionary of the maximum bandwidth path from a source to a node.