Wyatt
This amends the model_attr resolution changes made in 2a450d81432a40c6f0f963b41295f00d7efb5fc7 so they are backward compatible. Further details can be found in 12ee43474f88878487481b856672ca38371e4388.
This fix is on the dev branch but hasn't been released
Change `predecessors[v] = (u, e, cost_of_e)` to `predecessors[v] = (u, e, cost_of_e, cost_of_s_to_u_plus_cost_of_e)` in `single_source_shortest_paths()`, add a corresponding field to `PathInfo`, and `update extract_shortest_path_from_predecessor_list()`. I'm not sure off the top...
One use case for this would be to find nodes and edges with a given attribute value without having to iterate through all the nodes or edges. Possible API: ```python...
It's currently possible to create an undirected graph by adding edges from both `u` to `v` and `v` to `u` for all connected pairs `(u, v)`. This requires a bit...
- Add example of simple, non-dynamic costs (i.e., no cost function) - Modify the cost function example to show realistic usage of dynamic costs