public void labelDistances(Hypergraph<V,E> graph,V root){
  labelDistances(graph,Collections.singleton(root));
}

public void labelDistances ( Hypergraph < V , E > graph , V root ) { labelDistances ( graph , Collections . singleton ( root ) ) ; }
computes the distances of all the node from the specified root node . also keeps track of the predecessors of each node traversed as well as the order of nodes traversed .
