dataStructuresAndAlgorithms/dev.funkymuse.datastructuresandalgorithms.graphs.djikstra/Dijkstra

Dijkstra

class Dijkstra<T>(graph: AdjacencyList<T>)

Constructors

constructor(graph: AdjacencyList<T>)

Functions

getAllShortestPath

fun getAllShortestPath(source: Vertex<T>): HashMap<Vertex<T>, ArrayList<Edge<T>>>

fun shortestPath(start: Vertex<T>): HashMap<Vertex<T>, Visit<T>>

fun shortestPath(destination: Vertex<T>, paths: HashMap<Vertex<T>, Visit<T>>): ArrayList<Edge<T>>