| Package | Description |
|---|---|
| org.nongnu.multigraph | |
| org.nongnu.multigraph.layout | |
| org.nongnu.multigraph.metrics | |
| org.nongnu.multigraph.perturb | |
| org.nongnu.multigraph.rewire | |
| org.nongnu.multigraph.structure |
| Modifier and Type | Class and Description |
|---|---|
class |
MultiDiGraph<N,E>
A multi-edge, directed graph implementation of the
Graph interface. |
class |
MultiGraph<N,E>
A multi-edge, undirected edge graph implementation.
|
class |
PartitionGraph<N,E>
Partition the nodes of the supplied graph.
|
class |
SimpleDiGraph<N,E>
Simple, directed edge graph: no self-loop edges allowed and no more than 1
edge between nodes.
|
class |
SimpleGraph<N,E>
Simple, undirected graph: No self-loop edges allowed and 0 or 1 edges
between nodes.
|
class |
SyncGraph<N,E> |
| Modifier and Type | Method and Description |
|---|---|
Graph<N,E> |
PartitionGraph.PartitionCallbacks.create_graph()
Create and return the graph to be wrapped and partitioned
|
| Modifier and Type | Method and Description |
|---|---|
static <N,E> void |
AdjacencyMatrix.full(java.io.PrintStream out,
Graph<N,E> graph) |
static <N,E> void |
AdjacencyMatrix.parse(java.io.InputStream in,
Graph<N,E> graph,
NodeLabeler<N,E> nl,
EdgeLabeler<N,E> el) |
static <N,E> void |
AdjacencyMatrix.sparse(java.io.PrintStream out,
Graph<N,E> graph) |
| Constructor and Description |
|---|
ShortestPathFirst(Graph<N,E> g) |
SyncGraph(Graph<N,E> graph) |
| Modifier and Type | Method and Description |
|---|---|
static <N extends PositionableNode,L> |
Layout.factory(java.lang.String algname,
Graph<N,L> graph,
java.awt.Dimension bound,
int maxiterations) |
| Constructor and Description |
|---|
ForceLayout(Graph<N,E> graph,
java.awt.Dimension bound,
int maxiterations) |
ForceLayout(Graph<N,E> graph,
java.awt.Dimension bound,
int maxiterations,
double initial_temperature)
Create a ForceLayout instance, with the initial temperature set as given.
|
ForceLayout(Graph<N,E> graph,
java.awt.Dimension bound,
int maxiterations,
double initial_temperature,
double C)
Create a ForceLayout instance, with the initial temperature set as given,
and using the specific C scalar for the k parameter of the algorithm.
|
Layout(Graph<N,E> graph,
java.awt.Dimension bound) |
Layout(Graph<N,E> graph,
java.awt.Dimension bound,
int maxiterations) |
NullLayout(Graph<N,L> graph,
java.awt.Dimension bound,
int maxiterations) |
RadialLayout(Graph<N,E> graph,
java.awt.Dimension bound,
int maxiterations) |
RandomLayout(Graph<N,E> graph,
java.awt.Dimension bound,
int maxiterations) |
| Modifier and Type | Method and Description |
|---|---|
static <N,E> int |
TraversalMetrics.count(Graph<N,E> graph,
TraversalMetrics.node_test<N> t)
Traverse the graph and count those nodes which are accepted by
the node_test callback.
|
static <N,E> int[] |
TraversalMetrics.degree_distribution(Graph<N,E> graph)
Traverse the Graph and create a histogram of the distribution
of nodal out-degree.
|
static <N,E> int |
TraversalMetrics.edges(Graph<N,E> graph)
Traverse the graph and count the number of edges.
|
static <N,E> dmap<N> |
TraversalMetrics.FloydWarshal(Graph<N,E> graph) |
static <N,E> float[] |
TraversalMetrics.norm_degree_distribution(Graph<N,E> graph)
Traverse the Graph and create a histogram of the normalised distribution
of nodal out-degree.
|
static <N,E> java.util.Map<java.lang.String,java.lang.Double> |
TraversalMetrics.stats(dmap<N> dmap,
Graph<N,E> graph) |
static <N,E> java.util.Map<java.lang.String,java.lang.Double> |
TraversalMetrics.stats(Graph<N,E> graph) |
static <N,E> void |
TraversalMetrics.traverse_graph(Graph<N,E> graph,
TraversalMetrics.graph_traversor<N,E> gt)
Simple convenience function to traverse a graph with the given traversor.
|
static <N,E> void |
TraversalMetrics.traverse_graph(Graph<N,E> graph,
TraversalMetrics.graph_traversor<N,E>[] gts)
Simple convenience function to traverse a graph for each of the
given traversors
|
| Constructor and Description |
|---|
RandomMove(Graph<N,L> graph,
EdgeLabeler<N,L> el,
java.awt.Dimension bound,
float default_speed,
float maxrange) |
RandomMove(Graph<N,L> graph,
EdgeLabeler<N,L> el,
java.awt.Dimension bound,
float default_speed,
float maxrange,
int angle_dev) |
RandomRemove(Graph<N,E> graph)
Create new instance to randomly remove 1 edge on each call to
|
RandomRemove(Graph<N,E> graph,
float remove_edges)
Create new instance to iterate over the specified graph and remove then
add up to remove_edges # of edges on each call to
RandomRemove.remove(), |
RandomRemove(Graph<N,E> graph,
float remove_edges,
int max_perturbs)
Create new instance to iterate over the specified graph and remove then
add up to remove_edges # of edges on each call to
RandomRemove.remove(), |
RemoveAddEach(Graph<N,E> graph)
Create new instance to iterate over the specified graph and remove then
add 1 edge on each call to perturb, until all edges have been removed
and added.
|
RemoveAddEach(Graph<N,E> graph,
float remove_edges,
int max_perturbs)
Create new instance to iterate over the specified graph and remove then
add up to remove_edges # of edges on each call to perturb, up to a maximum
number of perturbations.
|
| Modifier and Type | Field and Description |
|---|---|
protected Graph<N,E> |
Rewire.graph |
| Modifier and Type | Method and Description |
|---|---|
static <N,L> Rewire<N,L> |
Rewire.factory(java.lang.String algname,
Graph<N,L> graph,
EdgeLabeler<N,L> el) |
| Constructor and Description |
|---|
CartesianRewire(Graph<N,E> graph,
EdgeLabeler<N,E> el,
java.awt.Dimension bound,
float range)
Create a new CartesianRewire instance, for the given graph, wiring up
nodes that are within the given distance.
|
CartesianRewire(Graph<N,E> graph,
EdgeLabeler<N,E> el,
float range)
Create a new CartesianRewire instance, for the given graph, wiring up
nodes that are within the given distance.
|
LatticeRewire(Graph<N,E> graph,
EdgeLabeler<N,E> el) |
LatticeRewire(Graph<N,E> graph,
EdgeLabeler<N,E> el,
int cols) |
MultiClassScaleFreeRewire(Graph<N,E> graph,
EdgeLabeler<N,E> el) |
RandomRewire(Graph<N,E> graph,
EdgeLabeler<N,E> el) |
RandomRewire(Graph<N,E> graph,
EdgeLabeler<N,E> el,
int mindegree)
Create a RandomRewire graph rewirer, with a minimum out-degree
which nodes should have after the graph is rewired.
|
Rewire(Graph<N,E> graph,
EdgeLabeler<N,E> el) |
ScaleFreeRewire(Graph<N,E> graph,
EdgeLabeler<N,E> el)
Create a ScaleFreeRewiring instancing, with the default m value.
|
| Modifier and Type | Method and Description |
|---|---|
static <N extends kshell_node,E> |
kshell.calc(Graph<N,E> graph)
Calculate the maximum k-shell membership for each node in the Graph, storing
the result in the gkc().k field of the node.
|
| Constructor and Description |
|---|
graph_diff(Graph<N,E> old_graph,
Graph<N,E> new_graph,
graph_diff.node_callback<N> node_cb,
graph_diff.edge_callback<N,E> edge_cb) |
graph_diff(Graph<N,E> old_graph,
Graph<N,E> new_graph,
graph_diff.node_callback<N> node_cb,
graph_diff.edge_callback<N,E> edge_cb) |