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 |
Modifier and Type | Method and Description |
---|---|
static <V,E,G extends Hypergraph<V,E>> |
FilterUtils.createAllInducedSubgraphs(Collection<? extends Collection<V>> vertex_collections,
G graph)
Creates the induced subgraphs of
graph associated with each
element of vertex_collections . |
static <V,E,G extends Hypergraph<V,E>> |
FilterUtils.createInducedSubgraph(Collection<V> vertices,
G graph)
Creates the induced subgraph from
graph whose vertex set
is equal to vertices . |
Modifier and Type | Field and Description |
---|---|
protected Hypergraph<V,E> |
DistanceCentralityScorer.graph
The graph on which the vertex scores are to be calculated.
|
protected Hypergraph<V,?> |
DegreeScorer.graph
The graph for which scores are to be generated.
|
protected Hypergraph<V,E> |
AbstractIterativeScorer.graph
The graph on which the calculations are to be made.
|
Constructor and Description |
---|
AbstractIterativeScorer(Hypergraph<V,E> g)
Creates an instance for the specified graph
g . |
AbstractIterativeScorer(Hypergraph<V,E> g,
com.google.common.base.Function<? super E,? extends 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 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,
Distance<V> distance)
Creates an instance with the specified graph and distance metric.
|
BarycenterScorer(Hypergraph<V,E> graph,
com.google.common.base.Function<E,? extends Number> edge_weights)
Creates an instance with the specified graph and edge weights.
|
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,
com.google.common.base.Function<E,? extends Number> edge_weights)
Creates an instance which measures distance using the specified edge weights.
|
DegreeScorer(Hypergraph<V,?> graph)
Creates an instance for the specified graph.
|
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,
com.google.common.base.Function<E,? extends Number> edge_weights,
boolean averaging)
Equivalent to
this(graph, edge_weights, averaging, true, true) . |
DistanceCentralityScorer(Hypergraph<V,E> graph,
com.google.common.base.Function<E,? extends 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.
|
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 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 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,
com.google.common.base.Function<E,? extends Number> edge_weights,
com.google.common.base.Function<V,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,Double> vertex_priors,
int steps)
Creates an instance based on the specified graph, vertex
priors (initial scores), and number of steps to take.
|
KStepMarkov(Hypergraph<V,E> graph,
int steps)
Creates an instance based on the specified graph 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 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 Number> edge_weights,
com.google.common.base.Function<V,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,Double> vertex_priors,
double alpha)
Creates an instance with the specified graph, vertex priors, and
'random jump' probability (alpha).
|
VoltageScorer(Hypergraph<V,E> g,
Collection<V> sources,
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,
com.google.common.base.Function<? super E,? extends Number> edge_weights,
Collection<V> sources,
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 Number> edge_weights,
Map<V,? extends Number> source_voltages,
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 Number> edge_weights,
V source,
V sink)
Creates an instance with the specified graph, edge weights, source, and
sink.
|
VoltageScorer(Hypergraph<V,E> g,
Map<V,? extends Number> source_voltages,
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.
|
Constructor and Description |
---|
UniformDegreeWeight(Hypergraph<V,E> graph) |
Modifier and Type | Field and Description |
---|---|
protected Hypergraph<V,E> |
DijkstraDistance.g |
Modifier and Type | Method and Description |
---|---|
static <V,E> com.google.common.base.Function<V,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> com.google.common.base.Function<V,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,
Set<V> rootSet) |
void |
BFSDistanceLabeler.labelDistances(Hypergraph<V,E> graph,
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.
|
Constructor and Description |
---|
DijkstraDistance(Hypergraph<V,E> g,
com.google.common.base.Function<? super E,? extends 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,
com.google.common.base.Function<? super E,? extends 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
|
Modifier and Type | Method and Description |
---|---|
static <V,E> Graph<V,Collection<E>> |
FoldingTransformer.foldHypergraphEdges(Hypergraph<V,E> h,
com.google.common.base.Supplier<Graph<V,Collection<E>>> graph_factory)
Creates a
Graph which is an edge-folded version of h , where
hyperedges are replaced by k-cliques in the output graph. |
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 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,
com.google.common.base.Supplier<Graph<E,Collection<V>>> graph_factory)
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 <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 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. |
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 |
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. |
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. |
Modifier and Type | Method and Description |
---|---|
static <V,H> com.google.common.base.Supplier<Hypergraph<V,H>> |
SetHypergraph.getFactory()
Returns a
Factory which creates instances of this class. |
Modifier and Type | Class and 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 objects
|
Modifier and Type | Field and Description |
---|---|
protected G |
GraphMLReader.current_graph |
Modifier and Type | Field and Description |
---|---|
protected Map<String,GraphMLMetadata<Hypergraph<V,E>>> |
GraphMLWriter.graph_data |
protected com.google.common.base.Function<? super Hypergraph<V,E>,String> |
GraphMLWriter.graph_desc |
Modifier and Type | Method and Description |
---|---|
void |
GraphMLWriter.save(Hypergraph<V,E> graph,
Writer w)
Writes
graph out using w . |
protected void |
GraphMLWriter.writeEdgeData(Hypergraph<V,E> g,
Writer w) |
protected void |
GraphMLWriter.writeVertexData(Hypergraph<V,E> graph,
BufferedWriter w) |
Modifier and Type | Method and Description |
---|---|
void |
GraphMLWriter.addGraphData(String id,
String description,
String default_value,
com.google.common.base.Function<Hypergraph<V,E>,String> graph_transformer)
Adds a new graph data specification.
|
void |
GraphMLWriter.setGraphData(Map<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>,String> graph_desc)
Provides graph descriptions.
|
Modifier and Type | Class and 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.
|
Modifier and Type | Class and 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.
|
Modifier and Type | Class and 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.
|
Copyright © 2015. All rights reserved.