graph.algorithms.planarity

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

java.lang.Object

graph.algorithms.planarity.MaximumPlanaritySubgraph<V,E>

Type Parameters:

V - The vertex type

E - The edge type

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

Finds maximum planar subgraph A widely used standard heuristic for finding a maximal planar subgraph is to start with a spanning tree of G, and to iteratively try to add the remaining edges one by one In every step, a planarity testing algorithm is called for the obtained graph.

Author:

Renata

Constructor Summary

Constructors

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

Method Summary

Modifier and Type	Method and Description
Graph<V,E>	calculateMaximumPlanarityGraph()
Graph<V,E>	getPlanarSubgraph()

Methods inherited from class java.lang.Object

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

Constructor Detail

MaximumPlanaritySubgraph

public MaximumPlanaritySubgraph(Graph<V,E> graph)

Method Detail

calculateMaximumPlanarityGraph

public Graph<V,E> calculateMaximumPlanarityGraph()

getPlanarSubgraph

public Graph<V,E> getPlanarSubgraph()

Returns:

Maximum planarity subgraph