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

Packages that use ArchetypeVertex
edu.uci.ics.jung.algorithms.blockmodel   
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   
 

Uses of ArchetypeVertex in edu.uci.ics.jung.algorithms.blockmodel
 

Subinterfaces of ArchetypeVertex in edu.uci.ics.jung.algorithms.blockmodel
static interface GraphCollapser.CollapsedVertex
          This interface represents a vertex that holds a set of objects in some other graph.
 

Classes in edu.uci.ics.jung.algorithms.blockmodel that implement ArchetypeVertex
 class BipartiteGraphCollapser.CollapsedBipartiteVertex
           
static class GraphCollapser.CollapsedSparseVertex
          A CollapsedSparseVertex extends CollapsedVertex.
 

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

Subinterfaces of ArchetypeVertex in edu.uci.ics.jung.graph
 interface Hypervertex
          created Dec 28, 2003
 interface Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Methods in edu.uci.ics.jung.graph that return ArchetypeVertex
 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.
 

Methods in edu.uci.ics.jung.graph with parameters of type ArchetypeVertex
 boolean ArchetypeVertex.isNeighborOf(ArchetypeVertex v)
          Returns true if the specified vertex v and this vertex are each incident to one or more of the same edges, and false otherwise.
 boolean ArchetypeEdge.isIncident(ArchetypeVertex v)
          Returns true if the specified vertex v is incident to this edge, and false otherwise.
 

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

Methods in edu.uci.ics.jung.graph.decorators that return ArchetypeVertex
 ArchetypeVertex Indexer.getVertex(int i)
          Gets the vertex associated with this index.
 

Methods in edu.uci.ics.jung.graph.decorators with parameters of type ArchetypeVertex
 int Indexer.getIndex(ArchetypeVertex v)
          Gets the index assocated with this vertex.
 

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

Methods in edu.uci.ics.jung.graph.event with parameters of type ArchetypeVertex
 void GraphListenerHandler.handleAdd(ArchetypeVertex v)
           
 void GraphListenerHandler.handleRemove(ArchetypeVertex v)
           
 

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

Classes in edu.uci.ics.jung.graph.impl that implement ArchetypeVertex
 class AbstractSparseVertex
          This class provides a skeletal implementation of the Vertex interface to minimize the effort required to implement this interface.
 class BipartiteVertex
          created Dec 28, 2003
 class DirectedSparseVertex
          A vertex class that supports directed edges (but not undirected edges) and allows parallel edges.
 class HypervertexBPG
          A Hypervertex has zero or more hyperEdges attached to it, and is a member of a Hypergraph.
 class SimpleDirectedSparseVertex
          An implementation of Vertex that resides in a directed graph; none of its adjoining edges may be parallel.
 class SimpleSparseVertex
          An implementation of Vertex that resides in a sparse graph which may contain both directed and undirected edges.
 class SimpleUndirectedSparseVertex
          An implementation of Vertex that resides in a undirected graph; none of its adjoining edges may be parallel.
 class SparseVertex
          An implementation of Vertex that resides in a sparse graph which may contain directed and/or undirected edges, as well as parallel edges.
 class UndirectedSparseVertex
          A vertex class for instances of UndirectedGraph that may contain parallel edges.
 

Methods in edu.uci.ics.jung.graph.impl that return ArchetypeVertex
 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)
           
 ArchetypeVertex HypergraphBPG.getVertexCorrespondingTo(BipartiteVertex vertex2)
           
 ArchetypeVertex BipartiteVertex.copy(ArchetypeGraph newGraph)
          Specialized copy function for copy FROM BipartiteGraph TO BipartiteGraph
 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)
           
 

Methods in edu.uci.ics.jung.graph.impl with parameters of type ArchetypeVertex
 boolean HypervertexBPG.isNeighborOf(ArchetypeVertex v)
          Not a very efficient implementation
 void HypergraphBPG.removeVertex(ArchetypeVertex v)
           
 boolean HyperedgeBPG.isIncident(ArchetypeVertex v)
           
 boolean AbstractSparseVertex.isNeighborOf(ArchetypeVertex v)
           
 boolean AbstractSparseEdge.isIncident(ArchetypeVertex v)
           
 

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

Methods in edu.uci.ics.jung.graph.predicates with parameters of type ArchetypeVertex
abstract  boolean VertexPredicate.evaluateVertex(ArchetypeVertex v)
           
 boolean UserDatumVertexPredicate.evaluateVertex(ArchetypeVertex v)
          Returns true if the datum stored by v with key value key (in the user data repository) is datum.
 boolean NotInGraphVertexPredicate.evaluateVertex(ArchetypeVertex av)
          Returns true if this vertex is not currently part of graph ag.
 boolean IsolatedVertexPredicate.evaluateVertex(ArchetypeVertex v)
          Returns true if the argument is a Vertex whose degree is 0.