com.alexprut.algo.algorithms.graph

Class Dijkstra

java.lang.Object

com.alexprut.algo.algorithms.graph.Dijkstra

public class Dijkstra
extends java.lang.Object

Constructor Summary

Constructors

Constructor and Description
Dijkstra()

Method Summary

Modifier and Type	Method and Description
static int[]	dijkstra(java.util.ArrayList<java.util.ArrayList<Pair<java.lang.Integer,java.lang.Integer>>> adj, int n, int start) Dijkstra’s algorithm solves the single-source shortest-paths problem on a weighted, directed graph for the case in which all edge weights are nonnegative Time complexity: O(|E| + |V|log|V|) Space complexity: TODO

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Dijkstra

public Dijkstra()

Method Detail

dijkstra

public static int[] dijkstra(java.util.ArrayList<java.util.ArrayList<Pair<java.lang.Integer,java.lang.Integer>>> adj,
                             int n,
                             int start)

Dijkstra’s algorithm solves the single-source shortest-paths problem on a weighted, directed graph for the case in which all edge weights are nonnegative Time complexity: O(|E| + |V|log|V|) Space complexity: TODO