Dijkstra for large auto-generated graphs
A small tool that generates a large graph with about 500 ~ 5.000 vertices and more than 200.000 edges. Then it run Dijkstra to find out the shortest path from 1 vertex to another one. and calculate the processing time of the computer.
Sobre Mim
- C#/VB.net Winform expert - Do school asignments in Algorithm/C/C++/Java. - Have worked with Java - swing GUI for a long time. - I am familiar with these IDE/compiler: + MS VS 6.0/2005/2008/2010 + Java Eclipse/NetBeans/BlueJ + Notepad ++ + GNU Gcc/Gpp ... My Payment Term: + You create 50% milestone after awarding the project and release it after I showed you the first version. + You create the rest funds and release it and please review after we finished the project. Support: I will fix bugs for free, but need extra for expand specifications.
