Class GraphLevelIndexer<V,​E>


  • public class GraphLevelIndexer<V,​E>
    extends java.lang.Object
    Computes the hierarchy level (or distance) of all vertices from the starting root nodes. If there are multiple root nodes, than the maximum distance from each root node is used. All vertices which are not connected to the provided root nodes have a level of -1.
    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      java.util.Map<V,​java.lang.Integer> getLevelMap()  
      void indexLevel​(edu.uci.ics.jung.graph.Hypergraph<V,​E> graph, java.util.Set<V> rootSet)  
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
    • Constructor Detail

      • GraphLevelIndexer

        public GraphLevelIndexer()
    • Method Detail

      • indexLevel

        public void indexLevel​(edu.uci.ics.jung.graph.Hypergraph<V,​E> graph,
                               java.util.Set<V> rootSet)
      • getLevelMap

        public java.util.Map<V,​java.lang.Integer> getLevelMap()