edu.bsu.cs.algorithm
Class MaximalPlanar

java.lang.Object
  |
  +--edu.bsu.cs.algorithm.Algorithm
        |
        +--edu.bsu.cs.algorithm.Fragments
              |
              +--edu.bsu.cs.algorithm.PlanarityTesting
                    |
                    +--edu.bsu.cs.algorithm.BlocksMerger
                          |
                          +--edu.bsu.cs.algorithm.MaximalPlanar

Direct Known Subclasses:

CanonicalOrdering

public class MaximalPlanar

extends BlocksMerger

An animated implementation of Maximal Planar algorithm.

Since:

Feb 2001

Version:

21 Apr 2001

Author:

Adrian Heinz

Field Summary

protected Vector	auxListRegions
protected Vector	firstVertexEdge
protected Vector	secondVertexEdge

Fields inherited from class edu.bsu.cs.algorithm.BlocksMerger

firstVertexEdgeBD, secondVertexEdgeBD

Fields inherited from class edu.bsu.cs.algorithm.Fragments

startVertex

Constructor Summary

MaximalPlanar()

MaximalPlanar(JavaGraph jGraph, Vector inputs, Vector animation)

Method Summary

protected void	addDummyEdges(JavaGraph jGraph) Adds all the required dummy edges to make the graph maximal planar
protected void	addTheSameEdges(JavaGraph jGraph, JavaGraph auxGraph) Adds to jGraph all the edges that are in auxGraph
void	callOwnConstructor(JavaGraph jGraph, Vector inputs, Vector animation) This method is called by Jedit for any algorithm it executes and must be used in any working algorithm.
protected void	MaximalPlanar(JavaGraph jGraph, Vector inputs, Vector animation) Called by the constructor to do all of the work
protected Vector	regionsAfterDummyEdgesAdded()
protected void	thatMaximalPlanar()
protected void	updateListRegionsForMaximal(Vector theRegions)

Methods inherited from class edu.bsu.cs.algorithm.BlocksMerger

BlocksMerger, executeBlocksMerger, thatBlocksMerger

Methods inherited from class edu.bsu.cs.algorithm.PlanarityTesting

completelyMarked, doPlanarity, executePlanarity, existDegreeFive, getAllTheBlocks, planarityTesting, removeUnmark, showAllRegions, showRegion, thatPlanarityTesting, theoremCheck

Methods inherited from class edu.bsu.cs.algorithm.Fragments

amountOfFragments, amountOfMarkedVertices, amountOfUnmarkEdges, closeOutOfCyclePaths, executeFragments, existEdge, findCycle, fragments, getFragmentAt, isThisEdgeMarked, that, unMarkGraphAB

Methods inherited from class edu.bsu.cs.algorithm.Algorithm

getCode, getDescription, getName, getType, setCode, setDescription, setFromResources, setName, setType, succeeded, succeeded

Methods inherited from class java.lang.Object

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

Field Detail

auxListRegions

protected Vector auxListRegions

firstVertexEdge

protected Vector firstVertexEdge

secondVertexEdge

protected Vector secondVertexEdge

Constructor Detail

MaximalPlanar

public MaximalPlanar()

MaximalPlanar

public MaximalPlanar(JavaGraph jGraph,
                     Vector inputs,
                     Vector animation)

Method Detail

thatMaximalPlanar

protected void thatMaximalPlanar()

MaximalPlanar

protected void MaximalPlanar(JavaGraph jGraph,
                             Vector inputs,
                             Vector animation)

Called by the constructor to do all of the work

addDummyEdges

protected void addDummyEdges(JavaGraph jGraph)

Adds all the required dummy edges to make the graph maximal planar

updateListRegionsForMaximal

protected void updateListRegionsForMaximal(Vector theRegions)

addTheSameEdges

protected void addTheSameEdges(JavaGraph jGraph,
                               JavaGraph auxGraph)

Adds to jGraph all the edges that are in auxGraph

regionsAfterDummyEdgesAdded

protected Vector regionsAfterDummyEdgesAdded()

callOwnConstructor

public void callOwnConstructor(JavaGraph jGraph,
                               Vector inputs,
                               Vector animation)

Description copied from class: Algorithm

This method is called by Jedit for any algorithm it executes and must be used in any working algorithm.

Overrides:

callOwnConstructor in class BlocksMerger

Parameters:

jGraph - the edu.bsu.cs.graph.JavaGraph that the algorithm is performed on

inputs - a Vector of inputs that consists of

• An Integer, if the algorithm uses a single vertex as a starting point
• Two Integers if the algorithm uses two vertices as starting points
• A String if the algorithm starts off of typed input
• Nothing if the algorithm runs automatically on a graph

animation - a Vector that is filled with AnimObjects as the algorithm proceeds. It must be instantiated before this method is called.