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/smlnj-lib/Util/graph-scc-sig.sml
ViewVC logotype

View of /sml/trunk/src/smlnj-lib/Util/graph-scc-sig.sml

Parent Directory Parent Directory | Revision Log Revision Log


Revision 496 - (download) (annotate)
Tue Dec 7 15:43:07 1999 UTC (20 years ago) by monnier
File size: 651 byte(s)
Initial revision
(* graph-scc-sig.sml
 *
 * COPYRIGHT (c) 1999 Lucent Bell Laboratories.
 *
 *   Calculate strongly-connected components of directed graph.
 *   The graph can have nodes with self-loops.
 *
 * author: Matthias Blume
 *) 

signature GRAPH_SCC =
  sig

    structure Nd : ORD_KEY

    type node = Nd.ord_key

    datatype component
      = SIMPLE of node			(* singleton, no self-loop *)
      | RECURSIVE of node list

    val topOrder: { root: node, follow: node -> node list } -> component list
	(* take root node and follow function and return
	 * list of topologically sorted strongly-connected components;
	 * root component goes first
	 *)

  end


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