tests.fixtures.weighted_graphs#
Graphs with weights set on all edges.
Functions
This graph is set up with a fewer-hops path between two nodes that is more expensive than another path with more hops. |
|
This graph is a fairly common case in the wild where the cheapest path is also the shortest, but it is not homogenously weighted. |
|
This graph is set up with a single edge with negaitve weight. |
Classes
|
A subclass of |