Uses of Interface
edu.uci.ics.jung.graph.Hypergraph
-
Packages that use Hypergraph Package Description edu.uci.ics.jung.algorithms.filters Filtering mechanisms that produce subgraphs of an original graph.edu.uci.ics.jung.algorithms.scoring Mechanisms for assigning values (denoting significance, influence, centrality, etc.) to graph elements based on topological properties.edu.uci.ics.jung.algorithms.scoring.util Utility functions for assigning scores to graph elements.edu.uci.ics.jung.algorithms.shortestpath Provides interfaces and classes for calculating (geodesic) distances and shortest paths.edu.uci.ics.jung.algorithms.transformation Mechanisms for graph transformation.edu.uci.ics.jung.graph Interfaces for the JUNG graph types, and some representative implementations.edu.uci.ics.jung.io Interfaces and classes for reading and writing graphs in various (file) formats.edu.uci.ics.jung.io.graphml edu.uci.ics.jung.io.graphml.parser edu.uci.ics.jung.visualization.spatial -
-
Uses of Hypergraph in edu.uci.ics.jung.algorithms.filters
Methods in edu.uci.ics.jung.algorithms.filters with type parameters of type Hypergraph Modifier and Type Method Description static <V,E,G extends Hypergraph<V,E>>
java.util.Collection<G>FilterUtils. createAllInducedSubgraphs(java.util.Collection<? extends java.util.Collection<V>> vertex_collections, G graph)
Creates the induced subgraphs ofgraph
associated with each element ofvertex_collections
.static <V,E,G extends Hypergraph<V,E>>
GFilterUtils. createInducedSubgraph(java.util.Collection<V> vertices, G graph)
Creates the induced subgraph fromgraph
whose vertex set is equal tovertices
. -
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 Description protected Hypergraph<V,E>
AbstractIterativeScorer. graph
The graph on which the calculations are to be made.protected Hypergraph<V,?>
DegreeScorer. graph
The graph for which scores are to be generated.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 Description AbstractIterativeScorer(Hypergraph<V,E> g)
Creates an instance for the specified graphg
.AbstractIterativeScorer(Hypergraph<V,E> g, com.google.common.base.Function<? super E,? extends java.lang.Number> edge_weights)
Creates an instance for the specified graph and edge weights.AbstractIterativeScorerWithPriors(Hypergraph<V,E> g, com.google.common.base.Function<? super E,? extends java.lang.Number> edge_weights, com.google.common.base.Function<? super V,? extends S> vertex_priors, double alpha)
Creates an instance for the specified graph, edge weights, vertex priors, and jump probability.AbstractIterativeScorerWithPriors(Hypergraph<V,E> g, com.google.common.base.Function<V,? extends S> vertex_priors, double alpha)
Creates an instance for the specified graph, vertex priors, and jump probability, with edge weights specified by the subclass.BarycenterScorer(Hypergraph<V,E> graph)
Creates an instance with the specified graph.BarycenterScorer(Hypergraph<V,E> graph, com.google.common.base.Function<E,? extends java.lang.Number> edge_weights)
Creates an instance with the specified graph and edge weights.BarycenterScorer(Hypergraph<V,E> graph, Distance<V> distance)
Creates an instance with the specified graph and distance metric.ClosenessCentrality(Hypergraph<V,E> graph)
Creates an instance which measures distance on the graph without edge weights.ClosenessCentrality(Hypergraph<V,E> graph, com.google.common.base.Function<E,? extends java.lang.Number> edge_weights)
Creates an instance which measures distance using the specified edge weights.ClosenessCentrality(Hypergraph<V,E> graph, Distance<V> distance)
Creates an instance using the specified vertex/vertex distance metric.DegreeScorer(Hypergraph<V,?> graph)
Creates an instance for the specified graph.DistanceCentralityScorer(Hypergraph<V,E> graph, boolean averaging)
Equivalent tothis(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, com.google.common.base.Function<E,? extends java.lang.Number> edge_weights, boolean averaging)
Equivalent tothis(graph, edge_weights, averaging, true, true)
.DistanceCentralityScorer(Hypergraph<V,E> graph, com.google.common.base.Function<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.DistanceCentralityScorer(Hypergraph<V,E> graph, Distance<V> distance, boolean averaging)
Equivalent tothis(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.EigenvectorCentrality(Hypergraph<V,E> graph)
Creates an instance with the specified graph and default edge weights.EigenvectorCentrality(Hypergraph<V,E> graph, com.google.common.base.Function<E,? extends java.lang.Number> edge_weights)
Creates an instance with the specified graph and edge weights.HITSWithPriors(Hypergraph<V,E> g, com.google.common.base.Function<E,? extends java.lang.Number> edge_weights, com.google.common.base.Function<V,HITS.Scores> vertex_priors, double alpha)
Creates an instance for the specified graph, edge weights, vertex prior probabilities, and random jump probability (alpha).HITSWithPriors(Hypergraph<V,E> g, com.google.common.base.Function<V,HITS.Scores> vertex_priors, double alpha)
Creates an instance for the specified graph, vertex priors, and random jump probability (alpha).KStepMarkov(Hypergraph<V,E> graph, int steps)
Creates an instance based on the specified graph and number of steps to take.KStepMarkov(Hypergraph<V,E> graph, com.google.common.base.Function<E,? extends java.lang.Number> edge_weights, com.google.common.base.Function<V,java.lang.Double> vertex_priors, int steps)
Creates an instance based on the specified graph, edge weights, vertex priors (initial scores), and number of steps to take.KStepMarkov(Hypergraph<V,E> graph, com.google.common.base.Function<V,java.lang.Double> vertex_priors, int steps)
Creates an instance based on the specified graph, vertex priors (initial scores), and number of steps to take.PageRank(Hypergraph<V,E> graph, double alpha)
Creates an instance for the specified graph and random jump probability; the probability of following any outgoing edge from a given vertex is the same.PageRank(Hypergraph<V,E> graph, com.google.common.base.Function<E,? extends java.lang.Number> edge_weight, double alpha)
Creates an instance for the specified graph, edge weights, and random jump probability.PageRankWithPriors(Hypergraph<V,E> graph, com.google.common.base.Function<E,? extends java.lang.Number> edge_weights, com.google.common.base.Function<V,java.lang.Double> vertex_priors, double alpha)
Creates an instance with the specified graph, edge weights, vertex priors, and 'random jump' probability (alpha).PageRankWithPriors(Hypergraph<V,E> graph, com.google.common.base.Function<V,java.lang.Double> vertex_priors, double alpha)
Creates an instance with the specified graph, vertex priors, and 'random jump' probability (alpha).VoltageScorer(Hypergraph<V,E> g, com.google.common.base.Function<? super E,? extends java.lang.Number> edge_weights, java.util.Collection<V> sources, java.util.Collection<V> sinks)
Creates an instance with the specified graph, edge weights, source vertices (each of whose 'voltages' are tied to 1), and sinks.VoltageScorer(Hypergraph<V,E> g, com.google.common.base.Function<? super E,? extends java.lang.Number> edge_weights, java.util.Map<V,? extends java.lang.Number> source_voltages, java.util.Collection<V> sinks)
Creates an instance with the specified graph, edge weights, source voltages, and sinks.VoltageScorer(Hypergraph<V,E> g, com.google.common.base.Function<? super E,? extends java.lang.Number> edge_weights, V source, V sink)
Creates an instance with the specified graph, edge weights, source, and sink.VoltageScorer(Hypergraph<V,E> g, java.util.Collection<V> sources, java.util.Collection<V> sinks)
Creates an instance with the specified graph, source vertices (each of whose 'voltages' are tied to 1), and sinks.VoltageScorer(Hypergraph<V,E> g, java.util.Map<V,? extends java.lang.Number> source_voltages, java.util.Collection<V> sinks)
Creates an instance with the specified graph, source voltages, and sinks.VoltageScorer(Hypergraph<V,E> g, V source, V sink)
Creates an instance with the specified graph, edge weights, source, and sink. -
Uses of Hypergraph in edu.uci.ics.jung.algorithms.scoring.util
Constructors in edu.uci.ics.jung.algorithms.scoring.util with parameters of type Hypergraph Constructor Description UniformDegreeWeight(Hypergraph<V,E> graph)
-
Uses of Hypergraph in edu.uci.ics.jung.algorithms.shortestpath
Fields in edu.uci.ics.jung.algorithms.shortestpath declared as Hypergraph Modifier and Type Field Description protected Hypergraph<V,E>
DijkstraDistance. g
Methods in edu.uci.ics.jung.algorithms.shortestpath with parameters of type Hypergraph Modifier and Type Method Description static <V,E>
com.google.common.base.Function<V,java.lang.Double>DistanceStatistics. averageDistances(Hypergraph<V,E> g)
For each vertexv
ing
, calculates the average shortest path length fromv
to all other vertices ing
, ignoring edge weights.static <V,E>
com.google.common.base.Function<V,java.lang.Double>DistanceStatistics. averageDistances(Hypergraph<V,E> graph, Distance<V> d)
For each vertexv
ingraph
, calculates the average shortest path length fromv
to all other vertices ingraph
using the metric specified byd
, and returns the results in aMap
from vertices toDouble
values.static <V,E>
doubleDistanceStatistics. diameter(Hypergraph<V,E> g)
Returns the diameter ofg
, ignoring edge weights.static <V,E>
doubleDistanceStatistics. diameter(Hypergraph<V,E> g, Distance<V> d)
Returns the diameter ofg
using the metric specified byd
.static <V,E>
doubleDistanceStatistics. diameter(Hypergraph<V,E> g, Distance<V> d, boolean use_max)
Returns the diameter ofg
using the metric specified byd
.int
BFSDistanceLabeler. getDistance(Hypergraph<V,E> g, V v)
Given a vertex, returns the shortest distance from any node in the root set to vprotected 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.shortestpath with parameters of type Hypergraph Constructor Description DijkstraDistance(Hypergraph<V,E> g, com.google.common.base.Function<? super E,? extends java.lang.Number> nev)
Creates an instance ofDijkstraShortestPath
for the specified graph and the specified method of extracting weights from edges, which caches results locally.DijkstraDistance(Hypergraph<V,E> g, com.google.common.base.Function<? super E,? extends java.lang.Number> nev, boolean cached)
Creates an instance ofDijkstraShortestPath
for the specified graph and the specified method of extracting weights from edges, which caches results locally if and only ifcached
istrue
.UnweightedShortestPath(Hypergraph<V,E> g)
Constructs and initializes algorithm -
Uses of Hypergraph in edu.uci.ics.jung.algorithms.transformation
Methods in edu.uci.ics.jung.algorithms.transformation with parameters of type Hypergraph Modifier and Type Method Description static <V,E>
Graph<V,E>FoldingTransformer. foldHypergraphEdges(Hypergraph<V,E> h, com.google.common.base.Supplier<Graph<V,E>> graph_factory, com.google.common.base.Supplier<E> edge_factory)
Creates aGraph
which is an edge-folded version ofh
, where hyperedges are replaced by k-cliques in the output graph.static <V,E>
Graph<V,java.util.Collection<E>>FoldingTransformer. foldHypergraphEdges(Hypergraph<V,E> h, com.google.common.base.Supplier<Graph<V,java.util.Collection<E>>> graph_factory)
Creates aGraph
which is an edge-folded version ofh
, where hyperedges are replaced by k-cliques in the output graph.static <V,E,F>
Graph<E,F>FoldingTransformer. foldHypergraphVertices(Hypergraph<V,E> h, com.google.common.base.Supplier<Graph<E,F>> graph_factory, com.google.common.base.Supplier<F> edge_factory)
Creates aGraph
which is a vertex-folded version ofh
, whose vertices are the input's hyperedges and whose edges are induced by adjacent hyperedges in the input.Graph<E,java.util.Collection<V>>
FoldingTransformer. foldHypergraphVertices(Hypergraph<V,E> h, com.google.common.base.Supplier<Graph<E,java.util.Collection<V>>> graph_factory)
Creates aGraph
which is a vertex-folded version ofh
, whose vertices are the input's hyperedges and whose edges are induced by adjacent hyperedges in the input. -
Uses of Hypergraph in edu.uci.ics.jung.graph
Subinterfaces of Hypergraph in edu.uci.ics.jung.graph Modifier and Type Interface Description interface
DirectedGraph<V,E>
A tagging interface for implementations ofGraph
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 typeV
set and a set of edges of typeE
.interface
KPartiteGraph<V,E>
An interface for graphs whose vertices are each members of one of 2 or more disjoint sets (partitions), and whose edges connect only vertices in distinct partitions.interface
Tree<V,E>
A subtype ofGraph
which is a (directed, rooted) tree.interface
UndirectedGraph<V,E>
A tagging interface for extensions ofGraph
that accept only undirected edges.Classes in edu.uci.ics.jung.graph that implement Hypergraph Modifier and Type Class Description class
AbstractGraph<V,E>
Abstract implementation of theGraph
interface.class
AbstractTypedGraph<V,E>
An abstract class for graphs whose edges all have the sameEdgeType
.class
DelegateForest<V,E>
An implementation ofForest
that delegates to a specifiedDirectedGraph
instance.class
DelegateTree<V,E>
An implementation ofTree
that delegates to a specified instance ofDirectedGraph
.class
DirectedOrderedSparseMultigraph<V,E>
An implementation ofDirectedGraph
, suitable for sparse graphs, that orders its vertex and edge collections according to insertion time.class
DirectedSparseGraph<V,E>
An implementation ofDirectedGraph
suitable for sparse graphs.class
DirectedSparseMultigraph<V,E>
An implementation ofDirectedGraph
, suitable for sparse graphs, that permits parallel edges.class
GraphDecorator<V,E>
An implementation ofGraph
that delegates its method calls to a constructor-specifiedGraph
instance.class
ObservableGraph<V,E>
A decorator class for graphs which generates eventsclass
OrderedKAryTree<V,E>
An implementation ofTree
in which each vertex has ≤ k children.class
OrderedSparseMultigraph<V,E>
An implementation ofGraph
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 ofHypergraph
that is suitable for sparse graphs and permits parallel edges.class
SortedSparseMultigraph<V,E>
An implementation ofGraph
that is suitable for sparse graphs, orders its vertex and edge collections according to either specifiedComparator
instances or the natural ordering of their elements, and permits directed, undirected, and parallel edges.class
SparseGraph<V,E>
An implementation ofGraph
that is suitable for sparse graphs and permits both directed and undirected edges.class
SparseMultigraph<V,E>
An implementation ofGraph
that is suitable for sparse graphs and permits directed, undirected, and parallel edges.class
UndirectedOrderedSparseMultigraph<V,E>
An implementation ofUndirectedGraph
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 ofUndirectedGraph
that is suitable for sparse graphs.class
UndirectedSparseMultigraph<V,E>
An implementation ofUndirectedGraph
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 Description static <V,H>
com.google.common.base.Supplier<Hypergraph<V,H>>SetHypergraph. getFactory()
Returns aFactory
which creates instances of this class. -
Uses of Hypergraph in edu.uci.ics.jung.io
Classes in edu.uci.ics.jung.io with type parameters of type Hypergraph Modifier and Type Class Description class
GraphMLReader<G extends Hypergraph<V,E>,V,E>
Reads in data from a GraphML-formatted file and generates graphs based on that data.interface
GraphReader<G extends Hypergraph<V,E>,V,E>
Interface for a reader of graph objectsFields in edu.uci.ics.jung.io declared as Hypergraph Modifier and Type Field Description protected G
GraphMLReader. current_graph
Fields in edu.uci.ics.jung.io with type parameters of type Hypergraph Modifier and Type Field Description protected java.util.Map<java.lang.String,GraphMLMetadata<Hypergraph<V,E>>>
GraphMLWriter. graph_data
protected com.google.common.base.Function<? super Hypergraph<V,E>,java.lang.String>
GraphMLWriter. graph_desc
Methods in edu.uci.ics.jung.io with parameters of type Hypergraph Modifier and Type Method Description void
GraphMLWriter. save(Hypergraph<V,E> graph, java.io.Writer w)
Writesgraph
out usingw
.protected void
GraphMLWriter. writeEdgeData(Hypergraph<V,E> g, java.io.Writer w)
protected void
GraphMLWriter. writeVertexData(Hypergraph<V,E> graph, java.io.BufferedWriter w)
Method parameters in edu.uci.ics.jung.io with type arguments of type Hypergraph Modifier and Type Method Description void
GraphMLWriter. addGraphData(java.lang.String id, java.lang.String description, java.lang.String default_value, com.google.common.base.Function<Hypergraph<V,E>,java.lang.String> graph_transformer)
Adds a new graph data specification.void
GraphMLWriter. setGraphData(java.util.Map<java.lang.String,GraphMLMetadata<Hypergraph<V,E>>> graph_map)
Provides a map from data type name to graph data.void
GraphMLWriter. setGraphDescriptions(com.google.common.base.Function<Hypergraph<V,E>,java.lang.String> graph_desc)
Provides graph descriptions. -
Uses of Hypergraph in edu.uci.ics.jung.io.graphml
Classes in edu.uci.ics.jung.io.graphml with type parameters of type Hypergraph Modifier and Type Class Description class
GraphMLReader2<G extends Hypergraph<V,E>,V,E>
Reads in data from a GraphML-formatted file and generates graphs based on that data. -
Uses of Hypergraph in edu.uci.ics.jung.io.graphml.parser
Classes in edu.uci.ics.jung.io.graphml.parser with type parameters of type Hypergraph Modifier and Type Class Description class
AbstractElementParser<G extends Hypergraph<V,E>,V,E>
Base class for element parsers - provides some minimal functionality.class
DataElementParser<G extends Hypergraph<V,E>,V,E>
Parses the data element.class
EdgeElementParser<G extends Hypergraph<V,E>,V,E>
Parses an edge element.class
ElementParserRegistry<G extends Hypergraph<V,E>,V,E>
Registry for all element parsers.class
EndpointElementParser<G extends Hypergraph<V,E>,V,E>
Parses endpoint elements.class
GraphElementParser<G extends Hypergraph<V,E>,V,E>
Parses graph elements.class
HyperEdgeElementParser<G extends Hypergraph<V,E>,V,E>
Parses hyper edge elements.class
KeyElementParser<G extends Hypergraph<V,E>,V,E>
Parses key elements.class
NodeElementParser<G extends Hypergraph<V,E>,V,E>
Parses node elements.class
ParserContext<G extends Hypergraph<V,E>,V,E>
Provides resources related to the current parsing context.class
PortElementParser<G extends Hypergraph<V,E>,V,E>
Parses port elements.class
StringElementParser<G extends Hypergraph<V,E>,V,E>
Parses an element that just contains text. -
Uses of Hypergraph in edu.uci.ics.jung.visualization.spatial
Classes in edu.uci.ics.jung.visualization.spatial that implement Hypergraph Modifier and Type Class Description class
AggregateGraph<V,E>
class
FastRenderingGraph<V,E>
maintains caches of vertices and edges that will be the subset of the delegate graph's elements that are contained in some Rectangle.
-