graph.algorithms.lrpartition

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

java.lang.Object

graph.algorithms.lrpartition.LRPartitionSet<V,E>

Type Parameters:

V - The vertex type

E - The edge type

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

Used in LR planar testing algorithm to form L and R partitions

Author:

Renata

Constructor Summary

Constructors

Constructor and Description
LRPartitionSet(DFSTree<V,E> tree)

Method Summary

Modifier and Type	Method and Description
boolean	add(java.util.List<E> class1, java.util.List<E> class2) Marks that all edges belonging to the first list should be in the same partition.
boolean	organizePartitions() Forms partitions
void	printPartitions() Prints partitions

Methods inherited from class java.lang.Object

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

Constructor Detail

LRPartitionSet

public LRPartitionSet(DFSTree<V,E> tree)

Method Detail

add

public boolean add(java.util.List<E> class1,
                   java.util.List<E> class2)

Marks that all edges belonging to the first list should be in the same partition. Same for edges of the second one. Also marks that edges belonging to different lists should be in different partitions

Parameters:

class1 - The first list of edges

class2 - The second list of edges

Returns:

true if there was no contradiction, false otherwise

organizePartitions

public boolean organizePartitions()

Forms partitions

Returns:

true if partitions can be formed, false otherwise

printPartitions

public void printPartitions()

Prints partitions