Modifier and Type | Field | Description |
---|---|---|
static boolean |
useReverseEdges |
Constructor | Description |
---|---|
GraphImpl(byte nodeCount) |
|
GraphImpl(byte nodeCount,
byte rootNodeCount) |
|
GraphImpl(byte nodeCount,
byte rootNodeCount,
Bitmap store) |
|
GraphImpl(byte nodeCount,
byte rootNodeCount,
Bitmap store,
Coefficient coefficient) |
|
GraphImpl(byte nodeCount,
Bitmap store) |
|
GraphImpl(Node[] nodes) |
Modifier and Type | Method | Description |
---|---|---|
void |
addFactors(int[] newFactors) |
|
Coefficient |
coefficient() |
|
int |
compareTo(Graph other) |
|
Graph |
copy() |
|
protected void |
createEdges() |
|
protected void |
createReverseEdge(byte i) |
|
void |
createReverseEdges() |
|
void |
deleteEdge(byte edgeId) |
|
void |
deleteEdge(byte fromNode,
byte toNode) |
|
byte |
edgeCount() |
|
java.util.List<Edge> |
edges() |
|
java.lang.String |
edgesToString() |
|
boolean |
equals(java.lang.Object obj) |
|
int[] |
factors() |
factors are considered to be variables that go with the diagram, such as
rhoA^2 rhoB^3
The array contains the exponents on each of the factors
|
Edge |
getEdge(byte edgeId) |
|
Edge |
getEdge(byte fromNode,
byte toNode) |
|
byte |
getEdgeId(byte fromNode,
byte toNode) |
|
byte |
getFromNode(byte edgeId) |
|
Node |
getNode(byte node) |
|
byte |
getOutDegree(byte node) |
|
byte |
getOutNode(byte node,
byte index) |
|
java.lang.String |
getSignature() |
|
Bitmap |
getStore() |
|
byte |
getToNode(byte edgeId) |
|
boolean |
hasEdge(byte edgeId) |
|
boolean |
hasEdge(byte fromNode,
byte toNode) |
|
byte |
nodeCount() |
|
java.util.List<Node> |
nodes() |
|
java.lang.String |
nodesToString() |
|
void |
putEdge(byte edgeId) |
|
void |
putEdge(byte fromNode,
byte toNode) |
|
void |
setNumFactors(int numFactors) |
|
java.lang.String |
toString() |
|
java.lang.String |
toSVG(int dim) |
|
void |
visitEdges(EdgeVisitor visitor) |
|
void |
visitNodes(NodeVisitor visitor) |
public GraphImpl(Node[] nodes)
public GraphImpl(byte nodeCount)
public GraphImpl(byte nodeCount, byte rootNodeCount)
public GraphImpl(byte nodeCount, Bitmap store)
public GraphImpl(byte nodeCount, byte rootNodeCount, Bitmap store)
public GraphImpl(byte nodeCount, byte rootNodeCount, Bitmap store, Coefficient coefficient)
public void createReverseEdges()
createReverseEdges
in interface Graph
protected void createReverseEdge(byte i)
public void setNumFactors(int numFactors)
setNumFactors
in interface Graph
public int[] factors()
Graph
public void addFactors(int[] newFactors)
addFactors
in interface Graph
public Coefficient coefficient()
coefficient
in interface Graph
public int compareTo(Graph other)
compareTo
in interface java.lang.Comparable<Graph>
protected void createEdges()
public void deleteEdge(byte fromNode, byte toNode)
deleteEdge
in interface Graph
public void deleteEdge(byte edgeId)
deleteEdge
in interface Graph
public java.lang.String edgesToString()
edgesToString
in interface Graph
public boolean equals(java.lang.Object obj)
equals
in class java.lang.Object
public java.lang.String getSignature()
getSignature
in interface Graph
public byte getEdgeId(byte fromNode, byte toNode)
public byte getFromNode(byte edgeId)
getFromNode
in interface Graph
public byte getOutDegree(byte node)
getOutDegree
in interface Graph
public byte getOutNode(byte node, byte index)
getOutNode
in interface Graph
public boolean hasEdge(byte fromNode, byte toNode)
public java.lang.String nodesToString()
nodesToString
in interface Graph
public java.lang.String toString()
toString
in class java.lang.Object
public void visitEdges(EdgeVisitor visitor)
visitEdges
in interface Graph
public void visitNodes(NodeVisitor visitor)
visitNodes
in interface Graph