GSP
Quick Navigator

Search Site

Unix VPS
A - Starter
B - Basic
C - Preferred
D - Commercial
MPS - Dedicated
Previous VPSs
* Sign Up! *

Support
Contact Us
Online Help
Handbooks
Domain Status
Man Pages

FAQ
Virtual Servers
Pricing
Billing
Technical

Network
Facilities
Connectivity
Topology Map

Miscellaneous
Server Agreement
Year 2038
Credits
 

USA Flag

 

 

Man Pages
Strongly_connected_components.S(3) OCaml library Strongly_connected_components.S(3)

Strongly_connected_components.S - no description

Module type Strongly_connected_components.S

Module type S
= sig end

module Id : Identifiable.S

type directed_graph = Id.Set.t Id.Map.t

If (a -> set) belongs to the map, it means that there are edges from a to every element of set . It is assumed that no edge points to a vertex not represented in the map.

type component =
| Has_loop of Id.t list
| No_loop of Id.t

val connected_components_sorted_from_roots_to_leaf : directed_graph -> component array

val component_graph : directed_graph -> (component * int list) array

2025-07-03 OCamldoc

Search for    or go to Top of page |  Section 3 |  Main Index

Powered by GSP Visit the GSP FreeBSD Man Page Interface.
Output converted with ManDoc.