man-pages/man3/Strongly_connected_components.Make.3o.html
2021-03-31 01:06:50 +01:00

126 lines
1.8 KiB
HTML

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<HTML><HEAD><TITLE>Man page of Strongly_connected_components.Make</TITLE>
</HEAD><BODY>
<H1>Strongly_connected_components.Make</H1>
Section: OCaml library (3o)<BR>Updated: 2020-01-30<BR><A HREF="#index">Index</A>
<A HREF="/cgi-bin/man/man2html">Return to Main Contents</A><HR>
<A NAME="lbAB">&nbsp;</A>
<H2>NAME</H2>
Strongly_connected_components.Make - no description
<A NAME="lbAC">&nbsp;</A>
<H2>Module</H2>
Module Strongly_connected_components.Make
<A NAME="lbAD">&nbsp;</A>
<H2>Documentation</H2>
<P>
Module
<B>Make</B>
<BR>&nbsp;:&nbsp;
<B>functor (Id : Identifiable.S) -&gt; sig end</B>
<P>
<P>
<P>
<P>
<B>Parameters:</B>
<P>
&quot;Id&quot;
<P>
<B>Identifiable.S</B>
<P>
<P>
<P>
<P>
<P>
<P>
<P>
<I>module Id : </I>
<B>Identifiable.S</B>
<P>
<P>
<P>
<P>
<I>type directed_graph </I>
=
<B>Id.Set.t Id.Map.t</B>
<P>
<P>
If (a -&gt; set) belongs to the map, it means that there are edges
from
<B>a</B>
to every element of
<B>set</B>
. It is assumed that no edge
points to a vertex not represented in the map.
<P>
<P>
<I>type component </I>
=
<BR>&nbsp;|&nbsp;Has_loop
<B>of </B>
<B>Id.t list</B>
<BR>&nbsp;|&nbsp;No_loop
<B>of </B>
<B>Id.t</B>
<BR>&nbsp;
<P>
<P>
<P>
<P>
<I>val connected_components_sorted_from_roots_to_leaf </I>
:
<B>directed_graph -&gt;</B>
<B>component array</B>
<P>
<P>
<P>
<P>
<I>val component_graph </I>
:
<B>directed_graph -&gt;</B>
<B>(component * int list) array</B>
<P>
<P>
<P>
<P>
<HR>
<A NAME="index">&nbsp;</A><H2>Index</H2>
<DL>
<DT id="1"><A HREF="#lbAB">NAME</A><DD>
<DT id="2"><A HREF="#lbAC">Module</A><DD>
<DT id="3"><A HREF="#lbAD">Documentation</A><DD>
</DL>
<HR>
This document was created by
<A HREF="/cgi-bin/man/man2html">man2html</A>,
using the manual pages.<BR>
Time: 00:05:58 GMT, March 31, 2021
</BODY>
</HTML>