org.nongnu.multigraph.rewire

Class CartesianRewire<N extends PositionableNode,E>

java.lang.Object

org.nongnu.multigraph.rewire.Rewire<N,E>

org.nongnu.multigraph.rewire.CartesianRewire<N,E>

Type Parameters:

N - The type of the Nodes in the graph

E - The type of the Edges in the graph

public class CartesianRewire<N extends PositionableNode,E>
extends Rewire<N,E>

Wire up nodes in the graph with each other according to their cartesian distance from each other, applying a 'range' constraint. The user can apply further constraints using the EdgeLabeler.

This rewiring algorithm only considers edges once, at this time. If the graph is directed, and the user wishes both directions to be set, they must do so themselves in their EdgeLabeler.

Author:

Paul Jakma

Field Summary

Fields inherited from class org.nongnu.multigraph.rewire.Rewire

el, graph

Constructor Summary

Constructors

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.

Method Summary

Modifier and Type	Method and Description
void	rewire() Rewire the whole graph.

Methods inherited from class org.nongnu.multigraph.rewire.Rewire

add, factory, isaRewire

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

CartesianRewire

public 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. Note that the EdgeLabeler callback may apply its own, further constraints, by returning a null label. This instance of the algorithm uses the supplied boundary to create a grid index to speed things. Certain extreme cases may be slower with grid-indexing e.g. where nodes are extremely tightly bunched, positionally.

Parameters:

graph - The graph to rewire.

el - The EdgeLaber to callback to create labels.

bound - The positional boundary for nodes, used for grid-indexing.

range - The maximum range for links between nodes.

CartesianRewire

public 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. Note that the EdgeLabeler callback may apply its own, further constraints, by returning a null label.

Parameters:

graph - The graph to rewire.

el - The EdgeLaber to callback to create labels.

range - The maximum range for links between nodes.

Method Detail

rewire

public void rewire()

Description copied from class: Rewire

Rewire the whole graph. All edges potentially are first cleared. Then some edges added back, according to the specified algorithm.

Specified by:

rewire in class Rewire<N extends PositionableNode,E>