ocaml-maxflow-project/src/tools.mli
2023-12-11 16:04:29 +01:00

26 lines
747 B
OCaml

open Graph
val clone_nodes: 'a graph -> 'b graph
val gmap: 'a graph -> ('a -> 'b) -> 'b graph
val add_arc: int graph -> id -> id -> int -> int graph
(* try not to lose genericity *)
val create_flow_graph: 'a graph -> int graph
val create_flow_graph_2: 'a graph -> 'a graph
val update_flow_graph : int graph -> (int arc -> bool) -> (int arc -> bool) -> int -> int graph
(* val update_flow_graph_2 : 'a graph -> ('a arc -> bool) -> ('a arc -> bool) -> 'a -> 'a graph *)
val check_if_arc_is_in_path : int arc -> int list -> bool
val check_if_backward_arc_is_in_path : int arc -> int list -> bool
val find_max_flow_on_path : int graph -> int graph -> int list -> int option
(*val while_loop : ('a -> bool) -> ('a -> unit) -> 'a -> unit*)