SCM Repository
[smlnj] / MLRISC / trunk / graphs / graph-scc.sig |
View of /MLRISC/trunk/graphs/graph-scc.sig
Parent Directory | Revision Log
Revision 641 -
(download)
(as text)
(annotate)
Thu May 11 01:16:45 2000 UTC (19 years, 4 months ago) by leunga
Original Path: sml/trunk/src/MLRISC/graphs/graph-scc.sig
File size: 609 byte(s)
Thu May 11 01:16:45 2000 UTC (19 years, 4 months ago) by leunga
Original Path: sml/trunk/src/MLRISC/graphs/graph-scc.sig
File size: 609 byte(s)
Various bug fixes and new features for C--, Moby and MLRISC optimizations. See smlnj/HISTORY for details. CVS tag: leunga-20000510-moby-c--ssa
(* * This module computes strongly connected components (SCC) of * a graph. Each SCC is represented as a list of nodes. All nodes * are folded together with a user supplied function. * * -- Allen *) signature GRAPH_STRONGLY_CONNECTED_COMPONENTS = sig (* strongly connected components *) val scc : ('n,'e,'g) Graph.graph -> (Graph.node_id list * 'a -> 'a) -> 'a -> 'a val scc' : {N : int, nodes : Graph.node_id list, out_edges : Graph.node_id -> 'e Graph.edge list } -> (Graph.node_id list * 'a -> 'a) -> 'a -> 'a end
root@smlnj-gforge.cs.uchicago.edu | ViewVC Help |
Powered by ViewVC 1.0.0 |