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.

Sign up for GitHub

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

Jump to bottom

project 2 #1

Open
freedombird9 opened this issue Feb 5, 2014 · 0 comments
Open

project 2 #1

freedombird9 opened this issue Feb 5, 2014 · 0 comments
Assignees
@dolremi

Comments

@freedombird9
Copy link
Owner

In this project, a traditional Dijkstra's algorithm is implemented with adjacent list and minHeap in C++. Then a bidirectional enhancement is implemented. The performance of the two algorithms has been tested with 100 graphs with 1000 nodes using two different algorithms
@ghost ghost assigned dolremi Feb 5, 2014
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@dolremi dolremi

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@dolremi @freedombird9