, including all inherited members.
addEdge(E arg0, V arg1, V arg2) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
addEdge(E arg0, V arg1, V arg2, EdgeType arg3) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
addEdge(E arg0, Collection<?extends V > arg1) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
addEdge(E arg0, Collection<?extends V > arg1, EdgeType arg2) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
addVertex(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
containsEdge(E arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
containsVertex(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
degree(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
findEdge(V arg0, V arg1) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
findEdgeSet(V arg0, V arg1) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
g | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | [protected] |
getDefaultEdgeType() | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getDest(E arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getEdgeCount() | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getEdgeCount(EdgeType arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getEdges() | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getEdges(EdgeType arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getEdgeType(E arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getEndpoints(E arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getIncidentCount(E arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getIncidentEdges(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getIncidentVertices(E arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getInEdges(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getInnerGraph() | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getNeighborCount(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getNeighbors(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getOpposite(V arg0, E arg1) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getOutEdges(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getPredecessorCount(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getPredecessors(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getSource(E arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getSuccessorCount(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getSuccessors(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getVertexCount() | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
getVertices() | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
inDegree(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
isDest(V arg0, E arg1) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
isIncident(V arg0, E arg1) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
isNeighbor(V arg0, V arg1) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
isPredecessor(V arg0, V arg1) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
isSource(V arg0, E arg1) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
isSuccessor(V arg0, V arg1) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
JungAdapterGraph(SimpleDirectedGraph< V, E > g) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
outDegree(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
removeEdge(E arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |
removeVertex(V arg0) | cu.trustGrapher.graphs.JungAdapterGraph< V, E > | |