graph.algorithms.planarity

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

java.lang.Object

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

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

Type Parameters:

V - The vertex type

E - The edge type

public class FraysseixMendezPlanarity<V extends Vertex,E extends Edge<V>>
extends PlanarityTestingAlgorithm<V,E>

An algorithm for checking the planarity of a graph based on Fraysseix and Mendez's algorithm

Author:

Renata

Constructor Summary

Constructors

Constructor and Description
FraysseixMendezPlanarity()

Method Summary

Modifier and Type	Method and Description
Path<V,E>	findFundamentalCycle(DFSTree<V,E> tree, E edge) Implementation of the procedure for finding a fundamental cycle
boolean	isPlannar(Graph<V,E> graph) Determines if the graph is planar

Methods inherited from class java.lang.Object

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

Constructor Detail

FraysseixMendezPlanarity

public FraysseixMendezPlanarity()

Method Detail

isPlannar

public boolean isPlannar(Graph<V,E> graph)

Description copied from class: PlanarityTestingAlgorithm

Determines if the graph is planar

Specified by:

isPlannar in class PlanarityTestingAlgorithm<V extends Vertex,E extends Edge<V>>

Parameters:

graph - Graph whose planarity is being checked

Returns:

true if graph is planar, otherwise false

findFundamentalCycle

public Path<V,E> findFundamentalCycle(DFSTree<V,E> tree,
                                      E edge)

Implementation of the procedure for finding a fundamental cycle

Parameters:

tree - DFS tree

edge - Edge

Returns:

Fundamental cycle if it exists, null otherwise