Add Literate Haskell document for the edge-coloring algorithm.

.gitignore

@@ -17,4 +17,10 @@ cabal.sandbox.config
 *.swp
 *.swo
 *.swn
+*.ptb
+*.tex
+*.log
+*.aux
+*.fmt
+*.pdf
 Main

graph-hs.cabal

@@ -52,7 +52,11 @@ cabal-version:       >=1.10
 library
   -- Modules exported by the library.
   hs-source-dirs: src/
-  exposed-modules:     GraphTheory.Algorithm.Dijkstra, GraphTheory.Graph, GraphTheory.SpecialGraphs, GraphTheory.Misc.Infinity
+  exposed-modules:      GraphTheory.Graph, 
+                        GraphTheory.SpecialGraphs, 
+                        GraphTheory.Misc.Infinity,
+                        GraphTheory.Algorithm.Dijkstra,
+                        GraphTheory.Algorithm.EdgeColor
 
   -- Modules included in this library but not exported.
   -- other-modules:       

src/GraphTheory/Algorithm/DFS.hs

@@ -5,8 +5,9 @@ import qualified Data.Map as M
 import Data.Maybe (fromJust)
 import Debug.Trace (trace)
 
---This depth-first search is strange and (probably) slow. 
---TODO: fix when not working under deadline
+-- This depth-first search is strange, bad, and (probably) slow. It works well
+-- enough for now.  
+-- TODO: do this better
 
 getComponents :: (Ord v) => Graph v w c -> [(v,Integer)]
 getComponents g = M.toList $ depthFirstSearchSCC g