|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
The interface used by all algorithms to access graph coloring algorithms. These algorithms color the vertices and/or edges of a graph such that no two adjacent elements are the same color.
WelshPowell| Method Summary | |
int |
colorEdges()
Colors the edges of the graph. |
int |
colorVertices()
Colors the vertices of the graph. |
int |
getEdgeColor(EdgeI edge)
Returns the color assigned to the edge. |
int[] |
getEdgeColors()
Returns an array containing the edge color assignments. |
int |
getVertexColor(VertexI vertex)
Returns the color assigned to the vertex. |
int[] |
getVertexColors()
Returns an array containing the vertex color assignments. |
int |
sizeOfEdgeColors()
Returns the number of unique colors used to color the edges. |
int |
sizeOfVertexColors()
Returns the number of unique colors used to color the vertices. |
| Method Detail |
public int colorVertices()
public int colorEdges()
public int sizeOfVertexColors()
throws GraphException
public int sizeOfEdgeColors()
throws GraphException
public int getVertexColor(VertexI vertex)
throws GraphException
public int getEdgeColor(EdgeI edge)
throws GraphException
public int[] getVertexColors()
throws GraphException
public int[] getEdgeColors()
throws GraphException
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||