- calc(Graph<N, E>) - Static method in class org.nongnu.multigraph.structure.kshell
-
Calculate the maximum k-shell membership for each node in the Graph, storing
the result in the gkc().k field of the node.
- CartesianRewire<N extends PositionableNode,E> - Class in org.nongnu.multigraph.rewire
-
Wire up nodes in the graph with each other according to their cartesian
distance from each other, applying a 'range' constraint.
- CartesianRewire(Graph<N, E>, EdgeLabeler<N, E>, Dimension, float) - Constructor for class org.nongnu.multigraph.rewire.CartesianRewire
-
Create a new CartesianRewire instance, for the given graph, wiring up
nodes that are within the given distance.
- CartesianRewire(Graph<N, E>, EdgeLabeler<N, E>, float) - Constructor for class org.nongnu.multigraph.rewire.CartesianRewire
-
Create a new CartesianRewire instance, for the given graph, wiring up
nodes that are within the given distance.
- classfilter() - Static method in class org.nongnu.multigraph.debug
-
- classfilter(String) - Static method in class org.nongnu.multigraph.debug
-
Set a regular expression to filter log records with.
- clear() - Method in class org.nongnu.multigraph.MultiDiGraph
-
- clear() - Method in class org.nongnu.multigraph.PartitionGraph
-
- clear() - Method in class org.nongnu.multigraph.SyncGraph
-
- clear_all_edges() - Method in interface org.nongnu.multigraph.Graph
-
Clear all edges from the graph.
- clear_all_edges() - Method in class org.nongnu.multigraph.MultiDiGraph
-
- clear_all_edges() - Method in class org.nongnu.multigraph.PartitionGraph
-
- clear_all_edges() - Method in class org.nongnu.multigraph.SyncGraph
-
- clear_removed_edges() - Method in interface org.nongnu.multigraph.perturb.perturber
-
Clear state held for any removed edges.
- clear_removed_edges() - Method in class org.nongnu.multigraph.perturb.RandomRemove
-
Clear state held for the removed edges.
- clear_removed_edges() - Method in class org.nongnu.multigraph.perturb.RemoveAddEach
-
- combine(boolean) - Method in class org.nongnu.multigraph.perturb.RandomRemove
-
- combine() - Method in class org.nongnu.multigraph.perturb.RandomRemove
-
- compare() - Method in class org.nongnu.multigraph.structure.graph_diff
-
- compare_next() - Method in class org.nongnu.multigraph.structure.graph_diff
-
- consider_link(N, N, long) - Method in class org.nongnu.multigraph.rewire.ScaleFreeRewire
-
Consider whether to add a link between the new node and the
given existing node.
- consider_similar_link(N, N, int, int) - Method in class org.nongnu.multigraph.rewire.MultiClassScaleFreeRewire
-
- contains(Object) - Method in class org.nongnu.multigraph.MultiDiGraph
-
- contains(Object) - Method in class org.nongnu.multigraph.PartitionGraph
-
- contains(Object) - Method in class org.nongnu.multigraph.SyncGraph
-
- containsAll(Collection<?>) - Method in class org.nongnu.multigraph.MultiDiGraph
-
- containsAll(Collection<?>) - Method in class org.nongnu.multigraph.PartitionGraph
-
- containsAll(Collection<?>) - Method in class org.nongnu.multigraph.SyncGraph
-
- count(Graph<N, E>, TraversalMetrics.node_test<N>) - Static method in class org.nongnu.multigraph.metrics.TraversalMetrics
-
Traverse the graph and count those nodes which are accepted by
the node_test callback.
- countObservers() - Method in interface org.nongnu.multigraph.Graph
-
- countObservers() - Method in class org.nongnu.multigraph.PartitionGraph
-
- countObservers() - Method in class org.nongnu.multigraph.SyncGraph
-
- create_graph() - Method in interface org.nongnu.multigraph.PartitionGraph.PartitionCallbacks
-
Create and return the graph to be wrapped and partitioned
- p - Variable in class org.nongnu.multigraph.rewire.MultiClassScaleFreeRewire
-
- p() - Method in class org.nongnu.multigraph.rewire.MultiClassScaleFreeRewire
-
- p(int) - Method in class org.nongnu.multigraph.rewire.MultiClassScaleFreeRewire
-
The 'p' parameter is the number of links to add between existing, sufficiently alike
nodes on each time-step.
- parse(InputStream, Graph<N, E>, NodeLabeler<N, E>, EdgeLabeler<N, E>) - Static method in class org.nongnu.multigraph.AdjacencyMatrix
-
- partition(int) - Method in class org.nongnu.multigraph.PartitionGraph
-
Retrieve a particular partition of the nodes.
- PartitionGraph<N,E> - Class in org.nongnu.multigraph
-
Partition the nodes of the supplied graph.
- PartitionGraph(PartitionGraph.PartitionCallbacks<N, E>) - Constructor for class org.nongnu.multigraph.PartitionGraph
-
- PartitionGraph.PartitionCallbacks<N,E> - Interface in org.nongnu.multigraph
-
- partitions() - Method in class org.nongnu.multigraph.PartitionGraph
-
- path(N) - Method in class org.nongnu.multigraph.ShortestPathFirst
-
Return the path from the root node to the 'to' node, as a List
of Edges, in the current SPF tree.
- perturb() - Method in interface org.nongnu.multigraph.perturb.perturber
-
Carry out 1 iteration of the perturbation of the graph, according to the
policy of the implementation.
- perturb() - Method in class org.nongnu.multigraph.perturb.RandomRemove
-
Carry out another iteration of random-removes by restoring any previously
removed edges, clearing the removed_edge set, and then removing the next
random set of edges.
- perturb() - Method in class org.nongnu.multigraph.perturb.RemoveAddEach
-
Carry out 1 perturbation of the graph, either removing the next group of
of edges from the graph, or adding back the group of edges removed in
the previous iteration.
- perturber<N,E> - Interface in org.nongnu.multigraph.perturb
-
Operations common to graph perturbation implementations.
- plugObservable() - Method in interface org.nongnu.multigraph.Graph
-
"Plug" delivery of Observable events to observers, so that any such events
are instead queued up internally, and potentially coalesced, rather than
delivered to Observers.
- plugObservable() - Method in class org.nongnu.multigraph.MultiDiGraph
-
- plugObservable() - Method in class org.nongnu.multigraph.PartitionGraph
-
- plugObservable() - Method in class org.nongnu.multigraph.SyncGraph
-
- plus(Point2D) - Method in class org.nongnu.multigraph.layout.Vector2D
-
- plus(double, double) - Method in class org.nongnu.multigraph.layout.Vector2D
-
- PositionableNode - Interface in org.nongnu.multigraph.layout
-
Interface that is required to be implemented by nodes of a graph, if
any Layout algorithm is to be able to act on them.
- printf(debug.levels, String) - Static method in class org.nongnu.multigraph.debug
-
- printf(String) - Static method in class org.nongnu.multigraph.debug
-
- printf(debug.levels, String, Object...) - Static method in class org.nongnu.multigraph.debug
-
- printf(String, Object...) - Static method in class org.nongnu.multigraph.debug
-
- println(debug.levels, String) - Static method in class org.nongnu.multigraph.debug
-
- println(String) - Static method in class org.nongnu.multigraph.debug
-
- pushlevel() - Static method in class org.nongnu.multigraph.debug
-
The current push-level.
- pushlevel(debug.levels) - Static method in class org.nongnu.multigraph.debug
-
Set the current push-level.
- pushlevel(String) - Static method in class org.nongnu.multigraph.debug
-
Set the current push-level.
- r - Variable in class org.nongnu.multigraph.rewire.ScaleFreeRewire
-
- RadialLayout<N extends PositionableNode,E> - Class in org.nongnu.multigraph.layout
-
Layout the graph's nodes radially, in a nice circle.
- RadialLayout(Graph<N, E>, Dimension, int) - Constructor for class org.nongnu.multigraph.layout.RadialLayout
-
- random_edge_iterable(N) - Method in interface org.nongnu.multigraph.Graph
-
Provide a random-access Iterable over the <Edge<N,E>>-edges from the
given node.
- random_edge_iterable(N) - Method in class org.nongnu.multigraph.MultiDiGraph
-
- random_edge_iterable(N) - Method in class org.nongnu.multigraph.PartitionGraph
-
- random_edge_iterable(N) - Method in class org.nongnu.multigraph.SyncGraph
-
- random_node_iterable() - Method in interface org.nongnu.multigraph.Graph
-
Provide a random-access Iterable over the <N>-nodes in the graph.
- random_node_iterable() - Method in class org.nongnu.multigraph.MultiDiGraph
-
- random_node_iterable() - Method in class org.nongnu.multigraph.PartitionGraph
-
- random_node_iterable() - Method in class org.nongnu.multigraph.SyncGraph
-
- RandomLayout<N extends PositionableNode,E> - Class in org.nongnu.multigraph.layout
-
Random layout of a graph.
- RandomLayout(Graph<N, E>, Dimension, int) - Constructor for class org.nongnu.multigraph.layout.RandomLayout
-
- RandomMove<N extends PositionableNode,L> - Class in org.nongnu.multigraph.perturb
-
A graph perturbing class which emulates a mobile network, by moving
PositionableNode nodes according to their velocity, within the giving
bounding area, and then applying cartesian rewire.
- RandomMove(Graph<N, L>, EdgeLabeler<N, L>, Dimension, float, float) - Constructor for class org.nongnu.multigraph.perturb.RandomMove
-
- RandomMove(Graph<N, L>, EdgeLabeler<N, L>, Dimension, float, float, int) - Constructor for class org.nongnu.multigraph.perturb.RandomMove
-
- RandomRemove<N,E> - Class in org.nongnu.multigraph.perturb
-
Perturb the graph by removing a randomly chosen set of edges from the graph.
- RandomRemove(Graph<N, E>) - Constructor for class org.nongnu.multigraph.perturb.RandomRemove
-
Create new instance to randomly remove 1 edge on each call to
- RandomRemove(Graph<N, E>, float) - Constructor for class org.nongnu.multigraph.perturb.RandomRemove
-
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>, float, int) - Constructor for class org.nongnu.multigraph.perturb.RandomRemove
-
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(),
- RandomRewire<N,E> - Class in org.nongnu.multigraph.rewire
-
Randomly wire up nodes of a graph, with each node having at least
the number of outgoing edges.
- RandomRewire(Graph<N, E>, EdgeLabeler<N, E>) - Constructor for class org.nongnu.multigraph.rewire.RandomRewire
-
- RandomRewire(Graph<N, E>, EdgeLabeler<N, E>, int) - Constructor for class org.nongnu.multigraph.rewire.RandomRewire
-
Create a RandomRewire graph rewirer, with a minimum out-degree
which nodes should have after the graph is rewired.
- remove(N, N, E) - Method in interface org.nongnu.multigraph.Graph
-
Remove 1 specific edge, given by the label, from between two nodes.
- remove(N, N) - Method in interface org.nongnu.multigraph.Graph
-
Remove all edges that go from one node to another
- remove(N, N, E) - Method in class org.nongnu.multigraph.MultiDiGraph
-
- remove(N, N) - Method in class org.nongnu.multigraph.MultiDiGraph
-
- remove(Object) - Method in class org.nongnu.multigraph.MultiDiGraph
-
- remove(Object) - Method in class org.nongnu.multigraph.MultiGraph
-
- remove(N, N, E) - Method in class org.nongnu.multigraph.PartitionGraph
-
- remove(N, N) - Method in class org.nongnu.multigraph.PartitionGraph
-
- remove(Object) - Method in class org.nongnu.multigraph.PartitionGraph
-
- remove() - Method in class org.nongnu.multigraph.perturb.RandomRemove
-
Randomly remove edges from the graph, up to the specified number of edges
for the class.
- remove(N, N, E) - Method in class org.nongnu.multigraph.SyncGraph
-
- remove(N, N) - Method in class org.nongnu.multigraph.SyncGraph
-
- remove(Object) - Method in class org.nongnu.multigraph.SyncGraph
-
- RemoveAddEach<N,E> - Class in org.nongnu.multigraph.perturb
-
Perturb the graph by removing and adding back a subset of edges from the
graph, on each call to
RemoveAddEach.perturb(), until all the edges have been
removed and added back.
- RemoveAddEach(Graph<N, E>) - Constructor for class org.nongnu.multigraph.perturb.RemoveAddEach
-
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>, float, int) - Constructor for class org.nongnu.multigraph.perturb.RemoveAddEach
-
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.
- removeAll(Collection<?>) - Method in class org.nongnu.multigraph.MultiDiGraph
-
- removeAll(Collection<?>) - Method in class org.nongnu.multigraph.PartitionGraph
-
- removeAll(Collection<?>) - Method in class org.nongnu.multigraph.SyncGraph
-
- removed - Variable in class org.nongnu.multigraph.structure.kshell_node_data
-
- removed_edges() - Method in interface org.nongnu.multigraph.perturb.perturber
-
- removed_edges() - Method in class org.nongnu.multigraph.perturb.RandomRemove
-
- removed_edges() - Method in class org.nongnu.multigraph.perturb.RemoveAddEach
-
- reset() - Method in class org.nongnu.multigraph.structure.kshell_node_data
-
- restore() - Method in interface org.nongnu.multigraph.perturb.perturber
-
- restore() - Method in class org.nongnu.multigraph.perturb.RandomRemove
-
- restore() - Method in class org.nongnu.multigraph.perturb.RemoveAddEach
-
- retainAll(Collection<?>) - Method in class org.nongnu.multigraph.MultiDiGraph
-
- retainAll(Collection<?>) - Method in class org.nongnu.multigraph.PartitionGraph
-
- retainAll(Collection<?>) - Method in class org.nongnu.multigraph.SyncGraph
-
- rewire() - Method in class org.nongnu.multigraph.perturb.RandomMove
-
- rewire() - Method in class org.nongnu.multigraph.rewire.CartesianRewire
-
- rewire() - Method in class org.nongnu.multigraph.rewire.LatticeRewire
-
- rewire() - Method in class org.nongnu.multigraph.rewire.RandomRewire
-
- Rewire<N,E> - Class in org.nongnu.multigraph.rewire
-
Abstract interface for algorithms to rewire the edges of a graph.
- Rewire(Graph<N, E>, EdgeLabeler<N, E>) - Constructor for class org.nongnu.multigraph.rewire.Rewire
-
- rewire() - Method in class org.nongnu.multigraph.rewire.Rewire
-
Rewire the whole graph.
- rewire() - Method in class org.nongnu.multigraph.rewire.ScaleFreeRewire
-
- rewire_callback(int, int) - Method in class org.nongnu.multigraph.rewire.MultiClassScaleFreeRewire
-
- rewire_callback(int, int) - Method in class org.nongnu.multigraph.rewire.ScaleFreeRewire
-
- root() - Method in class org.nongnu.multigraph.ShortestPathFirst
-
- rotate(double) - Method in class org.nongnu.multigraph.layout.Vector2D
-
- run(N) - Method in class org.nongnu.multigraph.ShortestPathFirst
-
Construct the SPF tree rooted at the given node, to be used for
subsequent shortest-path query call.
- ScaleFreeRewire<N,E> - Class in org.nongnu.multigraph.rewire
-
Rewire a graph such that the connectivity of its nodes have a scale-free
distribution, following the model given in the Barabis, Albert paper
"Emergence of Scaling in Random Networks" paper.
- ScaleFreeRewire(Graph<N, E>, EdgeLabeler<N, E>) - Constructor for class org.nongnu.multigraph.rewire.ScaleFreeRewire
-
Create a ScaleFreeRewiring instancing, with the default m value.
- ScaleFreeRewire.m_modes - Enum in org.nongnu.multigraph.rewire
-
- set(N, N, E) - Method in interface org.nongnu.multigraph.Graph
-
Set an edge from one node to another with the given label.
- set(N, N, E, int) - Method in interface org.nongnu.multigraph.Graph
-
Set an edge from one node to another with the given label and weight.
- set(N, N, int) - Method in class org.nongnu.multigraph.metrics.dmap
-
- set(N, N, E) - Method in class org.nongnu.multigraph.MultiDiGraph
-
- set(N, N, E, int) - Method in class org.nongnu.multigraph.MultiDiGraph
-
- set(N, N, E) - Method in class org.nongnu.multigraph.PartitionGraph
-
- set(N, N, E, int) - Method in class org.nongnu.multigraph.PartitionGraph
-
- set(N, N, E) - Method in class org.nongnu.multigraph.SyncGraph
-
- set(N, N, E, int) - Method in class org.nongnu.multigraph.SyncGraph
-
- set_mindegree(int) - Method in class org.nongnu.multigraph.rewire.RandomRewire
-
Set the minimum out-degree which nodes should have after the graph is
rewired.
- setC(double) - Method in class org.nongnu.multigraph.layout.ForceLayout
-
- setDecay(double) - Method in class org.nongnu.multigraph.layout.ForceLayout
-
The velocity on each iteration is scaled by a 'temperature' factor, which
is decayed according to temperature(t+1) = temperature(t) * decay, or
temperature (t) = decay^t.
- setJiggle(double) - Method in class org.nongnu.multigraph.layout.ForceLayout
-
- setMass(float) - Method in class org.nongnu.multigraph.layout.AbstractPositionableNode
-
- setMass(float) - Method in interface org.nongnu.multigraph.layout.PositionableNode
-
- setMinkve(double) - Method in class org.nongnu.multigraph.layout.ForceLayout
-
- setMintemp(double) - Method in class org.nongnu.multigraph.layout.ForceLayout
-
Set the minimum temperature possible.
- setPosition(Vector2D) - Method in class org.nongnu.multigraph.layout.AbstractPositionableNode
-
- setPosition(Vector2D) - Method in interface org.nongnu.multigraph.layout.PositionableNode
-
- setSize(float) - Method in class org.nongnu.multigraph.layout.AbstractPositionableNode
-
- setSize(float) - Method in interface org.nongnu.multigraph.layout.PositionableNode
-
- ShortestPathFirst<N,E> - Class in org.nongnu.multigraph
-
Dijkstra's Shortest Path First algoritm, implemented to act on a
Graph of N-nodes and Edges, with L-labels
- ShortestPathFirst(Graph<N, E>) - Constructor for class org.nongnu.multigraph.ShortestPathFirst
-
- SimpleDiGraph<N,E> - Class in org.nongnu.multigraph
-
Simple, directed edge graph: no self-loop edges allowed and no more than 1
edge between nodes.
- SimpleDiGraph() - Constructor for class org.nongnu.multigraph.SimpleDiGraph
-
- SimpleGraph<N,E> - Class in org.nongnu.multigraph
-
Simple, undirected graph: No self-loop edges allowed and 0 or 1 edges
between nodes.
- SimpleGraph() - Constructor for class org.nongnu.multigraph.SimpleGraph
-
- size() - Method in class org.nongnu.multigraph.MultiDiGraph
-
- size() - Method in class org.nongnu.multigraph.PartitionGraph
-
- size() - Method in class org.nongnu.multigraph.SyncGraph
-
- sparse(PrintStream, Graph<N, E>) - Static method in class org.nongnu.multigraph.AdjacencyMatrix
-
- stats(Graph<N, E>) - Static method in class org.nongnu.multigraph.metrics.TraversalMetrics
-
- stats(dmap<N>, Graph<N, E>) - Static method in class org.nongnu.multigraph.metrics.TraversalMetrics
-
- successors(N) - Method in interface org.nongnu.multigraph.Graph
-
- successors(N) - Method in class org.nongnu.multigraph.MultiDiGraph
-
- successors(N) - Method in class org.nongnu.multigraph.PartitionGraph
-
- successors(N) - Method in class org.nongnu.multigraph.SyncGraph
-
- SyncGraph<N,E> - Class in org.nongnu.multigraph
-
- SyncGraph(Graph<N, E>) - Constructor for class org.nongnu.multigraph.SyncGraph
-