harpoon.Analysis.GraphColoring
Class UnableToColorGraph

java.lang.Object
  java.lang.Throwable
      harpoon.Analysis.GraphColoring.UnableToColorGraph

All Implemented Interfaces:

Serializable

public class UnableToColorGraph
extends Throwable

UnableToColorGraph is a control-flow construct for indicating the provided Graph Coloring algorithm failed to color a given graph.

Version:

$Id: UnableToColorGraph.java,v 1.2 2002/02/25 20:57:17 cananian Exp $

Author:

Felix S. Klock II <pnkfelix@mit.edu>

See Also:

Serialized Form

Constructor Summary

UnableToColorGraph()
Creates a UncolorableGraphException.

UnableToColorGraph(String s)
Creates a UncolorableGraphException.

Method Summary

Collection	getRemovalSuggestions() returns a Collection of nodes that are suggested for removal to make some external graph colorable.
Collection	getRemovalSuggestionsBackup() returns a Collection of nodes that are suggested for removal to make some external graph colorable.

Methods inherited from class java.lang.Throwable

fillInStackTrace, getCause, getLocalizedMessage, getMessage, getStackTrace, initCause, printStackTrace, printStackTrace, printStackTrace, setStackTrace, toString

Methods inherited from class java.lang.Object

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

Constructor Detail

UnableToColorGraph

public UnableToColorGraph()

Creates a UncolorableGraphException.

UnableToColorGraph

public UnableToColorGraph(String s)

Creates a UncolorableGraphException.

Method Detail

getRemovalSuggestions

public Collection getRemovalSuggestions()

returns a Collection of nodes that are suggested for removal to make some external graph colorable. No guarantees are made about the colorability of the graph after any nodes are removed; these are merely heuristically-driven hints to the catcher on how to recover.

getRemovalSuggestionsBackup

public Collection getRemovalSuggestionsBackup()

returns a Collection of nodes that are suggested for removal to make some external graph colorable. No guarantees are made about the colorability of the graph after any nodes are removed; these are merely heuristically-driven hints to the catcher on how to recover.