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

Packages that use Hypergraph

Package	Description
edu.uci.ics.jung.algorithms.path	Contains path classes for the layout packages.
edu.uci.ics.jung.algorithms.scoring	Contains scoring classes for the layout packages.
edu.uci.ics.jung.graph	Interfaces for the JUNG graph types, and some representative implementations.
org.girod.jgraphml.model	This package contains the graphml model classes.

Uses of Hypergraph in edu.uci.ics.jung.algorithms.path

Fields in edu.uci.ics.jung.algorithms.path declared as Hypergraph

Modifier and Type	Field and Description
protected Hypergraph<V,E>	DijkstraDistance.g

Methods in edu.uci.ics.jung.algorithms.path with parameters of type Hypergraph

Modifier and Type	Method and Description
static <V,E> org.apache.commons.collections15.Transformer<V,java.lang.Double>	DistanceStatistics.averageDistances(Hypergraph<V,E> g) For each vertex v in g, calculates the average shortest path length from v to all other vertices in g, ignoring edge weights.
static <V,E> org.apache.commons.collections15.Transformer<V,java.lang.Double>	DistanceStatistics.averageDistances(Hypergraph<V,E> graph, Distance<V> d) For each vertex v in graph, calculates the average shortest path length from v to all other vertices in graph using the metric specified by d, and returns the results in a Map from vertices to Double values.
static <V,E> double	DistanceStatistics.diameter(Hypergraph<V,E> g) Returns the diameter of g, ignoring edge weights.
static <V,E> double	DistanceStatistics.diameter(Hypergraph<V,E> g, Distance<V> d) Returns the diameter of g using the metric specified by d.
static <V,E> double	DistanceStatistics.diameter(Hypergraph<V,E> g, Distance<V> d, boolean use_max) Returns the diameter of g using the metric specified by d.
int	BFSDistanceLabeler.getDistance(Hypergraph<V,E> g, V v) Given a vertex, returns the shortest distance from any node in the root set to v
protected void	BFSDistanceLabeler.initialize(Hypergraph<V,E> g, java.util.Set<V> rootSet)
void	BFSDistanceLabeler.labelDistances(Hypergraph<V,E> graph, java.util.Set<V> rootSet) Computes the distances of all the node from the starting root nodes.
void	BFSDistanceLabeler.labelDistances(Hypergraph<V,E> graph, V root) Computes the distances of all the node from the specified root node.

Constructors in edu.uci.ics.jung.algorithms.path with parameters of type Hypergraph

Constructor and Description
DijkstraDistance(Hypergraph<V,E> g, org.apache.commons.collections15.Transformer<E,? extends java.lang.Number> nev) Creates an instance of DijkstraShortestPath for the specified graph and the specified method of extracting weights from edges, which caches results locally.
DijkstraDistance(Hypergraph<V,E> g, org.apache.commons.collections15.Transformer<E,? extends java.lang.Number> nev, boolean cached) Creates an instance of DijkstraShortestPath for the specified graph and the specified method of extracting weights from edges, which caches results locally if and only if cached is true.
UnweightedShortestPath(Hypergraph<V,E> g) Constructs and initializes algorithm

Uses of Hypergraph in edu.uci.ics.jung.algorithms.scoring

Fields in edu.uci.ics.jung.algorithms.scoring declared as Hypergraph

Modifier and Type	Field and Description
protected Hypergraph<V,E>	DistanceCentralityScorer.graph The graph on which the vertex scores are to be calculated.

Constructors in edu.uci.ics.jung.algorithms.scoring with parameters of type Hypergraph

Constructor and Description
ClosenessCentrality(Hypergraph<V,E> graph) Creates an instance which measures distance on the graph without edge weights.
ClosenessCentrality(Hypergraph<V,E> graph, Distance<V> distance) Creates an instance using the specified vertex/vertex distance metric.
ClosenessCentrality(Hypergraph<V,E> graph, org.apache.commons.collections15.Transformer<E,? extends java.lang.Number> edge_weights) Creates an instance which measures distance using the specified edge weights.
DistanceCentralityScorer(Hypergraph<V,E> graph, boolean averaging) Equivalent to this(graph, averaging, true, true).
DistanceCentralityScorer(Hypergraph<V,E> graph, boolean averaging, boolean ignore_missing, boolean ignore_self_distances) Creates an instance with the specified graph and averaging behavior whose vertex distances are calculated on the unweighted graph.
DistanceCentralityScorer(Hypergraph<V,E> graph, Distance<V> distance, boolean averaging) Equivalent to this(graph, distance, averaging, true, true).
DistanceCentralityScorer(Hypergraph<V,E> graph, Distance<V> distance, boolean averaging, boolean ignore_missing, boolean ignore_self_distances) Creates an instance with the specified graph, distance metric, and averaging behavior.
DistanceCentralityScorer(Hypergraph<V,E> graph, org.apache.commons.collections15.Transformer<E,? extends java.lang.Number> edge_weights, boolean averaging) Equivalent to this(graph, edge_weights, averaging, true, true).
DistanceCentralityScorer(Hypergraph<V,E> graph, org.apache.commons.collections15.Transformer<E,? extends java.lang.Number> edge_weights, boolean averaging, boolean ignore_missing, boolean ignore_self_distances) Creates an instance with the specified graph and averaging behavior whose vertex distances are calculated based on the specified edge weights.

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

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

Modifier and Type	Interface and Description
interface	DirectedGraph<V,E> A tagging interface for implementations of Graph that accept only directed edges.
interface	Forest<V,E> An interface for a graph which consists of a collection of rooted directed acyclic graphs.
interface	Graph<V,E> A graph consisting of a set of vertices of type V set and a set of edges of type E.
interface	Tree<V,E> A subtype of Graph which is a (directed, rooted) tree.
interface	UndirectedGraph<V,E> A tagging interface for extensions of Graph that accept only undirected edges.

Classes in edu.uci.ics.jung.graph that implement Hypergraph

Modifier and Type	Class and Description
class	AbstractGraph<V,E> Abstract implementation of the Graph interface.
class	AbstractTypedGraph<V,E> An abstract class for graphs whose edges all have the same EdgeType.
class	DelegateForest<V,E> An implementation of Forest that delegates to a specified DirectedGraph instance.
class	DelegateTree<V,E> An implementation of Tree that delegates to a specified instance of DirectedGraph.
class	DirectedOrderedSparseMultigraph<V,E> An implementation of DirectedGraph, suitable for sparse graphs, that orders its vertex and edge collections according to insertion time.
class	DirectedSparseGraph<V,E> An implementation of DirectedGraph suitable for sparse graphs.
class	DirectedSparseMultigraph<V,E> An implementation of DirectedGraph, suitable for sparse graphs, that permits parallel edges.
class	GraphDecorator<V,E> An implementation of Graph that delegates its method calls to a constructor-specified Graph instance.
class	ObservableGraph<V,E> A decorator class for graphs which generates events
class	OrderedKAryTree<V,E> An implementation of Tree in which each vertex has <= k children.
class	OrderedSparseMultigraph<V,E> An implementation of Graph that orders its vertex and edge collections according to insertion time, is suitable for sparse graphs, and permits directed, undirected, and parallel edges.
class	SetHypergraph<V,H> An implementation of Hypergraph that is suitable for sparse graphs and permits parallel edges.
class	SortedSparseMultigraph<V,E> An implementation of Graph that is suitable for sparse graphs, orders its vertex and edge collections according to either specified Comparator instances or the natural ordering of their elements, and permits directed, undirected, and parallel edges.
class	SparseGraph<V,E> An implementation of Graph that is suitable for sparse graphs and permits both directed and undirected edges.
class	SparseMultigraph<V,E> An implementation of Graph that is suitable for sparse graphs and permits directed, undirected, and parallel edges.
class	UndirectedOrderedSparseMultigraph<V,E> An implementation of UndirectedGraph that is suitable for sparse graphs, orders its vertex and edge collections according to insertion time, and permits parallel edges.
class	UndirectedSparseGraph<V,E> An implementation of UndirectedGraph that is suitable for sparse graphs.
class	UndirectedSparseMultigraph<V,E> An implementation of UndirectedGraph that is suitable for sparse graphs and permits parallel edges.

Methods in edu.uci.ics.jung.graph that return types with arguments of type Hypergraph

Modifier and Type	Method and Description
static <V,H> Factory<Hypergraph<V,H>>	SetHypergraph.getFactory() Returns a Factory which creates instances of this class.

Uses of Hypergraph in org.girod.jgraphml.model

Classes in org.girod.jgraphml.model that implement Hypergraph

Modifier and Type	Class and Description
class	AbstractGraphMLDiagram An abstract graphml diagram.
class	GraphMLDiagram A graphml diagram.