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

Packages that use Element

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.importance	Provides a set of algorithms for computing the importance of each node (or edge) in a graph relative to all others (or, for the algorithms that inherit from RelativeAuthorityRanker, relative to a specified subset of elements).
edu.uci.ics.jung.algorithms.transformation
edu.uci.ics.jung.graph	Specifies the interfaces for and capabilities of the JUNG vertex, edge, and graph classes.
edu.uci.ics.jung.graph.event
edu.uci.ics.jung.graph.impl	Implementations of the JUNG vertex, edge, and graph interfaces.
samples.preview_new_graphdraw.event
scratch.danyel.lazy

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

Subinterfaces of Element in edu.uci.ics.jung.algorithms.blockmodel

static interface	GraphCollapser.CollapsedEdge The CollapsedEdge interface represents a set of edges in some other graph.
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 Element

class	BipartiteGraphCollapser.CollapsedBipartiteEdge
class	BipartiteGraphCollapser.CollapsedBipartiteVertex
static class	GraphCollapser.CollapsedSparseVertex A CollapsedSparseVertex extends CollapsedVertex.
static class	GraphCollapser.DirectedCollapsedEdge This class represents a Collapsed Directed edge, and extends DirectedSparseEdge.
static class	GraphCollapser.UndirectedCollapsedEdge This class represents a Collapsed Undirected edge, and extends UndirectedSparseEdge.

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

Methods in edu.uci.ics.jung.algorithms.cluster with parameters of type Element

protected void	ClusterSet.checkLegality(Element e)
Set	ClusterSet.getClusters(Element element) Given a vertex (or edge), retrieves the clusters which that vertex (or edge) belongs to if any

Uses of Element in edu.uci.ics.jung.algorithms.importance

Methods in edu.uci.ics.jung.algorithms.importance with parameters of type Element

protected double	KStepMarkov.getCurrentRankScore(Element v)
protected double	HITS.getPreviousAuthorityScore(Element v)
protected double	HITSWithPriors.getPreviousAuthorityScore(Element v)
protected double	HITS.getPreviousHubScore(Element v)
protected double	HITSWithPriors.getPreviousHubScore(Element v)
double	AbstractRanker.getRankScore(Element e) Given an edge or node, returns the corresponding rank score.
double	HITS.getRankScore(Element v) Given a node, returns the corresponding rank score.
double	HITSWithPriors.getRankScore(Element v) Given a node, returns the corresponding rank score.
double	MarkovCentrality.getRankScore(Element vert)
protected double	HITS.getRankScore(Element v, String key) Given a node and a key, returns the corresponding rank score.
protected double	HITSWithPriors.getRankScore(Element v, String key) Given a node and a key, returns the corresponding rank score.
protected void	KStepMarkov.incrementRankScore(Element v, double rankValue)
protected void	WeightedNIPaths.incrementRankScore(Element v, double rankValue)
protected void	AbstractRanker.onFinalize(Element e)
protected void	KStepMarkov.onFinalize(Element udc)
protected void	WeightedNIPaths.onFinalize(Element udc)
protected void	KStepMarkov.setCurrentRankScore(Element v, double rankValue)
protected void	AbstractRanker.setRankScore(Element e, double rankValue)
protected void	HITS.setRankScore(Element v, double rankValue)
protected void	HITSWithPriors.setRankScore(Element v, double rankValue)
protected void	MarkovCentrality.setRankScore(Element v, double rankValue)
protected void	HITS.setRankScore(Element v, double rankValue, String key)
protected void	HITSWithPriors.setRankScore(Element v, double rankValue, String key)

Uses of Element in edu.uci.ics.jung.algorithms.transformation

Methods in edu.uci.ics.jung.algorithms.transformation with parameters of type Element

protected void

FoldingTransformer.addEdge(Graph newGraph, Vertex firstEnd, Element intermediate, Vertex secondEnd, NumberEdgeValue nev) Creates a new edge from firstEnd to secondEnd in newGraph.

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

Subinterfaces of Element in edu.uci.ics.jung.graph

interface	ArchetypeEdge A interface for edge implementations in generalized graphs.
interface	ArchetypeVertex A interface for vertex implementations in generalized graphs.
interface	DirectedEdge A type of Edge which imposes an ordering on its incident vertices.
interface	Edge A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
interface	Hyperedge An element of a Hypergraph that connects to zero or more Hypervertices.
interface	Hypervertex An element of a Hypergraph that connects to zero or more Hyperedges.
interface	UndirectedEdge A tagging interface for implementations of Edge that do not impose an ordering on their incident vertices.
interface	Vertex A specific type of ArchetypeVertex that can be connected by instances of Edge.

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

Methods in edu.uci.ics.jung.graph.event that return Element

Element

GraphEvent.getGraphElement()

Constructors in edu.uci.ics.jung.graph.event with parameters of type Element

GraphEvent(ArchetypeGraph g, Element graphElement)

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

Classes in edu.uci.ics.jung.graph.impl that implement Element

class	AbstractArchetypeEdge
class	AbstractArchetypeVertex
class	AbstractElement
class	AbstractHyperedge This class provides a skeletal implementation of the Hyperedge interface to minimize the effort required to implement this interface.
class	AbstractHypervertex This class provides a skeletal implementation of the Hypervertex interface to minimize the effort required to implement this interface.
class	AbstractSparseEdge This class provides a skeletal implementation of the Edge 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	BipartiteEdge A simple extension of the UndirectedSparseEdge, except with careful bounds checking.
class	BipartiteVertex created Dec 28, 2003
class	CollectionHyperedge An implementation of Hyperedge that stores its collection of incident vertices internally as a Collection.
class	CollectionHypervertex
class	DirectedSparseEdge An implementation of DirectedEdge that resides in a directed graph.
class	DirectedSparseVertex A vertex class that supports directed edges (but not undirected edges) and allows parallel edges.
class	HyperedgeBPG Deprecated. As of version 1.7, replaced by native implementations of Hyperedge.
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	ListHyperedge An implementation of Hyperedge that stores its list of incident vertices internally as a List.
class	ListHypervertex An implementation of Hypervertex that stores its incident edges as a List internally.
class	SetHyperedge An implementation of Hyperedge that stores its collection of incident vertices internally as a Set.
class	SetHypervertex An implementation of Hypervertex that maintains independent Sets 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	UndirectedSparseEdge An implementation of UndirectedEdge that resides in an undirected graph.
class	UndirectedSparseVertex A vertex class for instances of UndirectedGraph that may contain parallel edges.

Uses of Element in samples.preview_new_graphdraw.event

Fields in samples.preview_new_graphdraw.event declared as Element

protected Element

ClickEvent.graphObject

Methods in samples.preview_new_graphdraw.event that return Element

Element

ClickEvent.getGraphObject()

Constructors in samples.preview_new_graphdraw.event with parameters of type Element

ClickEvent(Object src, Element udc, double dist, MouseEvent e)

Uses of Element in scratch.danyel.lazy

Classes in scratch.danyel.lazy that implement Element

class

LazySparseVertex