CONTENTS

The distribution consists of 14 Haskell files.

(A) These files define inductive graphs and provide examples:

  FGL.hs        --  Main module     
  Graph.hs      --  Graph type + operations
  GraphData.hs  --  Example graphs
  RootPath.hs   --  Inward Directed Trees
  Basic.hs      --  Basic graph operations (gmap, grev, ...)
  DFS.hs        --  Depth-First Search and derived operations
  BFS.hs        --  Breadth-First Search and "Edge" Shortest Paths
  SP.hs         --  Shortest Paths (Dijkstra's Algorithm)
  MST.hs        --  Minimum Spanning Tree (Prim's Algorithm)
  Indep.hs      --  Independent Node Sets
  
(B) Some auxiliary modules:

  Heap.hs       --  Pairing heaps 
  RoseTree.hs   --  Multi-Way Trees
  SimpleMap.hs  --  Binary search tree implementation of maps 
  Thread.hs     --  Auxiliary module used in Graph (subject to future change)
  
(From the Haskell library the modules Maybe and List are used. Thus, you 
should take care that these modules can be found by hugs.)
 


INSTALLATION

1. Copy all files to a directory where hugs or ghc can find them.
(I tested the programs with Hugs 98, Version: September 1999)

2. Start hugs with the following options: -98 +o
(I will make FGL Haskel98 compatible soon.)  

3. Load FGL.hs

4. Play with it, eg, enter "sp 1 3 clr528" ...



CONTACT

Please email comments, bugs, etc. to erwig@fernuni-hagen.de.


--
Martin
