Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV NEXT | FRAMES NO FRAMES

## Uses of Interface
edu.uci.ics.jung.graph.ArchetypeGraph

Packages that use ArchetypeGraph
edu.uci.ics.jung.algorithms.cluster | Provides a series of methods for locating clusters in graphs according to some model-based, heuristic or graph-theoretic criteria.
edu.uci.ics.jung.algorithms.shortestpath | Provides a set of algorithms for computing the shortest path between two nodes or between each pair of nodes in a graph.
edu.uci.ics.jung.graph | Specifies the interfaces for and capabilities of the JUNG vertex, edge, and graph classes.
edu.uci.ics.jung.graph.decorators | Provides mechanisms for annotating nodes consistently with useful information.
edu.uci.ics.jung.graph.event |
edu.uci.ics.jung.graph.impl | Implementations of the JUNG vertex, edge, and graph interfaces.
edu.uci.ics.jung.graph.predicates | A `Predicate` tests whether an `Object` satisfies a specific implementation-defined property.
edu.uci.ics.jung.random.generators | Provides a series of methods for generating new graphs with various properties.
edu.uci.ics.jung.statistics | Provides a set of statistical tools for analyzing graphs.
edu.uci.ics.jung.utils | Provides a series of useful utility methods, and a number of custom helper classes designed specifically for this application.

Uses of ArchetypeGraph in edu.uci.ics.jung.algorithms.cluster

Methods in edu.uci.ics.jung.algorithms.cluster that return ArchetypeGraph
`ArchetypeGraph` | `ClusterSet.getUnderlyingGraph()`

Methods in edu.uci.ics.jung.algorithms.cluster with parameters of type ArchetypeGraph
`ClusterSet` | `BicomponentClusterer.extract(ArchetypeGraph theGraph)` Extracts the bicomponents from the graph
`ClusterSet` | `EdgeBetweennessClusterer.extract(ArchetypeGraph g)` Finds the set of clusters which have the strongest "community structure".
`ClusterSet` | `GraphClusterer.extract(ArchetypeGraph graph)` Extracts the clusters from a graph.
`Collection` | `VoltageClusterer.cluster(ArchetypeGraph g, int num_clusters)` Clusters the vertices of `g` into `num_clusters` clusters, based on their connectivity.
`void` | `VoltageClusterer.clear(ArchetypeGraph g)` Clears the voltage decoration values from the vertices of `g`.
`protected Collection` | `VoltageClusterer.cluster_internal(ArchetypeGraph g, ArchetypeVertex origin, int num_clusters)` Does the work of `getCommunity` and `cluster`.
`ClusterSet` | `WeakComponentClusterer.extract(ArchetypeGraph aGraph)` Extracts the weak components from a graph.

Constructors in edu.uci.ics.jung.algorithms.cluster with parameters of type ArchetypeGraph
`ClusterSet(ArchetypeGraph underlyingGraph)` Creates a new instance.
`VertexClusterSet(ArchetypeGraph underlyingGraph)` Constructs and initializes the set

Uses of ArchetypeGraph in edu.uci.ics.jung.algorithms.shortestpath

Fields in edu.uci.ics.jung.algorithms.shortestpath declared as ArchetypeGraph
`protected ArchetypeGraph` | `DijkstraDistance.g`

Constructors in edu.uci.ics.jung.algorithms.shortestpath with parameters of type ArchetypeGraph
`DijkstraDistance(ArchetypeGraph g, NumberEdgeValue nev, boolean cached)` Creates an instance of `DijkstraShortestPath` for the specified graph and the specified method of extracting weights from edges, which caches results locally if and only if `cached` is `true`.
`DijkstraDistance(ArchetypeGraph g, NumberEdgeValue nev)` Creates an instance of `DijkstraShortestPath` for the specified graph and the specified method of extracting weights from edges, which caches results locally.
`DijkstraDistance(ArchetypeGraph g)` Creates an instance of `DijkstraShortestPath` for the specified unweighted graph (that is, all weights 1) which caches results locally.
`DijkstraDistance(ArchetypeGraph g, boolean cached)` Creates an instance of `DijkstraShortestPath` for the specified unweighted graph (that is, all weights 1) which caches results locally.
`DijkstraShortestPath(ArchetypeGraph g, NumberEdgeValue nev, boolean cached)` Creates an instance of `DijkstraShortestPath` for the specified graph and the specified method of extracting weights from edges, which caches results locally if and only if `cached` is `true`.
`DijkstraShortestPath(ArchetypeGraph g, NumberEdgeValue nev)` Creates an instance of `DijkstraShortestPath` for the specified graph and the specified method of extracting weights from edges, which caches results locally.
`DijkstraShortestPath(ArchetypeGraph g)` Creates an instance of `DijkstraShortestPath` for the specified unweighted graph (that is, all weights 1) which caches results locally.
`DijkstraShortestPath(ArchetypeGraph g, boolean cached)` Creates an instance of `DijkstraShortestPath` for the specified unweighted graph (that is, all weights 1) which caches results locally.

Uses of ArchetypeGraph in edu.uci.ics.jung.graph

Subinterfaces of ArchetypeGraph in edu.uci.ics.jung.graph
`interface` | `DirectedGraph` A tagging interface for implementations of `Graph` whose edge set consists of implementations of `DirectedEdge`.
`interface` | `Graph` A specific type of `ArchetypeGraph` which consists of a `Vertex` set and an `Edge` set.
`interface` | `Hypergraph` A Hypergraph consists of hypervertices and hyperedges.
`interface` | `KPartiteGraph` An interface for k-partite graphs.
`interface` | `UndirectedGraph` A tagging interface for implementations of `Graph` whose edge set consists of implementations of `UndirectedEdge`.

Methods in edu.uci.ics.jung.graph that return ArchetypeGraph
`ArchetypeGraph` | `ArchetypeGraph.newInstance()` Returns a graph of the same type as the graph on which this method is invoked.
`ArchetypeGraph` | `ArchetypeGraph.copy()` Performs a deep copy of the graph and its contents.
`ArchetypeGraph` | `Element.getGraph()` Returns a reference to the graph that contains this element.

Methods in edu.uci.ics.jung.graph with parameters of type ArchetypeGraph
`ArchetypeEdge` | `ArchetypeEdge.getEqualEdge(ArchetypeGraph g)` Returns the edge in graph `g`, if any, that is equivalent to this edge.
`ArchetypeEdge` | `ArchetypeEdge.getEquivalentEdge(ArchetypeGraph g)` Deprecated. As of version 1.4, renamed to getEqualEdge(g).
`ArchetypeEdge` | `ArchetypeEdge.copy(ArchetypeGraph g)` Creates a copy of this edge in graph `g`.
`ArchetypeVertex` | `ArchetypeVertex.getEqualVertex(ArchetypeGraph g)` Returns the vertex in graph `g`, if any, that is equal to this vertex.
`ArchetypeVertex` | `ArchetypeVertex.getEquivalentVertex(ArchetypeGraph g)` Deprecated. As of version 1.4, renamed to getEqualVertex(g).
`ArchetypeVertex` | `ArchetypeVertex.copy(ArchetypeGraph g)` Creates a copy of this vertex in graph `g`.

Uses of ArchetypeGraph in edu.uci.ics.jung.graph.decorators

Methods in edu.uci.ics.jung.graph.decorators with parameters of type ArchetypeGraph
`static Indexer` | `Indexer.getIndexer(ArchetypeGraph g)` Gets the indexer associated with this graph.
`static Indexer` | `Indexer.getAndUpdateIndexer(ArchetypeGraph g)` Gets the indexer associated with this graph.
`static Indexer` | `Indexer.newIndexer(ArchetypeGraph g, int offset)` Creates a new indexer associated with this graph.
`static Indexer` | `Indexer.getIndexer(ArchetypeGraph g, Object key)` * Gets an indexer associated with this graph at this key
`static Indexer` | `Indexer.getAndUpdateIndexer(ArchetypeGraph g, Object key)` Gets the indexer associated with this graph.
`static boolean` | `Indexer.hasIndexer(ArchetypeGraph g)` Checks if there is an indexer assocated with this graph.
`static boolean` | `Indexer.hasIndexer(ArchetypeGraph g, Object key)` Checks if there is an indexer assocated with this graph.
`void` | `UserDatumNumberEdgeValue.clear(ArchetypeGraph g)` Removes this decoration from `g`.
`void` | `UserDatumNumberVertexValue.clear(ArchetypeGraph g)` Removes this decoration from `g`.

Uses of ArchetypeGraph in edu.uci.ics.jung.graph.event

Methods in edu.uci.ics.jung.graph.event that return ArchetypeGraph
`ArchetypeGraph` | `GraphEvent.getGraph()`

Constructors in edu.uci.ics.jung.graph.event with parameters of type ArchetypeGraph
`GraphEvent(ArchetypeGraph g, Element graphElement)`
`GraphListenerHandler(ArchetypeGraph graph)`

Uses of ArchetypeGraph in edu.uci.ics.jung.graph.impl

Classes in edu.uci.ics.jung.graph.impl that implement ArchetypeGraph
`class` | `AbstractArchetypeGraph`
`class` | `AbstractSparseGraph` This class provides a skeletal implementation of the `Graph` interface to minimize the effort required to implement this interface.
`class` | `BipartiteGraph` A Bipartite graph is divided into A vertices and B vertices.
`class` | `DirectedSparseGraph` An implementation of `Graph` that consists of a `Vertex` set and a `DirectedEdge` set.
`class` | `HypergraphBPG` Deprecated. As of version 1.7, replaced by `SetHypergraph`.
`class` | `KPartiteSparseGraph` An implementation of KPartiteGraph based on SparseGraph.
`class` | `SetHypergraph` A basic implementation of `Hypergraph`.
`class` | `SparseGraph` An implementation of `AbstractSparseGraph` that, by default, imposes no constraints on the edges and vertices that may be added to it.
`class` | `SparseTree` An implementation of `Graph` that consists of a `Vertex` set and a `DirectedEdge` set.
`class` | `UndirectedSparseGraph` An implementation of `Graph` that consists of a `Vertex` set and an `UndirectedEdge` set.

Methods in edu.uci.ics.jung.graph.impl that return ArchetypeGraph
`ArchetypeGraph` | `AbstractArchetypeGraph.newInstance()` Creates a new empty graph of the same type as this graph, by cloning this graph and then clearing the extraneous fields.
`ArchetypeGraph` | `AbstractArchetypeGraph.copy()` Creates a replica of this graph.
`ArchetypeGraph` | `AbstractElement.getGraph()`
`ArchetypeGraph` | `AbstractHyperUnitBPG.getGraph()` Deprecated.
`ArchetypeGraph` | `HypergraphBPG.newInstance()` Deprecated.
`ArchetypeGraph` | `HypergraphBPG.copy()` Deprecated.

Methods in edu.uci.ics.jung.graph.impl with parameters of type ArchetypeGraph
`ArchetypeEdge` | `AbstractArchetypeEdge.getEqualEdge(ArchetypeGraph ag)`
`ArchetypeEdge` | `AbstractArchetypeEdge.getEquivalentEdge(ArchetypeGraph ag)` Deprecated. As of version 1.4, renamed to getEqualEdge(ag).
`ArchetypeEdge` | `AbstractArchetypeEdge.copy(ArchetypeGraph g)`
`ArchetypeVertex` | `AbstractArchetypeVertex.copy(ArchetypeGraph g)`
`ArchetypeVertex` | `AbstractArchetypeVertex.getEqualVertex(ArchetypeGraph ag)` Returns the vertex in the specified graph `ag` that is equivalent to this vertex.
`ArchetypeVertex` | `AbstractArchetypeVertex.getEquivalentVertex(ArchetypeGraph ag)` Deprecated. As of version 1.4, renamed to getEqualVertex(ag).
`ArchetypeEdge` | `AbstractHyperedge.copy(ArchetypeGraph newGraph)` Creates a copy of this edge in the specified graph `newGraph`, and copies this edge's user data to the new edge.
`ArchetypeVertex` | `AbstractHypervertex.copy(ArchetypeGraph g)`
`ArchetypeEdge` | `AbstractSparseEdge.copy(ArchetypeGraph newGraph)` Creates a copy of this edge in the specified graph `newGraph`, and copies this edge's user data to the new edge.
`ArchetypeVertex` | `AbstractSparseVertex.copy(ArchetypeGraph newGraph)`
`ArchetypeEdge` | `BipartiteEdge.copy(ArchetypeGraph newGraph)`
`ArchetypeVertex` | `BipartiteVertex.copy(ArchetypeGraph newGraph)` Specialized copy function for copy FROM BipartiteGraph TO BipartiteGraph
`ArchetypeEdge` | `HyperedgeBPG.getEqualEdge(ArchetypeGraph g)` Deprecated.
`ArchetypeEdge` | `HyperedgeBPG.getEquivalentEdge(ArchetypeGraph g)` Deprecated. As of version 1.4, renamed to getEqualEdge(g).
`ArchetypeEdge` | `HyperedgeBPG.copy(ArchetypeGraph g)` Deprecated.
`ArchetypeVertex` | `HypervertexBPG.getEqualVertex(ArchetypeGraph g)`
`ArchetypeVertex` | `HypervertexBPG.getEquivalentVertex(ArchetypeGraph g)` Deprecated. As of version 1.4, renamed to getEqualVertex(g).
`ArchetypeVertex` | `HypervertexBPG.copy(ArchetypeGraph g)`

Uses of ArchetypeGraph in edu.uci.ics.jung.graph.predicates

Methods in edu.uci.ics.jung.graph.predicates with parameters of type ArchetypeGraph
`boolean` | `CliqueGraphPredicate.evaluateGraph(ArchetypeGraph g)`
`boolean` | `ConnectedGraphPredicate.evaluateGraph(ArchetypeGraph graph)` Returns `true` if there exists a path from each vertex to all other vertices (ignoring edge direction).
`abstract boolean` | `GraphPredicate.evaluateGraph(ArchetypeGraph g)`

Constructors in edu.uci.ics.jung.graph.predicates with parameters of type ArchetypeGraph
`NotInGraphEdgePredicate(ArchetypeGraph ag)`
`NotInGraphVertexPredicate(ArchetypeGraph ag)`

Uses of ArchetypeGraph in edu.uci.ics.jung.random.generators

Methods in edu.uci.ics.jung.random.generators that return ArchetypeGraph
`ArchetypeGraph` | `BarabasiAlbertGenerator.generateGraph()`
`ArchetypeGraph` | `EppsteinPowerLawGenerator.generateGraph()` Generates a graph whose degree distribution approximates a power-law.
`ArchetypeGraph` | `ErdosRenyiGenerator.generateGraph()` Returns a graph in which each pair of vertices is connected by an undirected edge with the probability specified by the constructor.
`ArchetypeGraph` | `EvolvingGraphGenerator.generateGraph()` Returns a copy of the evolved graph in its current state
`ArchetypeGraph` | `GraphGenerator.generateGraph()` Instructs the algorithm to generate the graph
`ArchetypeGraph` | `KleinbergSmallWorldGenerator.generateGraph()` Generates a random small world network according to the parameters given
`ArchetypeGraph` | `Lattice1DGenerator.generateGraph()`
`ArchetypeGraph` | `Lattice2DGenerator.generateGraph()`
`ArchetypeGraph` | `SimpleRandomGenerator.generateGraph()` Generated the graph by creating |V| vertics and then picking |E| random edges
`ArchetypeGraph` | `WattsBetaSmallWorldGenerator.generateGraph()` Generates a beta-network from a 1-lattice according to the parameters given.

Uses of ArchetypeGraph in edu.uci.ics.jung.statistics

Methods in edu.uci.ics.jung.statistics with parameters of type ArchetypeGraph
`static Map` | `GraphStatistics.clusteringCoefficients(ArchetypeGraph graph)` Returns a `Map` of vertices to their clustering coefficients.
`static Map` | `GraphStatistics.averageDistances(ArchetypeGraph graph, Distance d)` For each vertex `v` in `graph`, calculates the average shortest path length from `v` to all other vertices in `graph` using the metric specified by `d`, and returns the results in a `Map` from vertices to `Double` values.
`static Map` | `GraphStatistics.averageDistances(ArchetypeGraph g)` For each vertex `v` in `g`, calculates the average shortest path length from `v` to all other vertices in `g`, ignoring edge weights.
`static double` | `GraphStatistics.diameter(ArchetypeGraph g, Distance d, boolean use_max)` Returns the diameter of `g` using the metric specified by `d`.
`static double` | `GraphStatistics.diameter(ArchetypeGraph g, Distance d)` Returns the diameter of `g` using the metric specified by `d`.
`static double` | `GraphStatistics.diameter(ArchetypeGraph g)` Returns the diameter of `g`, ignoring edge weights.

Uses of ArchetypeGraph in edu.uci.ics.jung.utils

Fields in edu.uci.ics.jung.utils declared as ArchetypeGraph
`protected ArchetypeGraph` | `AbstractVertexMapper.dest`
`protected ArchetypeGraph` | `SubsetManager.g` The graph for which this instance manages subsets.

Methods in edu.uci.ics.jung.utils that return ArchetypeGraph
`static ArchetypeGraph` | `GraphUtils.union(ArchetypeGraph g1, ArchetypeGraph g2)` Returns a graph which consists of the union of the two input graphs.

Methods in edu.uci.ics.jung.utils with parameters of type ArchetypeGraph
`static Set` | `GraphUtils.getEqualVertices(Set s, ArchetypeGraph g)` Returns the set of vertices in `g` which are equal to the vertices in `g`.
`static Set` | `GraphUtils.getEqualEdges(Set s, ArchetypeGraph g)` Returns the set of edges in `g` which are equal to the edges in `g`.
`static ArchetypeGraph` | `GraphUtils.union(ArchetypeGraph g1, ArchetypeGraph g2)` Returns a graph which consists of the union of the two input graphs.
`static boolean` | `GraphUtils.areEquivalent(ArchetypeGraph g1, ArchetypeGraph g2)` Returns true if `g1` and `g2` have equivalent vertex and edge sets (that is, if each vertex and edge in `g1` has an equivalent in `g2`, and vice versa), and false otherwise.
`static void` | `GraphUtils.copyValues(ArchetypeGraph g, NumberVertexValue source, NumberVertexValue dest)` Copies, for each vertex `v` in `g`, `source`'s value to `dest`.
`static VertexGenerator` | `GraphUtils.getVertexGenerator(ArchetypeGraph g)` Returns the `VertexGenerator`, if any, stored in `g`'s user data at the standardized location specified by the VG interface: `VertexGenerator.TAG`.
`static Set` | `PredicateUtils.getVertices(ArchetypeGraph g, Predicate p)` Returns a `Set` consisting of all vertices `v` in graph `g` that satisfy predicate `p`, that is, those for which `p.evaluate(v)` returns true.
`static Set` | `PredicateUtils.getEdges(ArchetypeGraph g, Predicate p)` Returns a `Set` consisting of all edges `e` in graph `g` that satisfy predicate `p`, that is, those for which `p.evaluate(e)` returns true.
`static boolean` | `PredicateUtils.addVertexSubset(ArchetypeGraph g, Predicate p)` Creates a vertex subset for `g` based on `p`, which will be maintained by the `g`'s `SubsetManager`.
`static boolean` | `PredicateUtils.addEdgeSubset(ArchetypeGraph g, Predicate p)` Creates an edge subset for `g` based on `p`, which will be maintained by the `g`'s `SubsetManager`.
`static void` | `PredicateUtils.removeVertexSubset(ArchetypeGraph g, Predicate p)` Removes the vertex subset based on `p` from `g`'s `SubsetManager`.
`static void` | `PredicateUtils.removeEdgeSubset(ArchetypeGraph g, Predicate p)` Removes the edge subset based on `p` from `g`'s `SubsetManager`.
`static boolean` | `PredicateUtils.enforcesEdgeConstraint(ArchetypeGraph g, Predicate p)` Returns `true` if `p` is an edge constraint of `g`, and `false` otherwise.
`static boolean` | `PredicateUtils.satisfiesEdgeConstraint(ArchetypeGraph g, Predicate p)` Returns `true` if each edge in `g` satisfies `p`, and false otherwise.
`static boolean` | `PredicateUtils.enforcesVertexConstraint(ArchetypeGraph g, Predicate p)` Returns `true` if `p` is an edge constraint of `g`, and `false` otherwise.
`static boolean` | `PredicateUtils.satisfiesVertexConstraint(ArchetypeGraph g, Predicate p)` Returns `true` if each vertex in `g` satisfies `p`, and false otherwise.
`static SubsetManager` | `SubsetManager.getInstance(ArchetypeGraph g)` Gets this graph's `SubsetManager`, creating it if necessary.

Constructors in edu.uci.ics.jung.utils with parameters of type ArchetypeGraph
`AbstractVertexMapper(ArchetypeGraph dest)`
`CopyVertexMapper(ArchetypeGraph dest)`
`StringLabellerVertexMapper(ArchetypeGraph dest)`
`SubsetManager(ArchetypeGraph g)` Creates a `SubsetManager`, adds it to the specified graph's user data repository, and adds itself as a listener to the graph's vertex and edge addition and removal events, so that the subsets' memberships can be maintained.
`TypedVertexGenerator(ArchetypeGraph g)`

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV NEXT | FRAMES NO FRAMES