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

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

Packages that use ArchetypeVertex
edu.uci.ics.jung.algorithms.blockmodel | Implementations of a notion of graph equivalence for blockmodeling, and a mechanism for collapsing blocks.
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.io | Provides a set of graph file format interpreters for loading graphs from disk.
edu.uci.ics.jung.utils | Provides a series of useful utility methods, and a number of custom helper classes designed specifically for this application.
edu.uci.ics.jung.visualization | Provides a visualization mechanism for drawing and rendering `Graph`s.
edu.uci.ics.jung.visualization.subLayout |
edu.uci.ics.jung.visualization.transform.shape |
samples.graph | Provides sample graph code that may be of interest.

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

Methods in edu.uci.ics.jung.algorithms.cluster with parameters of type ArchetypeVertex
`Collection` | `VoltageClusterer.getCommunity(ArchetypeVertex v)` Returns a community (cluster) centered around `v`.
`protected Collection` | `VoltageClusterer.cluster_internal(ArchetypeGraph g, ArchetypeVertex origin, int num_clusters)` Does the work of `getCommunity` and `cluster`.

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

Methods in edu.uci.ics.jung.algorithms.shortestpath with parameters of type ArchetypeVertex
`protected LinkedHashMap` | `DijkstraDistance.singleSourceShortestPath(ArchetypeVertex source, Set targets, int numDests)` Implements Dijkstra's single-source shortest-path algorithm for weighted graphs.
`protected DijkstraDistance.SourceData` | `DijkstraDistance.getSourceData(ArchetypeVertex source)`
`protected Set` | `DijkstraDistance.getIncidentEdges(ArchetypeVertex v)` Returns the set of edges incident to `v` that should be tested.
`Number` | `DijkstraDistance.getDistance(ArchetypeVertex source, ArchetypeVertex target)` Returns the length of a shortest path from the source to the target vertex, or null if the target is not reachable from the source.
`Map` | `DijkstraDistance.getDistanceMap(ArchetypeVertex source, Set targets)`
`Map` | `DijkstraDistance.getDistanceMap(ArchetypeVertex source)` Returns a `LinkedHashMap` which maps each vertex in the graph (including the `source` vertex) to its distance from the `source` vertex.
`LinkedHashMap` | `DijkstraDistance.getDistanceMap(ArchetypeVertex source, int numDests)` Returns a `LinkedHashMap` which maps each of the closest `numDist` vertices to the `source` vertex in the graph (including the `source` vertex) to its distance from the `source` vertex.
`void` | `DijkstraDistance.reset(ArchetypeVertex source)` Clears all stored distances for the specified source vertex `source`.
`void` | `DijkstraDistance.SourceData.update(ArchetypeVertex dest, ArchetypeEdge tentative_edge, double new_dist)`
`void` | `DijkstraDistance.SourceData.createRecord(ArchetypeVertex w, ArchetypeEdge e, double new_dist)`
`protected DijkstraDistance.SourceData` | `DijkstraShortestPath.getSourceData(ArchetypeVertex source)`
`void` | `DijkstraShortestPath.SourcePathData.update(ArchetypeVertex dest, ArchetypeEdge tentative_edge, double new_dist)`
`void` | `DijkstraShortestPath.SourcePathData.createRecord(ArchetypeVertex w, ArchetypeEdge e, double new_dist)`
`Number` | `Distance.getDistance(ArchetypeVertex source, ArchetypeVertex target)` Returns the distance from the `source` vertex to the `target` vertex.
`Map` | `Distance.getDistanceMap(ArchetypeVertex source)` Returns a `Map` which maps each vertex in the graph (including the `source` vertex) to its distance (represented as a Number) from `source`.
`Number` | `UnweightedShortestPath.getDistance(ArchetypeVertex source, ArchetypeVertex target)`
`Map` | `UnweightedShortestPath.getDistanceMap(ArchetypeVertex source)`

Constructors in edu.uci.ics.jung.algorithms.shortestpath with parameters of type ArchetypeVertex
`DijkstraDistance.SourceData(ArchetypeVertex source)`
`DijkstraShortestPath.SourcePathData(ArchetypeVertex source)`

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

Subinterfaces of ArchetypeVertex in edu.uci.ics.jung.graph
`interface` | `Hypervertex` An element of a Hypergraph that connects to zero or more Hyperedges.
`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` | `ArchetypeEdge.isIncident(ArchetypeVertex v)` Returns `true` if the specified vertex `v` is incident to this edge, and `false` otherwise.
`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.
`ArchetypeEdge` | `ArchetypeVertex.findEdge(ArchetypeVertex v)` Returns an edge that connects this vertex to `v`.
`Set` | `ArchetypeVertex.findEdgeSet(ArchetypeVertex v)` Returns the set of all edges that connect this vertex with the specified vertex `v`.

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
`Icon` | `ConstantVertexIconFunction.getIcon(ArchetypeVertex v)`
`String` | `ConstantVertexStringer.getLabel(ArchetypeVertex v)`
`Icon` | `DefaultVertexIconFunction.getIcon(ArchetypeVertex v)` Returns the `Icon` associated with `v`.
`String` | `GlobalStringLabeller.getLabel(ArchetypeVertex v)` Gets the String label associated with a particular Vertex.
`int` | `Indexer.getIndex(ArchetypeVertex v)` Gets the index assocated with this vertex.
`Number` | `MapNumberVertexValue.getNumber(ArchetypeVertex v)`
`void` | `MapNumberVertexValue.setNumber(ArchetypeVertex v, Number n)`
`Number` | `NumberVertexValue.getNumber(ArchetypeVertex v)`
`void` | `NumberVertexValue.setNumber(ArchetypeVertex v, Number n)`
`String` | `NumberVertexValueStringer.getLabel(ArchetypeVertex v)`
`Icon` | `PickableVertexIconFunction.getIcon(ArchetypeVertex v)` Returns the appropriate `Icon`, depending on picked state.
`String` | `StringLabeller.getLabel(ArchetypeVertex v)` Gets the String label associated with a particular Vertex.
`String` | `ToStringLabeller.getLabel(ArchetypeVertex v)` Retunrs v.toString()
`Number` | `UserDatumNumberVertexValue.getNumber(ArchetypeVertex v)`
`void` | `UserDatumNumberVertexValue.setNumber(ArchetypeVertex v, Number n)`
`Icon` | `VertexIconFunction.getIcon(ArchetypeVertex v)`
`String` | `VertexStringer.getLabel(ArchetypeVertex v)`

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` | `AbstractArchetypeVertex`
`class` | `AbstractHypervertex` This class provides a skeletal implementation of the `Hypervertex` interface to minimize the effort required to implement this interface.
`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` | `CollectionHypervertex`
`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` | `LeanSparseVertex` This fully functional class is provided as a different sort of way to think about the creation and use of Vertices, and a reminder that the user is always welcome to create their own vertices.
`class` | `ListHypervertex` An implementation of `Hypervertex` that stores its incident edges as a `List` internally.
`class` | `SetHypervertex` An implementation of `Hypervertex` that maintains independent `Set`s of incident edges and neighbors.
`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` | `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).
`ArchetypeVertex` | `AbstractHypervertex.copy(ArchetypeGraph g)`
`ArchetypeVertex` | `AbstractSparseVertex.copy(ArchetypeGraph newGraph)`
`ArchetypeVertex` | `BipartiteVertex.copy(ArchetypeGraph newGraph)` Specialized copy function for copy FROM BipartiteGraph TO BipartiteGraph
`ArchetypeVertex` | `HypergraphBPG.getVertexCorrespondingTo(BipartiteVertex vertex2)` 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)`

Methods in edu.uci.ics.jung.graph.impl with parameters of type ArchetypeVertex
`boolean` | `AbstractArchetypeEdge.isIncident(ArchetypeVertex v)`
`boolean` | `AbstractArchetypeVertex.isNeighborOf(ArchetypeVertex v)`
`ArchetypeEdge` | `AbstractArchetypeVertex.findEdge(ArchetypeVertex v)`
`Set` | `AbstractArchetypeVertex.findEdgeSet(ArchetypeVertex v)`
`boolean` | `AbstractSparseEdge.isIncident(ArchetypeVertex v)`
`ArchetypeEdge` | `AbstractSparseVertex.findEdge(ArchetypeVertex v)`
`Set` | `AbstractSparseVertex.findEdgeSet(ArchetypeVertex v)`
`boolean` | `HyperedgeBPG.isIncident(ArchetypeVertex v)` Deprecated.
`boolean` | `HypervertexBPG.isNeighborOf(ArchetypeVertex v)` Not a very efficient implementation
`ArchetypeEdge` | `HypervertexBPG.findEdge(ArchetypeVertex v)`
`Set` | `HypervertexBPG.findEdgeSet(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
`boolean` | `ContainsUserDataKeyVertexPredicate.evaluateVertex(ArchetypeVertex v)`
`boolean` | `IsolatedVertexPredicate.evaluateVertex(ArchetypeVertex v)` Returns `true` if the argument is a `Vertex` whose degree is 0.
`boolean` | `NotInGraphVertexPredicate.evaluateVertex(ArchetypeVertex av)` Returns `true` if this vertex is not currently a member of any graph.
`boolean` | `SinkVertexPredicate.evaluateVertex(ArchetypeVertex arg0)`
`boolean` | `SourceVertexPredicate.evaluateVertex(ArchetypeVertex arg0)`
`boolean` | `UserDatumVertexPredicate.evaluateVertex(ArchetypeVertex v)` Returns `true` if the datum stored by `v` with key value `key` (in the user data repository) is `datum`.
`abstract boolean` | `VertexPredicate.evaluateVertex(ArchetypeVertex v)`

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

Methods in edu.uci.ics.jung.io that return ArchetypeVertex
`protected ArchetypeVertex` | `GraphMLFileHandler.createVertex(Map attributeMap)`

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

Methods in edu.uci.ics.jung.utils that return ArchetypeVertex
`ArchetypeVertex` | `CopyVertexMapper.getMappedVertex(ArchetypeVertex v)`
`ArchetypeVertex` | `HashSettableVertexMapper.getMappedVertex(ArchetypeVertex v)`
`ArchetypeVertex` | `StringLabellerVertexMapper.getMappedVertex(ArchetypeVertex v)` see VertexMapper#getMappedVertex(edu.uci.ics.jung.graph.ArchetypeVertex)
`ArchetypeVertex` | `VertexMapper.getMappedVertex(ArchetypeVertex v)`

Methods in edu.uci.ics.jung.utils with parameters of type ArchetypeVertex
`ArchetypeVertex` | `CopyVertexMapper.getMappedVertex(ArchetypeVertex v)`
`void` | `HashSettableVertexMapper.map(ArchetypeVertex v1, ArchetypeVertex v2)`
`ArchetypeVertex` | `HashSettableVertexMapper.getMappedVertex(ArchetypeVertex v)`
`void` | `SettableVertexMapper.map(ArchetypeVertex v1, ArchetypeVertex v2)`
`ArchetypeVertex` | `StringLabellerVertexMapper.getMappedVertex(ArchetypeVertex v)` see VertexMapper#getMappedVertex(edu.uci.ics.jung.graph.ArchetypeVertex)
`ArchetypeVertex` | `VertexMapper.getMappedVertex(ArchetypeVertex v)`

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

Methods in edu.uci.ics.jung.visualization with parameters of type ArchetypeVertex
`Coordinates` | `AbstractLayout.getCoordinates(ArchetypeVertex v)` Returns the Coordinates object that stores the vertex' x and y location.
`Point2D` | `AbstractLayout.getLocation(ArchetypeVertex v)`
`protected boolean` | `AbstractRenderer.isPicked(ArchetypeVertex v)`
`void` | `DefaultSettableVertexLocationFunction.setLocation(ArchetypeVertex v, Point2D location)`
`Point2D` | `DefaultSettableVertexLocationFunction.getLocation(ArchetypeVertex v)`
`Point2D` | `FadingVertexLayout.getLocation(ArchetypeVertex v)` Deprecated.
`Point2D` | `Layout.getLocation(ArchetypeVertex v)`
`Point2D` | `LayoutDecorator.getLocation(ArchetypeVertex v)`
`boolean` | `MultiPickedState.pick(ArchetypeVertex v, boolean picked)`
`boolean` | `MultiPickedState.isPicked(ArchetypeVertex v)`
`void` | `PickEventListener.vertexPicked(ArchetypeVertex v)` Deprecated.
`void` | `PickEventListener.vertexUnpicked(ArchetypeVertex v)` Deprecated.
`boolean` | `PickedInfo.isPicked(ArchetypeVertex v)`
`boolean` | `PickedState.pick(ArchetypeVertex v, boolean b)` Marks `v` as "picked" if `b == true`, and unmarks `v` as picked if `b == false`.
`boolean` | `PickedState.isPicked(ArchetypeVertex v)` Returns `true` if `v` is currently "picked".
`boolean` | `PluggableRenderer.isPicked(ArchetypeVertex v)` Deprecated. Use an independent PickedInfo instead of this version, which relies on the Renderer to supply an instance.
`Point2D` | `RandomVertexLocationDecorator.getLocation(ArchetypeVertex v)`
`void` | `SettableVertexLocationFunction.setLocation(ArchetypeVertex v, Point2D location)`
`Point2D` | `VertexLocationFunction.getLocation(ArchetypeVertex v)`

Uses of ArchetypeVertex in edu.uci.ics.jung.visualization.subLayout

Methods in edu.uci.ics.jung.visualization.subLayout with parameters of type ArchetypeVertex
`Point2D` | `CircularSubLayout.getLocation(ArchetypeVertex v)`
`Point2D` | `SubLayout.getLocation(ArchetypeVertex v)`
`protected Point2D` | `SubLayoutDecorator.getLocationInSubLayout(ArchetypeVertex v)`
`Point2D` | `SubLayoutDecorator.getLocation(ArchetypeVertex v)`

Uses of ArchetypeVertex in edu.uci.ics.jung.visualization.transform.shape

Methods in edu.uci.ics.jung.visualization.transform.shape with parameters of type ArchetypeVertex
`boolean` | `PluggableRendererDecorator.isPicked(ArchetypeVertex v)`

Uses of ArchetypeVertex in samples.graph

Methods in samples.graph with parameters of type ArchetypeVertex
`String` | `VertexImageShaperDemo.VertexStringerImpl.getLabel(ArchetypeVertex v)`
`Icon` | `VertexImageShaperDemo.DemoVertexImageShapeFunction.getIcon(ArchetypeVertex v)`

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