choco.cp.common.util.preprocessor.graph
Class ArrayGraph

java.lang.Object
  extended by choco.cp.common.util.preprocessor.graph.ArrayGraph

public final class ArrayGraph
extends Object

A simple representation of a graph as both matrix/list of adjacency to perform clique detection among binary constraints


Nested Class Summary
static class ArrayGraph.Edge
           
 
Field Summary
 int nbEdges
           
 int nbNode
           
 gnu.trove.THashMap<ArrayGraph.Edge,Constraint> storeEdges
           
 
Constructor Summary
ArrayGraph(int n)
           
 
Method Summary
 void addEdge(int i, int j)
           
 int degree(int i)
           
 int[] degrees()
           
 Constraint getConstraintEdge(int a, int b)
           
 boolean isIn(int i, int j)
           
 int[] neighbours(int i)
           
 void remEdge(int i, int j)
           
 void setNeighbours()
           
 void storeEdge(Constraint c, int a, int b)
           
 String toString()
           
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
 

Field Detail

nbNode

public int nbNode

nbEdges

public int nbEdges

storeEdges

public gnu.trove.THashMap<ArrayGraph.Edge,Constraint> storeEdges
Constructor Detail

ArrayGraph

public ArrayGraph(int n)
Method Detail

addEdge

public void addEdge(int i,
                    int j)

setNeighbours

public void setNeighbours()

remEdge

public void remEdge(int i,
                    int j)

isIn

public boolean isIn(int i,
                    int j)

degree

public int degree(int i)

neighbours

public int[] neighbours(int i)

degrees

public int[] degrees()

toString

public String toString()
Overrides:
toString in class Object

storeEdge

public void storeEdge(Constraint c,
                      int a,
                      int b)

getConstraintEdge

public Constraint getConstraintEdge(int a,
                                    int b)


Copyright © 2012. All Rights Reserved.