@ Nonnull public static < N , E > SSSPResult < N , E > findSSSP ( Graph < N , E > graph , N init , EdgeWeights < E > edgeWeights ) { DijkstraSSSP < N , E > dijkstra = new DijkstraSSSP <> ( graph , init , edgeWeights ) ; dijkstra . findSSSP ( ) ; return dijkstra ; }
Search for the shortest paths from a single source node in a graph .