   Graph-handling classes  
   =========================
   Last update Mar 27 2000 - ETO


   * version 1.0 - classes GraphNode and Graph help you implement graph algorithms,
                   includes topological sort method.
           

   Introduction
   ------------

   This package is an implementation of a directed graph. It implements a topological
   sort on the graph, with a 'twist' to account for circular dependencies.
   -  GraphNode is a class that represents a graph node, and you should derive your 'cell' 
   class (that is, the class representing your working unit) from this class, and provide
   your own doAction() method. 
   -  Graph is a class that represents the graph itself. For more information see below.r
   Sample usage of the classes is in the project 'graphex', which goes with this package.


   Version 1.0
   ========================

   I would be glad to receive feedback about this software, suggestions 
   and, your e-mail. This way I can also send you reports,
   bug fixes and everything else.
   And, good luck and have fun with GraphNode and Graph !

   ==========================================================================================  
   DISCLAIMER
   ==========================================================================================
   This software is provided AS IS, with NO WARRANTY OF ANY KIND, and the author shall not be 
   held responsible for any damage or loss of profit caused by its usage. Use of the software
   implies in the acceptance of such terms of use.
   ==========================================================================================

   Author
   Eduardo T Ochiai 

   =================

   e-mail: eochiai@fs.com.br