SCM Repository
[smlnj] / MLRISC / trunk / graphs / graph-cycles.sig |
View of /MLRISC/trunk/graphs/graph-cycles.sig
Parent Directory | Revision Log
Revision 411 -
(download)
(as text)
(annotate)
Fri Sep 3 00:25:03 1999 UTC (20 years ago) by monnier
Original Path: sml/branches/SMLNJ/src/MLRISC/graphs/graph-cycles.sig
File size: 452 byte(s)
Fri Sep 3 00:25:03 1999 UTC (20 years ago) by monnier
Original Path: sml/branches/SMLNJ/src/MLRISC/graphs/graph-cycles.sig
File size: 452 byte(s)
version 110.19
(* * This module enumerates all simple cycles in a graph. * Each cycle is reprensented as a list of edges. Adjacent edges * are adjacent in the list. The function works like fold: all cycles * are ``folded'' together with a user supplied function. * * -- Allen *) signature GRAPH_SIMPLE_CYCLES = sig (* enumerate all simple cycles *) val cycles : ('n,'e,'g) Graph.graph -> ('e Graph.edge list * 'a -> 'a) -> 'a -> 'a end
root@smlnj-gforge.cs.uchicago.edu | ViewVC Help |
Powered by ViewVC 1.0.0 |