package libsail

You can search for identifiers within the package.

in-package search v0.2.0

Module `Callgraph.G`Source

include Graph.S
  with type node = Node.t
   and type node_set = Set.Make(Node).t
   and type graph = Graph.Make(Node).graph

Sourcetype node = Node.t

Sourcetype graph = Graph.Make(Node).graph

Sourcetype node_set = Set.Make(Node).t

Sourceval leaves : graph -> node_set

Sourceval empty : graph

Sourceval add_edge : node -> node -> graph -> graph

Add an edge from the first node to the second node, creating the nodes if they do not exist.

Sourceval add_edges : node -> node list -> graph -> graph

Sourceval children : graph -> node -> node list

Sourceval nodes : graph -> node list

Sourceval reachable : node_set -> node_set -> graph -> node_set

Return the set of nodes that are reachable from the first set of nodes (roots), without passing through the second set of nodes (cuts).

Sourceval prune : node_set -> node_set -> graph -> graph

Prune a graph from roots to cuts.

Sourceval remove_self_loops : graph -> graph

Sourceval self_loops : graph -> node list

Sourceval reverse : graph -> graph

Sourceexception Not_a_DAG of node * graph

Sourceval topsort : graph -> node list

Topologically sort a graph. Throws Not_a_DAG if the graph is not directed acyclic.

Sourceval scc : ?original_order:node list -> graph -> node list list

Find strongly connected components using Tarjan's algorithm. This algorithm also returns a topological sorting of the graph components.

val make_dot : 
  (node -> string) ->
  (node -> node -> string) ->
  (node -> string) ->
  out_channel ->
  graph ->
  unit