Home My Page Projects Code Snippets Project Openings SML/NJ
Summary Activity Forums Tracker Lists Tasks Docs Surveys News SCM Files

SCM Repository

[smlnj] View of /sml/trunk/src/MLRISC/graphs/graph-is-cyclic.sml
ViewVC logotype

View of /sml/trunk/src/MLRISC/graphs/graph-is-cyclic.sml

Parent Directory Parent Directory | Revision Log Revision Log


Revision 245 - (download) (annotate)
Sat Apr 17 18:47:12 1999 UTC (20 years, 6 months ago) by monnier
Original Path: sml/branches/SMLNJ/src/MLRISC/graphs/graph-is-cyclic.sml
File size: 712 byte(s)
version 110.16
structure GraphIsCyclic : GRAPH_IS_CYCLIC = 
struct

   structure G = Graph

   exception Cyclic

   (*
    * Cyclic test
    *)
   fun is_cyclic (G.GRAPH G) = 
   let val N       = #capacity G () 
       val visited = BitSet.create N
       val done    = BitSet.create N
       fun dfs i =
          if BitSet.markAndTest(visited,i) then
             if BitSet.contains(done,i) then ()
             else raise Cyclic
          else 
             (dfsSucc(#out_edges G i);
              BitSet.set(done,i))
       and dfs'(i,_) = dfs i
       and dfsSucc [] = ()
         | dfsSucc((_,j,_)::es) = (dfs j; dfsSucc es)
   in
       (#forall_nodes G dfs'; false) handle Cyclic => true
   end

end

(* 
 * $Log$
 *)

root@smlnj-gforge.cs.uchicago.edu
ViewVC Help
Powered by ViewVC 1.0.0