Click here to Skip to main content
12,405,270 members (68,021 online)
Click here to Skip to main content
Alternatives
Add your own
alternative version

Stats

29.1K views
1.1K downloads
73 bookmarked
Posted

Shortest/Fastest Path For Large Amount of Nodes - Part 1 of 3 - Djikstra without Arrays

, 4 May 2010 CPOL
Lowering the memory consumption to allow Djikstra's algorithm to handle large amount of nodes.

Alternatives

Members may post updates or alternatives to this current article in order to show different approaches or add new features.

No alternatives have been posted.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Author

Andre Vianna
Software Developer (Senior) Pronto Solutions
Brazil Brazil
André Vianna is a Software Engineer in Rio de Janeiro, Brasil.
He is PMP, MCP and have worked as Development Project Manager, Senior Software Developer and Consultant for more than 15 years.
He worked with several major companies in Brasil, EUA, Canada and Mexico.
He has been working with the cut edge .NET platform since 2001 and is a C# specialist.

| | Privacy | Terms of Use | Mobile
Web01 | 2.8.160721.1 | Last Updated 4 May 2010
Article Copyright 2010 by Andre Vianna
Everything else Copyright © CodeProject, 1999-2016
Layout: fixed | fluid