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

Packages that use ArchetypeEdge

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 ArchetypeEdge in edu.uci.ics.jung.algorithms.blockmodel

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

static interface

GraphCollapser.CollapsedEdge The CollapsedEdge interface represents a set of edges in some other graph.

Classes in edu.uci.ics.jung.algorithms.blockmodel that implement ArchetypeEdge

class	BipartiteGraphCollapser.CollapsedBipartiteEdge
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 ArchetypeEdge in edu.uci.ics.jung.graph

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

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 A Hyperedge is a part of a hypergraph that connects to zero or more Hypervertices.
interface	UndirectedEdge A tagging interface for implementations of Edge that do not impose an ordering on their incident vertices.

Methods in edu.uci.ics.jung.graph that return ArchetypeEdge

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.

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

boolean

ArchetypeVertex.isIncident(ArchetypeEdge e) Returns true if the specified edge e is incident to this vertex, and false otherwise.

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

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

java.lang.Number	NumberEdgeValue.getNumber(ArchetypeEdge e)
void	NumberEdgeValue.setNumber(ArchetypeEdge e, java.lang.Number n)

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

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

void	GraphListenerHandler.handleAdd(ArchetypeEdge e)
void	GraphListenerHandler.handleRemove(ArchetypeEdge e)

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

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

class	AbstractSparseEdge This class provides a skeletal implementation of the Edge interface to minimize the effort required to implement this interface.
class	BipartiteEdge A simple extension of the UndirectedSparseEdge, except with careful bounds checking.
class	DirectedSparseEdge An implementation of DirectedEdge that resides in a directed graph.
class	HyperedgeBPG A HyperEdge has zero or more HyperVertices attached to it; this implements that as part of an underlying HyperGraph.
class	UndirectedSparseEdge An implementation of UndirectedEdge that resides in an undirected graph.

Methods in edu.uci.ics.jung.graph.impl that return ArchetypeEdge

ArchetypeEdge	HypergraphBPG.getEdgeCorrespondingTo(BipartiteVertex vertex2)
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)
ArchetypeEdge	BipartiteEdge.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.

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

boolean	HypervertexBPG.isIncident(ArchetypeEdge e)
void	HypergraphBPG.removeEdge(ArchetypeEdge e)
boolean	AbstractSparseVertex.isIncident(ArchetypeEdge e)

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

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

boolean	UserDatumEdgePredicate.evaluateEdge(ArchetypeEdge e) Returns true if the datum stored by e with key value key (in the user data repository) is datum.
boolean	TreePredicate.evaluateEdge(ArchetypeEdge e) Any edges added to this graph must go to a vertex where
boolean	SimpleEdgePredicate.evaluateEdge(ArchetypeEdge ae) Returns true if ae is neither a self-loop nor parallel to an existing edge.
boolean	SelfLoopEdgePredicate.evaluateEdge(ArchetypeEdge e) Returns true if e is an Edge that connects a vertex to itself.
boolean	ReciprocatedDirectedEdgePredicate.evaluateEdge(ArchetypeEdge e)
boolean	ParallelEdgePredicate.evaluateEdge(ArchetypeEdge ae) Returns true if there exists an edge which is parallel to the specified edge.
boolean	NotInGraphEdgePredicate.evaluateEdge(ArchetypeEdge e) Returns true if this edge is not currently part of graph ag.
boolean	KPartiteEdgePredicate.evaluateEdge(ArchetypeEdge edge)
abstract boolean	EdgePredicate.evaluateEdge(ArchetypeEdge e)