package forester

  1. Overview
  2. Docs
A tool for tending mathematical forests

Install

Dune Dependency

Authors

Maintainers

Sources

4.3.1.tar.gz
md5=d1623b2919d2984bfcd841b5e772abd1
sha512=5924c8822d7e5a7bc49eb2b451cfd06cb372415559bc5ff232a59395b0aa28eb9819e351426ab25510f7d96ffb85ec652fa1878478b046c61e51ff471c285710

doc/src/forester.core/Addr_graph.ml.html

Source file Addr_graph.ml

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
open Base

module G = Graph.Imperative.Digraph.ConcreteBidirectional (Addr)
include G
include Graph.Oper.I (G)

let safe_succ g x =
  if mem_vertex g x then succ g x else []

let safe_fold_succ f g x acc =
  if mem_vertex g x then
    fold_succ f g x acc
  else
    acc

let safe_pred g x =
  if mem_vertex g x then pred g x else []
OCaml

Innovation. Community. Security.