module Path_analysis: sig
.. end
since Nitrogen-20111001
val voisins : 'a * 'b Promelaast.trans list ->
Promelaast.state -> (Promelaast.state * int) list
val empty : unit -> 'a list
val is_empty : 'a list -> bool
val add : 'a * ('b * 'c) -> ('a * ('b * 'c)) list -> ('a * ('b * 'c)) list
: ('a * 'b) list -> ('a * 'b) * ('a * 'b) list
val dijkstra : ('a -> ('a * int) list) -> 'a -> 'a -> 'a list * int
val existing_path : Promelaast.state list * 'a Promelaast.trans list -> int -> int -> bool
val get_transitions_of_state : Promelaast.state -> 'a * 'b Promelaast.trans list -> 'b Promelaast.trans list
since Nitrogen-20111001
val get_transitions_to_state : Promelaast.state -> 'a * 'b Promelaast.trans list -> 'b Promelaast.trans list
val get_edges : Promelaast.state ->
Promelaast.state -> 'a * 'b Promelaast.trans list -> 'b Promelaast.trans list
val get_init_states : Promelaast.state list * 'a -> Promelaast.state list
val at_most_one_path : 'a * 'b Promelaast.trans list -> Promelaast.state -> Promelaast.state -> bool
val test : Promelaast.state list * 'a Promelaast.trans list -> unit