package pfff

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

Install

Dune Dependency

Authors

Maintainers

Sources

0.37.7.tar.gz
md5=d069f379342be72574b4cdc52f4ed9b4
sha512=68e9971364f5e016bad8f94bb72fd15252f19c7964424992309cdb4a9fc922dbe15d07619f500f4bcbc72f820c93d4da20f0759bb4276cd073a29a179bef9300

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
OCaml

Innovation. Community. Security.