T - the type of verticesD - the type of edgespublic class Application<T extends Task,D extends Dependency> extends Graph<T,D>
Application is the default implementation of the application
graph.| Modifier and Type | Field and Description |
|---|---|
protected java.util.Map<java.lang.String,Attributes> |
fmap |
| Constructor and Description |
|---|
Application() |
| Modifier and Type | Method and Description |
|---|---|
void |
add(Function<T,D> function) |
boolean |
addEdge(D dependency,
java.util.Collection<? extends T> vertices) |
boolean |
addEdge(D dependency,
edu.uci.ics.jung.graph.util.Pair<? extends T> endpoints) |
boolean |
addEdge(D dependency,
T v1,
T v2) |
protected Function<T,D> |
buildFunction(java.util.Set<T> tasks) |
protected Attributes |
getAttributes(java.util.Set<T> tasks) |
Function<T,D> |
getFunction(D dependency) |
Function<T,D> |
getFunction(java.lang.String id) |
Function<T,D> |
getFunction(T task) |
java.util.Set<Function<T,D>> |
getFunctions() |
protected java.util.Set<T> |
getReachable(T task) |
protected java.lang.String |
nextFunctionId() |
boolean |
removeVertex(T t) |
getEdge, getEdge, getVertex, getVertex, iterator, removeVerticesaddEdge, addVertex, containsEdge, containsVertex, findEdge, getDefaultEdgeType, getDest, getEdgeCount, getEdgeCount, getEdges, getEdges, getEdgeType, getEndpoints, getFactory, getIncidentEdges, getIncoming_internal, getInEdges, getNeighbors, getOutEdges, getOutgoing_internal, getPredecessors, getSource, getSuccessors, getVertexCount, getVertices, isDest, isSource, removeEdgeaddEdge, addEdge, degree, findEdgeSet, getIncidentCount, getIncidentVertices, getNeighborCount, getOpposite, getPredecessorCount, getSuccessorCount, getValidatedEndpoints, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree, toStringprotected final java.util.Map<java.lang.String,Attributes> fmap
public boolean removeVertex(T t)
removeVertex in interface edu.uci.ics.jung.graph.Hypergraph<T extends Task,D extends Dependency>removeVertex in class edu.uci.ics.jung.graph.SparseMultigraph<T extends Task,D extends Dependency>protected java.lang.String nextFunctionId()
protected Attributes getAttributes(java.util.Set<T> tasks)
public boolean addEdge(D dependency, java.util.Collection<? extends T> vertices)
addEdge in interface edu.uci.ics.jung.graph.Hypergraph<T extends Task,D extends Dependency>addEdge in class edu.uci.ics.jung.graph.AbstractGraph<T extends Task,D extends Dependency>public boolean addEdge(D dependency, edu.uci.ics.jung.graph.util.Pair<? extends T> endpoints)
addEdge in class edu.uci.ics.jung.graph.AbstractGraph<T extends Task,D extends Dependency>