|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Hypergraph | |
---|---|
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.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. |
Uses of Hypergraph in edu.uci.ics.jung.algorithms.filters |
---|
Methods in edu.uci.ics.jung.algorithms.filters with type parameters of type Hypergraph | ||
---|---|---|
static
|
FilterUtils.createAllInducedSubgraphs(Collection<? extends Collection<V>> vertex_collections,
G graph)
Creates the induced subgraphs of graph associated with each
element of vertex_collections . |
|
static
|
FilterUtils.createInducedSubgraph(Collection<V> vertices,
G graph)
Creates the induced subgraph from graph whose vertex set
is equal to vertices . |
Uses of Hypergraph in edu.uci.ics.jung.algorithms.scoring |
---|
Fields in edu.uci.ics.jung.algorithms.scoring declared as Hypergraph | |
---|---|
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 | |
---|---|
BarycenterScorer(Hypergraph<V,E> graph,
Distance<V> distance)
Creates an instance with the specified graph and distance metric. |
|
ClosenessCentrality(Hypergraph<V,E> graph,
Distance<V> distance)
Creates an instance using the specified vertex/vertex distance metric. |
|
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. |
Uses of Hypergraph in edu.uci.ics.jung.algorithms.shortestpath |
---|
Fields in edu.uci.ics.jung.algorithms.shortestpath declared as Hypergraph | |
---|---|
protected Hypergraph<V,E> |
DijkstraDistance.g
|
Constructors in edu.uci.ics.jung.algorithms.shortestpath with parameters of type Hypergraph | |
---|---|
DijkstraDistance(Hypergraph<V,E> g,
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,
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 . |
Uses of Hypergraph in edu.uci.ics.jung.algorithms.transformation |
---|
Methods in edu.uci.ics.jung.algorithms.transformation with parameters of type Hypergraph | ||
---|---|---|
static
|
FoldingTransformer.foldHypergraphEdges(Hypergraph<V,E> h,
Creates a Graph which is an edge-folded version of h , where
hyperedges are replaced by k-cliques in the output graph. |
|
static
|
FoldingTransformer.foldHypergraphEdges(Hypergraph<V,E> h,
Creates a Graph which is an edge-folded version of h , where
hyperedges are replaced by k-cliques in the output graph. |
|
Graph<E,Collection<V>> |
FoldingTransformer.foldHypergraphVertices(Hypergraph<V,E> h,
Creates a Graph which is a vertex-folded version of h , whose
vertices are the input's hyperedges and whose edges are induced by adjacent hyperedges
in the input. |
|
static
|
FoldingTransformer.foldHypergraphVertices(Hypergraph<V,E> h,
Creates a Graph which is a vertex-folded version of h , 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 | |
---|---|
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 |
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 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 | |
---|---|
class |
AbstractGraph<V,E>
Abstract implementation of the Graph interface. |
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. |
Uses of Hypergraph in edu.uci.ics.jung.io |
---|
Classes in edu.uci.ics.jung.io with type parameters of type Hypergraph | |
---|---|
class |
GraphMLReader<G extends Hypergraph<V,E>,V,E>
Reads in data from a GraphML-formatted file and generates graphs based on that data. |
Fields in edu.uci.ics.jung.io declared as Hypergraph | |
---|---|
protected G |
GraphMLReader.current_graph
|
Fields in edu.uci.ics.jung.io with type parameters of type Hypergraph | |
---|---|
protected Map<String,GraphMLMetadata<Hypergraph<V,E>>> |
GraphMLWriter.graph_data
|
Methods in edu.uci.ics.jung.io with parameters of type Hypergraph | |
---|---|
void |
GraphMLWriter.save(Hypergraph<V,E> graph,
Writer w)
|
protected void |
GraphMLWriter.writeEdgeData(Hypergraph<V,E> g,
Writer w)
|
protected void |
GraphMLWriter.writeVertexData(Hypergraph<V,E> graph,
BufferedWriter w)
|
Method parameters in edu.uci.ics.jung.io with type arguments of type Hypergraph | |
---|---|
void |
GraphMLWriter.setGraphData(Map<String,GraphMLMetadata<Hypergraph<V,E>>> graph_map)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |