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

Andre Vianna

Rate me:

4.79/5 (26 votes)

4 May 2010CPOL9 min read

44.5K

1.3K

Lowering the memory consumption to allow Djikstra's algorithm to handle large amount of nodes.

Views

Daily Counts

Downloads

Weekly Counts

License

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

Written By

Andre Vianna

Software Developer (Senior) Pronto Solutions

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.

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

Views

Downloads

License

Comments and Discussions