Commit 822ce6f6 authored by POTTIER Francois's avatar POTTIER Francois
Browse files

Re-ordering.

parent dbf87984
...@@ -18,14 +18,14 @@ module Make (G : sig ...@@ -18,14 +18,14 @@ module Make (G : sig
val sources: (node -> unit) -> unit val sources: (node -> unit) -> unit
(* Whether a node is a goal node. *)
val is_goal: node -> bool
(* [successors n f] presents each of [n]'s successors, in (* [successors n f] presents each of [n]'s successors, in
an arbitrary order, to [f], together with the cost of an arbitrary order, to [f], together with the cost of
the edge that was followed. *) the edge that was followed. *)
val successors: node -> (label -> int -> node -> unit) -> unit val successors: node -> (label -> int -> node -> unit) -> unit
(* Whether a node is a goal node. *)
val is_goal: node -> bool
(* An estimate of the cost of the shortest path from the (* An estimate of the cost of the shortest path from the
supplied node to some goal node. This estimate must supplied node to some goal node. This estimate must
be a correct under-approximation of the actual cost. *) be a correct under-approximation of the actual cost. *)
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment