Wyatt

I'd be happy to look into this if you can post your setup code and sample inputs here on GitHub.

As this is just `sum(info.costs[:i])`, it doesn't seem super useful except as a convenience. It would change the API (the return value of `find_path()` in particular), so it would have...

Dijkstar version 2 doesn't have the server feature. To use the server features, you have to install version 3 using `pip install Dijkstar[server]==3.0a3`.

`find_path()` returns a [`PathInfo`](https://github.com/wylee/Dijkstar/blob/master/dijkstar/algorithm.py#L7) object that has `nodes`, `edges`, `costs`, `total_cost` attributes, so you can access the ordered nodes with `path.nodes`. Regarding the cost function, you don't need it if...

Hi. If you can provide some sample data that demonstrates this issue, I'd be happy to look into it and see if I can figure out what's going on. One...

Finding paths to all nodes reachable from a given start node isn't well-tested because I haven't had a need for that functionality myself. In theory, you should be able to...