|
|||||||||||
| PREV LETTER NEXT LETTER | FRAMES NO FRAMES | ||||||||||
ArchetypeEdge that connects exactly
two instances of Vertex. DijkstraShortestPath
should cache its results (final and partial) for future reference;
true if g is constrained to only
accept directed edges, and false otherwise.
true if p is an edge
constraint of g, and false otherwise.
true if g is constrained to
reject parallel edges.
true if g is constrained to only
accept undirected edges.
true if p is an edge
constraint of g, and false otherwise.
true if o is an instance of
ArchetypeEdge that is equivalent to this edge.
true if o is an instance of
ArchetypeVertex that is equivalent to this vertex.
true if this edge is not currently
part of graph ag.
true if there exists an
edge which is parallel to the specified edge.
true if e is an
Edge that connects a vertex to itself.
true if ae is neither a
self-loop nor parallel to an existing edge.
true if the datum stored by e with
key value key (in the user data repository) is
datum.
true if arg0 is a connected
Graph: that is, if there exists a path from each
vertex to all other vertices (ignoring edge direction).
- evaluateGraph(ArchetypeGraph) -
Method in class edu.uci.ics.jung.graph.predicates.GraphPredicate
-
- evaluateVertex(ArchetypeVertex) -
Method in class edu.uci.ics.jung.graph.predicates.IsolatedVertexPredicate
- Returns
true if the argument is a Vertex
whose degree is 0.
- evaluateVertex(ArchetypeVertex) -
Method in class edu.uci.ics.jung.graph.predicates.NotInGraphVertexPredicate
- Returns
true if this vertex is not currently
part of graph ag.
- evaluateVertex(ArchetypeVertex) -
Method in class edu.uci.ics.jung.graph.predicates.UserDatumVertexPredicate
- Returns
true if the datum stored by v with
key value key (in the user data repository) is
datum.
- evaluateVertex(ArchetypeVertex) -
Method in class edu.uci.ics.jung.graph.predicates.VertexPredicate
-
- evolveGraph(int) -
Method in class edu.uci.ics.jung.random.generators.BarabasiAlbertGenerator
-
- evolveGraph(int) -
Method in interface edu.uci.ics.jung.random.generators.EvolvingGraphGenerator
- Instructs the algorithm to evolve the graph N time steps and return
the most current evolved state of the graph
- extract(Graph) -
Method in class edu.uci.ics.jung.algorithms.cluster.BicomponentClusterer
- Extracts the bicomponents from the graph
- extract(Graph) -
Method in class edu.uci.ics.jung.algorithms.cluster.EdgeBetweennessClusterer
- Finds the set of clusters which have the strongest "community structure".
- extract(DirectedGraph, Set) -
Method in class edu.uci.ics.jung.algorithms.cluster.ExactFlowCommunity
- Extracts the community according to the cohesion threshold
- extract(DirectedGraph, Set, int) -
Static method in class edu.uci.ics.jung.algorithms.cluster.ExactFlowCommunity
- Implements the "ApproximateFlowCommunity" algorithm.
- extract(Graph) -
Method in interface edu.uci.ics.jung.algorithms.cluster.GraphClusterer
- Extracts the clusters from a graph.
- extract(Graph) -
Method in class edu.uci.ics.jung.algorithms.cluster.WeakComponentClusterer
- Extracts the weak components from a graph.
- extractInDirectedNeighborhood(DirectedGraph, Set, int) -
Static method in class edu.uci.ics.jung.algorithms.connectivity.KNeighborhoodExtractor
- Extracts the subgraph comprised of all vertices within distance K (in-directed) from any
node in rootNodes.
- extractNeighborhood(Graph, Set, int) -
Static method in class edu.uci.ics.jung.algorithms.connectivity.KNeighborhoodExtractor
- Extracts the subgraph comprised of all vertices within distance K (undirected) from any
node in rootNodes.
- extractOutDirectedNeighborhood(DirectedGraph, Set, int) -
Static method in class edu.uci.ics.jung.algorithms.connectivity.KNeighborhoodExtractor
- Extracts the subgraph comprised of all vertices within distance K (out-directed) from any
node in rootNodes.
|
|||||||||||
| PREV LETTER NEXT LETTER | FRAMES NO FRAMES | ||||||||||