From e5ee087f1555582ba0c98a1890663eed9a4c2abb Mon Sep 17 00:00:00 2001
From: Thomas Bauereiss
Date: Fri, 21 Feb 2020 14:12:50 +0000
Subject: Move topological sorting code to graph.ml

---
 src/graph.mli | 5 +++++
 1 file changed, 5 insertions(+)

(limited to 'src/graph.mli')

diff --git a/src/graph.mli b/src/graph.mli
index 09b78304..cb29daae 100644
--- a/src/graph.mli
+++ b/src/graph.mli
@@ -91,6 +91,11 @@ module type S =
        not directed acyclic. *)
     val topsort : graph -> node list
 
+    (** Find strongly connected components using Tarjan's algorithm.
+        This algorithm also returns a topological sorting of the graph
+        components. *)
+    val scc : ?original_order:(node list) -> graph -> node list list
+
     val make_dot : (node -> string) -> (node -> node -> string) -> (node -> string) -> out_channel -> graph -> unit
   end
 
-- 
cgit v1.2.3