v0.1.2
This minor release includes:
- a new construction method:
graphs.construction.urquhart_graph()
- a
weighted
option forgraphs.construction.b_matching()
- a
metric
option forgraphs.construction.neighbor_graph()
/nearest_neighbors()
, and a soft deprecation of theprecomputed
kwarg - smarter dispatching logic and more kwargs for the
Graph.shortest_path()
method - documentation fixes
- more consistent use of warnings and errors
- tweaks to the default graph visualization style