package pfff

  1. Overview
  2. Docs
Tools and APIs for program analysis, code visualization, refactoring

Install 

dune-project
 Dependency

github.com Edit opam file Versions (8)

Authors

  1. Y
    Yoann Padioleau <yoann.padioleau@gmail.com>

Maintainers

  1. Y
    yoann.padioleau@gmail.com

Sources

0.39.4.tar.gz
md5=9aabf597b6de59ced5a3ecfadb1c9a13
sha512=8f4762840b8de0a76a8cbd972e6a4babd7b17e3830b65b5eaff017711bd247f88a29d04d64b6bd31fa3610d5e045bb48ddaaf58b279fcac19a1c53590f0b411e

doc/pfff-commons-graph/Graphe/index.html

Module Graphe

type 'a graph
val create : unit -> 'a graph
val add_vertex_if_not_present : 'a -> 'a graph -> unit
val add_edge : 'a -> 'a -> 'a graph -> unit
val remove_vertex : 'a -> 'a graph -> unit
val remove_edge : 'a -> 'a -> 'a graph -> unit
val copy : 'a graph -> 'a graph
val nodes : 'a graph -> 'a list
val succ : 'a -> 'a graph -> 'a list
val pred : 'a -> 'a graph -> 'a list
val out_degree : 'a -> 'a graph -> int
val in_degree : 'a -> 'a graph -> int
val has_node : 'a -> 'a graph -> bool
val nb_nodes : 'a graph -> int
val nb_edges : 'a graph -> int
val iter_edges : ('a -> 'a -> unit) -> 'a graph -> unit
val iter_nodes : ('a -> unit) -> 'a graph -> unit
val entry_nodes : 'a graph -> 'a list
val ivertex : 'a -> 'a graph -> int
val shortest_path : 'a -> 'a -> 'a graph -> 'a list
val transitive_closure : 'a graph -> 'a graph
val mirror : 'a graph -> 'a graph
val strongly_connected_components : 'a graph -> 'a list array * ('a, int) Hashtbl.t
val strongly_connected_components_condensation : 'a graph -> ('a list array * ('a, int) Hashtbl.t) -> int graph
val depth_nodes : 'a graph -> ('a, int) Hashtbl.t
val print_graph_generic : ?launch_gv:bool -> ?extra_string:string -> str_of_key:('a -> string) -> Common.filename -> 'a graph -> unit
val display_with_gv : 'a graph -> unit
val display_strongly_connected_components : str_of_key:('a -> string) -> ('a, int) Hashtbl.t -> 'a graph -> unit
val stat : 'a graph -> unit