Beschreibung |
Ocamlgraph is a graph library which provides the following contribution : - An easy-to-use graph data structure together with several operations and algorithms over graphs. It also provides more complex graph structures ( persistent, imperative, with label for vertices, with label for edges... ) . - Several classic operations and algorithms over graphs. ( Graph traversal, Strongly connected components, Ford-Fulkerson maximal flow algorithm, Delaunay triangulation, Kruskal's algorithm, Goldberg maximal flow algorithm, mirror, complement, transitive_closure ). . Each algorithm is made over functor, those allowing to create your own graph, by only providing a small set of functionality. . Homepage: http://www.lri.fr/~filliatr/ocamlgraph/
|