de.cau.cs.kieler.klodd.hierarchical.impl
Class InteractiveCrossingReducer

java.lang.Object
  extended by de.cau.cs.kieler.core.alg.AbstractAlgorithm
      extended by de.cau.cs.kieler.klodd.hierarchical.impl.InteractiveCrossingReducer
All Implemented Interfaces:
IAlgorithm, ICrossingReducer

public class InteractiveCrossingReducer
extends AbstractAlgorithm
implements ICrossingReducer

Rating red

Constructor Summary
InteractiveCrossingReducer()
           
 
Method Summary
 void reduceCrossings(LayeredGraph layeredGraph)
          Reduces the number of crossings in a given layered directed graph by changing the order of nodes in each layer.
 
Methods inherited from class de.cau.cs.kieler.core.alg.AbstractAlgorithm
getMonitor, reset, reset, setProgressMonitor
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 
Methods inherited from interface de.cau.cs.kieler.core.alg.IAlgorithm
reset, reset, setProgressMonitor
 

Constructor Detail

InteractiveCrossingReducer

public InteractiveCrossingReducer()
Method Detail

reduceCrossings

public void reduceCrossings(LayeredGraph layeredGraph)
Reduces the number of crossings in a given layered directed graph by changing the order of nodes in each layer.

Specified by:
reduceCrossings in interface ICrossingReducer
Parameters:
layeredGraph - layered graph to process