Remember to return the state from dijkstra's algorithm when terminating early
(upon finding the shortest path to the node we are interested in).
github issue #76
Dijkstra's algorithm as currently formulated requires vertex_map and edge_map
in addition to incidence_list.  This adds the appropriate check, as well as fixing the documentation.
Merge pull request #91 from deinst/docfix_dijkstra

Dijkstra's algorithm as currently formulated requires vertex_map and edg...
Merge pull request #90 from deinst/dijkstra_iv_fix

Remember to return the state from dijkstra's algorithm when terminating ...
Add edge color to `examine_neighbor!` docs.

Fixes #69.
Merge pull request #92 from pozorvlak/examine_neighbor_docs

Add edge color to `examine_neighbor!` docs.
Add more algorithms to README.md
Merge pull request #94 from pozorvlak/add_algos_to_readme

Add more algorithms to README.md