Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Routing: use custom implementation for the shortest path algorithm and the graph #779

Merged
merged 58 commits into from
Dec 20, 2018

Conversation

araspitzu
Copy link
Contributor

This pull request aims at replacing the currently used library jgraph with a custom implementation of a directed-unweighted-graph, and a custom implementation of dijkstra's shortest path algorithm

…rminate the algorithm when the target node is reached
…s, avoid re-traversing the list when constructing the final shortest-path
…d constructor in the test, remove broken containsEdge(key, key)
@araspitzu
Copy link
Contributor Author

araspitzu commented Dec 18, 2018

Additional notes: this pull request also removes the .dot format export functionality

sstone
sstone previously approved these changes Dec 19, 2018
sstone
sstone previously approved these changes Dec 20, 2018
…, remove redundant publishing of channel updates
@sstone sstone merged commit 255c280 into master Dec 20, 2018
@sstone sstone deleted the custom_graph branch December 20, 2018 15:53
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

4 participants