|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
Interface of a (cubic) graph allowing the graph transformations used to reduce a Yutsis graph.
Graph
,
YutsisGraph
Method Summary | |
int[] |
bubble()
Returns the first bubble encoutered, or {-1,-1} if no bubbles are present. |
java.lang.Object |
clone()
Returns an exact copy of the object. |
void |
interchange(int[] nodes,
int[] icnodes)
Interchange on the edge (nodes[0], nodes[1])
interchanging the edges (nodes[0], icnodes[0])
and (nodes[1]. |
void |
interchange(int node1,
int node2,
int icnode1,
int icnode2)
Interchange on the edge (node1, node2) interchanging
the edges (node1, icnode1) and
(node2, icnode2) . |
void |
removeBubble(int[] bubble)
Removes the bubble. |
void |
removeTriangle(int[] triangle)
Removes the triangle triangle[0], triangle[1],
triangle[2] . |
void |
removeTriangle(int node1,
int node2,
int node3)
Removes the triangle node1, node2, node3 . |
int[] |
triangle()
Returns the first triangle encoutered, or {-1,-1,-1} if no bubbles are present. |
int[][] |
triangles()
Returns all triangles as an array of int [3] objects. |
boolean |
triangularDelta()
True if the graph represents a triangular delta, false otherwise. |
boolean |
triangularDelta(int[] td)
True if the graph represents a triangular delta between node td[0] and td[1] , false otherwise. |
boolean |
triangularDelta(int node1,
int node2)
True if the graph represents a triangular delta between node node1 and node2 , false otherwise. |
Methods inherited from interface Graph |
addChangeListener, connected, first, isRemoved, isTree, last, neighbors, nodeIterator, nrOfEdges, nrOfNodes, order, removeChangeListener, toGml |
Method Detail |
public int[] bubble()
public void interchange(int[] nodes, int[] icnodes)
(nodes[0], nodes[1])
interchanging the edges (nodes[0], icnodes[0])
and (nodes[1].
- Parameters:
nodes
- array containing the endpoints of the edge on
which the interchange is performedicnodes
- array containing the neighbors of the corresponding
nodes of nodes to be interchanged
public void interchange(int node1, int node2, int icnode1, int icnode2)
(node1, node2)
interchanging
the edges (node1, icnode1)
and
(node2, icnode2)
.
node1
- first node of the edge on which the interchange
is performednode2
- second node of the edge on which the interchange
is performedicnode1
- neighbor of node1 to be interchanged with icnode2icnode2
- neighbor of node2 to be interchanged with icnode1public void removeBubble(int[] bubble)
bubble
- the bubble to be removedpublic void removeTriangle(int[] triangle)
triangle[0], triangle[1],
triangle[2]
.
triangle
- array containing the nodes of the triangle to
be removedpublic void removeTriangle(int node1, int node2, int node3)
node1, node2, node3
.
node1
- first node of the triangle to be removednode2
- second node of the triangle to be removednode3
- third node of the triangle to be removedpublic int[] triangle()
public int[][] triangles()
public boolean triangularDelta()
public boolean triangularDelta(int[] td)
td[0]
and td[1]
, false otherwise.
td
- the nodes of the triangular delta as an array
public boolean triangularDelta(int node1, int node2)
node1
and node2
, false otherwise.
node1
- first node of the triangular delta to be formattednode2
- second node of the triangular delta to be formatted
public java.lang.Object clone()
clone
in class java.lang.Object
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |