graph.ordering.circular

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

java.lang.Object

graph.ordering.circular.Circular<V,E>

Type Parameters:

V - The vertex type

E - The edge type

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

An implementation of the algorithm CIRCULAR which optimizes the number of edge crossings in circular drawings

Author:

Renata

Constructor Summary

Constructors

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

Method Summary

Modifier and Type	Method and Description
java.util.List<V>	circularOrdering() Finds the ordering which minimizes the number of edge crossings in a circular drawing

Methods inherited from class java.lang.Object

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

Constructor Detail

Circular

public Circular(Graph<V,E> graph)

Method Detail

circularOrdering

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

Finds the ordering which minimizes the number of edge crossings in a circular drawing

Returns:

A list of vertices in the calculated order