code: @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;
      }
docs: Search for the shortest paths from a single source node in a graph.
  
  @param graph
  the graph in which to perform the search
  @param init
  the initial (source) node
  @param edgeWeights
  the edge weights
  
  @return the single-source shortest path results