Class IntArrayGraphAlgorithm<V,​E>

  • Type Parameters:
    V - the graph vertex type
    E - the graph edge type
    Direct Known Subclasses:
    BrownBacktrackColoring, GreedyColoring

    public abstract class IntArrayGraphAlgorithm<V,​E>
    extends java.lang.Object
    • Field Summary

      Fields 
      Modifier and Type Field Description
      protected int[][] _neighbors  
      protected java.util.Map<V,​java.lang.Integer> _vertexToPos  
      protected java.util.List<V> _vertices  
    • Method Summary

      • Methods inherited from class java.lang.Object

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

      • _vertices

        protected final java.util.List<V> _vertices
      • _neighbors

        protected final int[][] _neighbors
      • _vertexToPos

        protected final java.util.Map<V,​java.lang.Integer> _vertexToPos
    • Constructor Detail

      • IntArrayGraphAlgorithm

        public IntArrayGraphAlgorithm​(Graph<V,​E> g)
        Create a new instance.
        Parameters:
        g - the input graph