p06_graphs.ml

type 'a graph_term = { nodes : 'a list;  edges : ('a * 'a) list };;

  (* Conversions *)

  (* Path from one node to another one *)

  (* Cycle from a given node *)

  (* Construct all spanning trees *)

  (* Construct the minimal spanning tree *)

  (* Graph isomorphism *)

  (* Node degree and graph coloration *)

  (* Depth-first order graph traversal *)

  (* Connected components *)

  (* Bipartite graphs *)

  (* Generate K-regular simple graphs with N nodes *)