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

Packages that use ArchetypeGraph

edu.uci.ics.jung.graph
edu.uci.ics.jung.graph.decorators
edu.uci.ics.jung.graph.event
edu.uci.ics.jung.graph.impl
edu.uci.ics.jung.graph.predicates
edu.uci.ics.jung.random.generators
edu.uci.ics.jung.utils

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	ArchetypeVertex.getGraph() Returns a reference to the graph that contains this vertex.
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	ArchetypeEdge.getGraph() Returns a reference to the graph that contains this edge.

Methods in edu.uci.ics.jung.graph with parameters of type ArchetypeGraph

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.
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.

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, java.lang.Object key) * Gets an indexer associated with this graph at this key
static Indexer	Indexer.getAndUpdateIndexer(ArchetypeGraph g, java.lang.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, java.lang.Object key) Checks if there is an indexer assocated with this graph.

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

GraphListenerHandler(ArchetypeGraph graph)

GraphEvent(ArchetypeGraph g, UserDataContainer graphElement)

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 Implements a hypergraph built over an underlying Bipartite graph, using the equivalence explained in the FAQ.
class	KPartiteSparseGraph An implementation of KPartiteGraph based on SparseGraph.
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	HypergraphBPG.newInstance()
ArchetypeGraph	HypergraphBPG.copy()
ArchetypeGraph	AbstractSparseVertex.getGraph()
ArchetypeGraph	AbstractSparseEdge.getGraph()
ArchetypeGraph	AbstractHyperUnitBPG.getGraph()
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.

Methods in edu.uci.ics.jung.graph.impl with parameters of type ArchetypeGraph

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)
ArchetypeEdge	HyperedgeBPG.getEqualEdge(ArchetypeGraph g)
ArchetypeEdge	HyperedgeBPG.getEquivalentEdge(ArchetypeGraph g) Deprecated. As of version 1.4, renamed to getEqualEdge(g).
ArchetypeEdge	HyperedgeBPG.copy(ArchetypeGraph g)
ArchetypeVertex	BipartiteVertex.copy(ArchetypeGraph newGraph) Specialized copy function for copy FROM BipartiteGraph TO BipartiteGraph
ArchetypeEdge	BipartiteEdge.copy(ArchetypeGraph newGraph)
ArchetypeVertex	AbstractSparseVertex.getEqualVertex(ArchetypeGraph ag) Returns the vertex in the specified graph ag that is equivalent to this vertex.
ArchetypeVertex	AbstractSparseVertex.getEquivalentVertex(ArchetypeGraph ag) Deprecated. As of version 1.4, renamed to getEqualVertex(ag).
ArchetypeVertex	AbstractSparseVertex.copy(ArchetypeGraph newGraph)
ArchetypeEdge	AbstractSparseEdge.getEqualEdge(ArchetypeGraph ag)
ArchetypeEdge	AbstractSparseEdge.getEquivalentEdge(ArchetypeGraph ag) Deprecated. As of version 1.4, renamed to getEqualEdge(ag).
ArchetypeEdge	AbstractSparseEdge.copy(ArchetypeGraph newGraph) Creates a copy of this edge in the specified graph nGraph, and copies this edge's user data to the new edge.

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

Methods in edu.uci.ics.jung.graph.predicates with parameters of type ArchetypeGraph

abstract boolean	GraphPredicate.evaluateGraph(ArchetypeGraph g)
boolean	ConnectedGraphPredicate.evaluateGraph(ArchetypeGraph graph) Returns true if arg0 is a connected Graph: that is, if there exists a path from each vertex to all other vertices (ignoring edge direction).
boolean	CliqueGraphPredicate.evaluateGraph(ArchetypeGraph g)

Constructors in edu.uci.ics.jung.graph.predicates with parameters of type ArchetypeGraph

NotInGraphVertexPredicate(ArchetypeGraph ag)

NotInGraphEdgePredicate(ArchetypeGraph ag)

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

Methods in edu.uci.ics.jung.random.generators that return ArchetypeGraph

ArchetypeGraph	WattsBetaSmallWorldGenerator.generateGraph() Generates a beta-network from a 1-lattice according to the parameters given.
ArchetypeGraph	SimpleRandomGenerator.generateGraph() Generated the graph by creating |V| vertics and then picking |E| random edges
ArchetypeGraph	Lattice2DGenerator.generateGraph()
ArchetypeGraph	Lattice1DGenerator.generateGraph()
ArchetypeGraph	KleinbergSmallWorldGenerator.generateGraph() Generates a random small world network according to the parameters given
ArchetypeGraph	GraphGenerator.generateGraph() Instructs the algorithm to generate the graph
ArchetypeGraph	EvolvingGraphGenerator.generateGraph() Returns a copy of the evolved graph in its current state
ArchetypeGraph	ErdosRenyiGenerator.generateGraph()
ArchetypeGraph	EppsteinPowerLawGenerator.generateGraph() Generates a graph whose degree distribution approximates a power-law.
ArchetypeGraph	BarabasiAlbertGenerator.generateGraph()

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

Methods in edu.uci.ics.jung.utils with parameters of type ArchetypeGraph

static SubsetManager	SubsetManager.getInstance(ArchetypeGraph g) Gets this graph's SubsetManager, creating it if necessary.
static java.util.Set	PredicateUtils.getVertices(ArchetypeGraph g, org.apache.commons.collections.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 java.util.Set	PredicateUtils.getEdges(ArchetypeGraph g, org.apache.commons.collections.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, org.apache.commons.collections.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, org.apache.commons.collections.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, org.apache.commons.collections.Predicate p) Removes the vertex subset based on p from g's SubsetManager.
static void	PredicateUtils.removeEdgeSubset(ArchetypeGraph g, org.apache.commons.collections.Predicate p) Removes the edge subset based on p from g's SubsetManager.
static boolean	PredicateUtils.enforcesEdgeConstraint(ArchetypeGraph g, org.apache.commons.collections.Predicate p) Returns true if p is an edge constraint of g, and false otherwise.
static boolean	PredicateUtils.satisfiesEdgeConstraint(ArchetypeGraph g, org.apache.commons.collections.Predicate p) Returns true if each edge in g satisfies p, and false otherwise.
static boolean	PredicateUtils.enforcesVertexConstraint(ArchetypeGraph g, org.apache.commons.collections.Predicate p) Returns true if p is an edge constraint of g, and false otherwise.
static boolean	PredicateUtils.satisfiesVertexConstraint(ArchetypeGraph g, org.apache.commons.collections.Predicate p) Returns true if each vertex in g satisfies p, and false otherwise.
static java.util.Set	GraphUtils.getEqualVertices(java.util.Set s, ArchetypeGraph g) Returns the set of vertices in g which are equal to the vertices in g.
static java.util.Set	GraphUtils.getEqualEdges(java.util.Set s, ArchetypeGraph g) Returns the set of edges in g which are equal to the edges in g.
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.