public class EvaluationGraphPart extends SparseGraph<EvaluationGraphNode,EvaluationGraphEdge>
EvaluationGraph.directed_edges, INCIDENT, INCOMING, OUTGOING, undirected_edges, vertex_maps| Constructor and Description |
|---|
EvaluationGraphPart() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
addEdge(EvaluationGraphEdge edge,
EvaluationGraphNode sourceNode,
EvaluationGraphNode destinationNode,
edu.uci.ics.jung.graph.util.EdgeType edge_type) |
boolean |
addVertex(EvaluationGraphNode evaluationGraphNode) |
EvaluationGraphEdge |
findEdge(EvaluationGraphNode evalSourceNode,
EvaluationGraphNode evalDestinNode) |
protected java.util.concurrent.ConcurrentHashMap<java.lang.Integer,EvaluationGraphNode> |
getGraphNodeHash()
Returns the graph node hash.
|
boolean |
removeEdge(EvaluationGraphEdge edge) |
boolean |
removeVertex(EvaluationGraphNode evaluationGraphNode) |
addEdge, containsEdge, containsVertex, findEdgeSet, getDefaultEdgeType, getDest, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getEndpoints, getFactory, getIncidentEdges, getInEdges, getNeighbors, getOutEdges, getPredecessors, getSource, getSuccessors, getVertexCount, getVertices, isDest, isSourceaddEdge, addEdge, addEdge, addEdge, degree, getIncidentCount, getIncidentVertices, getNeighborCount, getOpposite, getPredecessorCount, getSuccessorCount, getValidatedEndpoints, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree, toStringclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitprotected java.util.concurrent.ConcurrentHashMap<java.lang.Integer,EvaluationGraphNode> getGraphNodeHash()
public boolean addVertex(EvaluationGraphNode evaluationGraphNode)
addVertex in interface edu.uci.ics.jung.graph.Hypergraph<EvaluationGraphNode,EvaluationGraphEdge>addVertex in class SparseGraph<EvaluationGraphNode,EvaluationGraphEdge>public boolean removeVertex(EvaluationGraphNode evaluationGraphNode)
removeVertex in interface edu.uci.ics.jung.graph.Hypergraph<EvaluationGraphNode,EvaluationGraphEdge>removeVertex in class SparseGraph<EvaluationGraphNode,EvaluationGraphEdge>public boolean addEdge(EvaluationGraphEdge edge, EvaluationGraphNode sourceNode, EvaluationGraphNode destinationNode, edu.uci.ics.jung.graph.util.EdgeType edge_type)
addEdge in interface edu.uci.ics.jung.graph.Graph<EvaluationGraphNode,EvaluationGraphEdge>addEdge in class edu.uci.ics.jung.graph.AbstractGraph<EvaluationGraphNode,EvaluationGraphEdge>public boolean removeEdge(EvaluationGraphEdge edge)
removeEdge in interface edu.uci.ics.jung.graph.Hypergraph<EvaluationGraphNode,EvaluationGraphEdge>removeEdge in class SparseGraph<EvaluationGraphNode,EvaluationGraphEdge>public EvaluationGraphEdge findEdge(EvaluationGraphNode evalSourceNode, EvaluationGraphNode evalDestinNode)
findEdge in interface edu.uci.ics.jung.graph.Hypergraph<EvaluationGraphNode,EvaluationGraphEdge>findEdge in class SparseGraph<EvaluationGraphNode,EvaluationGraphEdge>