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
source : str (optional, default=”source”)
freq_name : str (optional, default=”count”)
epsilon : float (optional, default=1e-3)
|
---|---|
Returns : | bandwidth_and_paths : (dict, dict) tuple
|