Path in Random Network. Invasion Algorithms.

We apply Dijkstra's Algorithm in a random network to generate optimal paths between a source and any point in the lattice. The energies are taken from an uniform distribution. If Dijkstra's Algorithm is considered invasional, the invasion front is in KPZ Universality class, the same as DP.

We also investigate the invasion front of Prim's Algorithm, known to belong to be the same as IP. We used the same setup for the problem.