graph.algorithms.drawing

Class CyclicSymmetricGraphDrawing<V extends Vertex,E extends Edge<V>>

java.lang.Object

graph.algorithms.drawing.CyclicSymmetricGraphDrawing<V,E>

Type Parameters:

V - The vertex type

E - The edge type

public class CyclicSymmetricGraphDrawing<V extends Vertex,E extends Edge<V>>
extends java.lang.Object

Implementation of concentric symmetric drawing based on: An Algorithm for Drawing Graphs Symmetrically Hamish Carr and William Kocay Bulletin of the Institute of Combinatorics and its Applications 27, 1999

Author:

Renata

Constructor Summary

Constructors

Constructor and Description
CyclicSymmetricGraphDrawing(Graph<V,E> graph)

Method Summary

Modifier and Type	Method and Description
java.util.List<java.util.List<V>>	execute() Executes the algorithm and automatically selects a suitable permutation
java.util.List<java.util.List<V>>	execute(Permutation p) Executes the algorithm using the provided permutation

Methods inherited from class java.lang.Object

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

Constructor Detail

CyclicSymmetricGraphDrawing

public CyclicSymmetricGraphDrawing(Graph<V,E> graph)

Parameters:

graph - Graph whose drawing is being constructed

Method Detail

execute

public java.util.List<java.util.List<V>> execute(Permutation p)

Executes the algorithm using the provided permutation

Parameters:

p - Permutation

Returns:

A list of cycles, where each one is represented as a list of vertices it contains

execute

public java.util.List<java.util.List<V>> execute()

Executes the algorithm and automatically selects a suitable permutation

Returns:

A list of cycles, where each one is represented as a list of vertices it contains