Implement finding shortest path on undirected graph

bitwalker / libgraph

A graph data structure library for Elixir projects

MIT License

524 stars 75 forks source link

Implement finding shortest path on undirected graph #38

Closed Minh-Khang closed 3 years ago

Minh-Khang commented 4 years ago

Fix issues:

Incorrect A* pathfinding with undirected graph #11
get_shortest_path doesn't work correctly on undirected graphs #37

coveralls commented 4 years ago

Coverage increased (+0.03%) to 96.078% when pulling 12b6d170ddd35e9ff7b5aa9be0d820ee2c4a3acf on Minh-Khang:Implement-find_shorstest_path-for-undirected-graph into 493d91d214418bbd9607881bb1db270352b27a26 on bitwalker:master.

Will-W commented 4 years ago

Is there any chance of having this merged? This update is pretty important for what we're doing (I work with @achan1989).

Thanks!

bitwalker commented 3 years ago

Hey, thanks for the PR! Sorry I missed the updates, I'll get a new release out ASAP