package forester

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

Install

Dune Dependency

Authors

Maintainers

Sources

4.3.0.tar.gz
md5=4cf7ec6a0a36810572f8b3a2af58631c
sha512=818f859dac00a18807563fd79663ec54232c8df196a8dc2de5e269a1d0c71085b1b490297ea0ecf3ef9cd32e40fb05ad2e10c241b03958c15e25c2942271eede

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.