-394

CHANGES

reviewed

··· 1 1 - 2 2 - * marks some incompatible change 3 3 - 4 4 - o [WeakTopological] fixed incorrect use of generic hash tables 5 5 - (#99, Tomáš Dacík) 6 6 - o [Oper] fixed transitive_reduction (#91) 7 7 - o fix incorrect uses of polymorphic equality (Steffen Smolka, Boris Yakobowski) 8 8 - o [Coloring] fixed generation of OCamlDoc documentation 9 9 - (contributed by Earnestly) 10 10 - * [Coloring] functions now fail if the graph is directed 11 11 - * [Coloring] now uses a single, global exception [NoColoring] 12 12 - o [Coloring] new function two_color to 2-color a graph (or fail) 13 13 - * [Fixpoint] Take initial labeling of nodes into account (Johannes Kloos) 14 14 - 15 15 - version 1.8.8, October 17, 2017 16 16 - ------------------------------- 17 17 - o fixed installation (Virgile Prevosto, Jacques-Pascal Deplaix) 18 18 - o safe-string compatible (Jacques-Pascal Deplaix) 19 19 - * fixed method get_edge_layout of class abstract_model of DGraphModel.Make. The 20 20 - bug could have occured when there are several edges between two vertices. 21 21 - o [Traverse/Pack] added Dfs.fold and Dfs.fold_component (tail-recursive) 22 22 - (contributed by Guillaume Chelfi) 23 23 - * fixed implementation of Golberg-Tarjan maximal flow algorithm 24 24 - (contributed by Guyslain Naves) 25 25 - No more function min_capacity in the input interface. 26 26 - Renaming as follows: Flow.Goldberg -> Flow.Goldberg_Tarjan 27 27 - and Pack.goldberg -> Pack.goldberg_tarjan 28 28 - o new functors [WeakTopological] and [ChaoticIteration] to compute 29 29 - fixpoints with widening, following Bourdoncle's algorithms (contributed 30 30 - by Thibault Suzanne) 31 31 - 32 32 - version 1.8.7, April 12, 2016 33 33 - ----------------------------- 34 34 - o fixed examples/demo.ml so that it also compiles with an installed OCamlGraph 35 35 - o [Components] fixed stack overflow with [scc] (patch by Albin Coquereau) 36 36 - o [Dominator] fixed stack overflow (patch by Albin Coquereau) 37 37 - o new functor [Path.Johnson] to compute all pairs of shortest paths 38 38 - using Johnson's algorithm (contributed by Mário Pereira) 39 39 - o fixed configuration on Windows (patch by Martin R. Neuhäußer) 40 40 - o new functor [Components.Undirected] to compute connected components 41 41 - o Graphviz: fixed printing of attribute BgcolorWithTransparency 42 42 - * Prim, Nonnegative: function weight now has the more general type "edge -> t" 43 43 - (to be consistent with Path) 44 44 - o new module type Sig.WEIGHT (used in Path, Prim, and Nonnegative) 45 45 - o Fixpoint: do not catch Not_found raised by a user-provided function. 46 46 - o Adding folds to BFS. 47 47 - 48 48 - version 1.8.6, January 23, 2015 49 49 - ------------------------------- 50 50 - * Dominator: new functor [Make_graph] with may use graph building operations, 51 51 - while the old functor [Make] now only requires a read-only graph. 52 52 - Function [compute_all] and [compute_dom_graph] are now only defined in the 53 53 - new [Make_graph] functor. 54 54 - o Graphviz: support for additional polygonal-shapes 55 55 - o New module Clique (contributed by Giselle Reis) 56 56 - o Avoid ocamldoc error with OCaml 4.02 57 57 - * Path: function weight now has the more general type "edge -> t" 58 58 - (contributed by Steffen Smolka) 59 59 - update your code by turning "weight l" into "weight (G.E.label e)" 60 60 - o installation: "make install-findlib" now uses DESTDIR when defined 61 61 - o Traverse: documentation is clarified: providing iterators over the roots of 62 62 - the graph is enough. 63 63 - o Imperative concreate (di)graph: fix bug of functions add_edge* of imperative 64 64 - concrete (di)graphs which appears when the added edge [e] was already in the 65 65 - graph [g] and one of the vertices of [e] is equal to another vertex of [g] 66 66 - (when using the user-defined equality [G.V.equal]), but not physically equal 67 67 - to it. This bug only occurs with OCaml version >= 4.0. 68 68 - o functions in modules Components, Dominator, Flow, Topological and Traverse 69 69 - now create smaller auxiliary hash tables 70 70 - o Graphviz: add the attribute `HtmlLabel to specify html strings. 71 71 - 72 72 - version 1.8.5, March 4, 2014 73 73 - ----------------------------- 74 74 - o Graphviz: reverted to the old API where edges and vertices are 75 75 - given a single style attribute; but such attributes are collected 76 76 - and output in the DOT file into a list (thus allowing multiple style 77 77 - attributes) 78 78 - o fixed issue in ./configure with ocamlfind on Win32. 79 79 - o fixed compilation when laglgnomecanvas is missing (bug introduced in 1.8.4). 80 80 - o fixed more issues with 'make -j'. 81 81 - 82 82 - version 1.8.4, February 4, 2014 83 83 - ------------------------------- 84 84 - o fixed [Graphml] printer (contributed by Johannes Schauer) 85 85 - o Components: the components of [scc_list] are provided in the same order than 86 86 - the ones of [scc_array]. 87 87 - o fix compilation with 'make -j' 88 88 - o Graphviz: handle attribute penwidth on edges and vertices 89 89 - o also install graph.o and graph.cmxs 90 90 - o fixed installation with ocamlfind (thanks to Virgile Prevosto) 91 91 - o new functions [gnp] and [gnp_labeled] in module [Rand] to generate random 92 92 - graphs using the G(n,p) model (contributed by Thomas Aubry) 93 93 - o Prim's algorithm (in module [Prim]; not exported in [Pack]) 94 94 - (contributed by Thomas Aubry) 95 95 - o Graphviz: support for nested subgraphs. (Backward-incompatible change: 96 96 - add 'sg_parent = None' to obtain subgraphs whose parents are the main graph) 97 97 - o Graphviz: edges and vertices can now receive multiple styles. 98 98 - (Backward-incompatible change: constructors `Style now require a list as 99 99 - argument) 100 100 - o Graphviz: new vertex style 'rounded' 101 101 - o Merge: fixed bug with vertices with no incoming nor outcoming edge. 102 102 - o fixed compilation issue with OCaml 3.12.1 103 103 - 104 104 - version 1.8.3, April 17, 2013 105 105 - ----------------------------- 106 106 - o new module Merge implementing several different merges of vertices and 107 107 - edges into a graph (contributed by Emmanuel Haucourt) 108 108 - o fixed DOT parser (contributed by Alex Reece) 109 109 - o Topological: fixed bug in presence of disjoint cycles; new implementation 110 110 - o new module [Graphml] to export graphs into the graphml format 111 111 - (contributed by Pietro Abate) 112 112 - o Builder.S now contains functions remove_*. 113 113 - o modified Fixpoint module so that it also works with unlabeled 114 114 - graphs, break backward compatibility yet (contributed by Markus W. Weissmann) 115 115 - o support of lablgtk2 installed with findlib (contributed by B. Monate) 116 116 - o new module [Dominator] to compute dominators 117 117 - (contributed by David Brumley and Ivan Jager) 118 118 - 119 119 - version 1.8.2, May 12, 2012 120 120 - --------------------------- 121 121 - o new module [Path.BellmanFord] implementing Bellman-Ford algorithm 122 122 - (contributed by Yuto Takei) 123 123 - o new module Contraction implementing edge contraction 124 124 - (contributed by Markus W. Weissmann) 125 125 - o Gmap: new function [filter_map] (contributed by Markus W. Weissmann) 126 126 - o Topological: fix bug when a cycle depends on another cycle. That breaks 127 127 - compatibility: the input graph must implement Sig.COMPARABLE instead of 128 128 - Sig.HASHABLE 129 129 - o new module Topological.Make_stable to iterate over a graph in a **stable** 130 130 - topological order. Stable means that the provided ordering only depends on 131 131 - the graph topology and on the user's vertices ordering. 132 132 - o new module Leaderlist to compute the leader list algorithm (see the Dragon) 133 133 - (contributed by Markus W. Weissmann <markus.weissmann@in.tum.de>) 134 134 - 135 135 - version 1.8.1, October 17, 2011 136 136 - ------------------------------- 137 137 - o module Gmap now has a signature for edges (E_SRC) compatible with 138 138 - Sig, so that it is easier to apply functor Gmap.Edge 139 139 - (contributed by Markus W. Weissmann <markus.weissmann@in.tum.de>) 140 140 - o new module Fixpoint to compute fixpoints using the work-list 141 141 - algorithm, e.g. for data flow analysis 142 142 - (contributed by Markus W. Weissmann <markus.weissmann@in.tum.de>) 143 143 - 144 144 - version 1.8, October 4, 2011 145 145 - ---------------------------- 146 146 - o removed ocamlyacc shift/reduce conflict in dot_parser.mly 147 147 - (patch contributed by Till Varoquaux) 148 148 - o Dgraph: Correct height and width-related problems with text 149 149 - o DGraph: many bug fixes. Patch by Benjamin Monate 150 150 - o Sig.G: new function [find_all_edges] for each graph implementation 151 151 - o Oper: fixed bug with function [intersect]: now use G.E.compare instead of (=) 152 152 - o fixed "make install-findlib" 153 153 - 154 154 - version 1.7, February 23, 2011 155 155 - ------------------------------ 156 156 - o Makefile: fixed bug when installing ocamlgraph with ocamlfind 157 157 - o DGraph: fixed bug with colors on some windows manager 158 158 - o Configure: fixed issue with automatic detection of extension under 159 159 - Windows/Mingw 160 160 - 161 161 - version 1.6, December 13, 2010 162 162 - ------------------------------ 163 163 - o DGraph: new viewer mode (called `tree') which focus on a subset part of the 164 164 - graph centered on a given node 165 165 - o Graphviz: fixed bug with attribute `Constraint (was `Constraints) (patch by 166 166 - Boris Yakobowski) 167 167 - o DGraph: fixed font size issue when zooming 168 168 - o DGraph: now interpret text anchors and espaced sequences correctly 169 169 - o DGraph: offer possibility to disable the default callbacks on nodes 170 170 - o 'make -j' works again 171 171 - o new implementation Persistent.Digraph.ConcreteBidirectionalLabeled 172 172 - o new implementation Persistent.Digraph.ConcreteBidirectional 173 173 - o Makefile: bug fixed when ocamlc (resp. ocamlopt) and ocamlc.opt 174 174 - (resp. ocamlopt.opt) are unconsistent 175 175 - 176 176 - version 1.5, April 29, 2010 177 177 - --------------------------- 178 178 - o Makefile: bug fixed when installing ocamlgraph with ocamlfind 179 179 - (patch by Virgile Prevosto) 180 180 - o DGraph: new method set_zoom_padding in DgraphView.view 181 181 - o Traverse.Dfs.has_cycle: can now be used on undirected graphs as well, 182 182 - and is now tail recursive 183 183 - o DGraph: handle dotted ellipse 184 184 - 185 185 - version 1.4, March 24, 2010 186 186 - --------------------------- 187 187 - o new function [clear] for imperative graphs 188 188 - o new implementation Imperative.Digraph.ConcreteBidirectionalLabeled 189 189 - (contribution of Jaap Boender) 190 190 - o Dgraph displays graphs faster 191 191 - o DGraph: several bugs fixed 192 192 - o DGraph: several API changes 193 193 - (may break compatibility with existing development) 194 194 - 195 195 - version 1.3, October 2, 2009 196 196 - ---------------------------- 197 197 - o Oper.mirror: undirected graphs are not copied anymore 198 198 - o Oper.mirror: fixed bug (isolated vertices were lost) 199 199 - o Graphviz: new signature GraphWithDotAttrs 200 200 - o Improvements of Dgraph 201 201 - o Configure: better test for detecting lablgtk 202 202 - o OcamlGraph is now installed by default in `ocamlc -where`/ocamlgraph 203 203 - o Viewgraph is now packed in a single module Viewgraph (break compatibility 204 204 - with previous version) 205 205 - o Dgraph is now packed in a single module Dgraph (break compatibility with 206 206 - previous version) 207 207 - o Makefile: fixed bug when the installation directory of binaries does not 208 208 - exist 209 209 - o Makefile: fixed bug of ocamldep under Windows 210 210 - 211 211 - version 1.2, August 31, 2009 212 212 - ---------------------------- 213 213 - o experimental: new GTK-based graph viewer called Dgraph 214 214 - (viewGraph is now deprecated) 215 215 - o added Delaunay.iter_triangles (not of use in Ocamlgraph, actually) 216 216 - 217 217 - version 1.1, June 23, 2009 218 218 - -------------------------- 219 219 - o added constraint "type E.label = unit" to unlabeled graph data structure 220 220 - o viewGraph: new module viewGraph_utils; fixed compilation (gtkInit 221 221 - was missing; patch by Mehdi Dogguy) 222 222 - o configure: fixed bug under Cygwin (patch by Julien Bernet) 223 223 - o configure: look for lablgnomecanvas.cmxa when compiling in native code 224 224 - o Makefile: fixed make install-findlib when lablgtk and/or 225 225 - lablgnomecanvas not installed (patch by Peter Hawkins) 226 226 - 227 227 - version 1.0, October 14, 2008 228 228 - ----------------------------- 229 229 - o license: LGPL updated to version 2.1 230 230 - o ocamlgraph now requires ocaml 3.10 or higher 231 231 - o experimental: GTK-based graph viewer based on dot 232 232 - (contribution of Anne Pacalet) 233 233 - o Makefile: 234 234 - - fixed bug when lablgnomecanvas is not installed 235 235 - - fixed bug when ocamlfind is installed 236 236 - - patch to the build system for a DESTDIR (patch by Igor Galic) 237 237 - - "make -j" compliant 238 238 - o new function Blocks.after_unserialization in order to be able to safely 239 239 - serialize abstract vertices (see the FAQ) 240 240 - o Dot: 241 241 - - fixed bug in the parsing of attributes 242 242 - - fixed bug in the parsing of subgraphs (patch by Anne Pacalet) 243 243 - o Oper: fixed bug in intersect 244 244 - o Path: improved efficiency of Dijkstra 245 245 - o Topological: 246 246 - - fixed bug in Make.{iter,fold} 247 247 - - folding is now tail-recursive (patch by Michael Furr) 248 248 - 249 249 - version 0.99c, April 3rd, 2008 250 250 - ------------------------------ 251 251 - o replicated a bug fix of Bitv (could not affect Matrix, though) 252 252 - o fixed DFS traversal in Traverse.Dfs.{prefix,prefix_component,iterator} 253 253 - 254 254 - version 0.99b, December 18th, 2007 255 255 - ---------------------------------- 256 256 - o fixed link bug with ocaml 3.09 257 257 - (see http://caml.inria.fr/mantis/view.php?id=4124) 258 258 - 259 259 - version 0.99a, November 21st, 2007 260 260 - --------------------------------- 261 261 - o fixed bug in Makefile when lablgtk2 is not installed 262 262 - o Sig.I.create and Sig_pack.create are now of type ?size:int -> unit -> t 263 263 - (instead of unit -> t) to indicate an initial guess on the graph size 264 264 - 265 265 - version 0.99, June 27th, 2007 266 266 - ----------------------------- 267 267 - o experimental: GTK-based graph editor based on hyperbolic geometry; 268 268 - to build it and test it, cd to editor/ and type make 269 269 - o [Components.Make] functor: function [scc] as a new profile and a 270 270 - more precise specification. New function [scc_array]. 271 271 - o fixed configure to set ocaml's standard library using "ocamlc -where" 272 272 - o new module Dot to parse files in Graphviz's DOT format 273 273 - o slight change in the license (no more clause 6 of the LGPL; see LICENSE) 274 274 - o new module Strat implementing simple game strategies 275 275 - o Graphviz: little refactoring and improved documentation 276 276 - 277 277 - version 0.98, Sep 27th, 2006 278 278 - ---------------------------- 279 279 - o rename Sig.IA to Sig.IM 280 280 - o add subgraph support in Graphviz 281 281 - (breaks ascendent compatibility if you use Graphviz: by default add 282 282 - let get_subgraph _ = None 283 283 - in the argument of Graphviz.Dot and Graphviz.Neato) 284 284 - 285 285 - version 0.97, July 20th, 2006 286 286 - ----------------------------- 287 287 - o fixed compilation under Windows/Cygwin (contributed by Denis Berthod) 288 288 - o fixed bug with escaped string in Graphviz 289 289 - 290 290 - version 0.96, May 2nd, 2006 291 291 - --------------------------- 292 292 - o new demo program: sudoku.ml (solving the Sudoku using graph coloring) 293 293 - o new module Coloring for (rather brute force) graph coloring 294 294 - o new implementation Imperative.Digraph.ConcreteBidirectional 295 295 - that maintains the set of ingoing edges for each node, thus improving the 296 296 - efficiency of functions such as iter_pred, pred, in_degree, etc. 297 297 - (contributed by Ted Kremenek) 298 298 - 299 299 - version 0.95, November 2nd, 2005 300 300 - -------------------------------- 301 301 - o compatibility with ocaml 3.09 302 302 - o new module Path.Check to check for paths 303 303 - 304 304 - version 0.94, July 6th, 2005 305 305 - ---------------------------- 306 306 - o new module Gml to parse and print graphs in GML file format 307 307 - (see http://www.infosun.fmi.uni-passau.de/Graphlet/GML) 308 308 - corresponding functions parse_gml_file and print_gml_file in Pack 309 309 - o added display_with_gv in Pack 310 310 - o improved implementation of Unionfind (patch by Marc Lasson) 311 311 - 312 312 - version 0.93, March 31st, 2005 313 313 - ------------------------------ 314 314 - o fixed bug in Rand (integer overflow causing Invalid_argument "random"); 315 315 - improved code in Rand 316 316 - o bug fixed in the META file 317 317 - o add find_edge in Sig.G (and so in all graph implementations) 318 318 - 319 319 - version 0.92, January 18th, 2005 320 320 - -------------------------------- 321 321 - o fixed escaped labels in Graphviz output (patch by Boris Yakobowski) 322 322 - o new Graphviz option OrderingOut (patch by Boris Yakobowski) 323 323 - o fixed sharing bugs in Oper (patch by Boris Yakobowski) 324 324 - o fixed bug in nb_edges for undirected graphs 325 325 - o improvement of iterators of undirected concrete graphs 326 326 - 327 327 - version 0.91, December 16th, 2004 328 328 - --------------------------------- 329 329 - o more precise specifications of remove_edge and shortest_path. 330 330 - o bug fixed in mem_edge_e of labelled graphs 331 331 - o generation of random graphs improved 332 332 - o add Rand.Make and Rand.Planar.Make (generic functors) 333 333 - o add signatures Persistent.S and Imperative.S 334 334 - 335 335 - version 0.90, November 30th, 2004 336 336 - --------------------------------- 337 337 - o graph.cma graph.cmxa 338 338 - o version.ml and META files are now writable 339 339 - o add interfaces Sig.VERTEX and Sig.EDGE 340 340 - o "sig.ml" and "sig_pack.ml" removed; ocamlgraph now requires ocaml 3.08.0 341 341 - o improvement of Minsep 342 342 - o add Components.scc_list 343 343 - o Oper.Neighbourhood replaces Neighborhood 344 344 - o Gmap replaces Copy 345 345 - o add types Sig_pack.vertex and Sig_pack.edge 346 346 - o fixed bug in Ford-Fulkerson: G.V.equal instead of = in two asserts 347 347 - 348 348 - version 0.81, July 13th, 2004 349 349 - ----------------------------- 350 350 - o compatibility with ocaml 3.08 351 351 - o Oper.Choose.choose_edge: choose an edge in a graph 352 352 - o add types Sig.G.edge and Sig.G.vertex resp. equal to Sig.G.V.t and Sig.G.E.t 353 353 - o fixed typos in invalid_arg arguments (in Bitv) 354 354 - 355 355 - version 0.80, June 28th, 2004 356 356 - ----------------------------- 357 357 - o major contribution by Matthieu Sozeau and Pierre-Loïc Garoche. 358 358 - New modules are: 359 359 - - Md: Minimum Degree algorithm 360 360 - - Cliquetree: the clique tree of a graph 361 361 - - Mcs_m: Maximal Cardinality Search (MCS-M) algorithm 362 362 - - Minsep: Minimal separators of a graph 363 363 - - Neighborhood: compute the neighborhood of a vertex/some vertices 364 364 - - Oper.Difference: subgraphs induced by the elimination of some vertices 365 365 - - Oper.Choose: choose a vertex in a graph 366 366 - - Copy: graphs copying 367 367 - - Util.DataV: create a vertex type with data attached to it 368 368 - o out_degree: raises Invalid_argument if v not in g (instead of Not_found) 369 369 - o Pack.Graph: golberg/ford_fulkerson fail ("not a directed graph") 370 370 - 371 371 - version 0.70, Feb 27th, 2004 372 372 - ---------------------------- 373 373 - o Makefile.in: dependences ("make -j" works) 374 374 - o union and intersection (see Oper.S.union and Oper.S.intersection) 375 375 - o Golberg/Ford_fulkerson algorithms in a single module Flow 376 376 - o step-by-step iterators in Traverse.{Dfs,Bfs} 377 377 - o Ford_fulkerson: maxflow now returns a flow function over edges 378 378 - 379 379 - version 0.60, Feb 18th, 2004 380 380 - ---------------------------- 381 381 - o fixed bug in Ford-Fulkerson 382 382 - o random planar graphs (see Rand.Planar) 383 383 - o Delaunay triangulation (see Delaunay) 384 384 - o implementations with adjacency matrices (see Imperative.Matrix) 385 385 - o operations on predecessors for undirected graphs optimized 386 386 - o Traverse.Dfs.{prefix,prefix_component} optimized (now tail recursive) 387 387 - 388 388 - version 0.50, Feb 4th, 2004 389 389 - --------------------------- 390 390 - o first release 391 391 - 392 392 - Local Variables: 393 393 - mode: text 394 394 - End:

+392

CHANGES.md

reviewed

··· 1 1 + 2 2 + # 2.0.0 3 3 + 4 4 + - [WeakTopological] fixed incorrect use of generic hash tables 5 5 + (#99, Tomáš Dacík) 6 6 + - [Oper] fixed transitive_reduction (#91) 7 7 + - fix incorrect uses of polymorphic equality (Steffen Smolka, Boris Yakobowski) 8 8 + - [Coloring] fixed generation of OCamlDoc documentation 9 9 + (contributed by Earnestly) 10 10 + - * [Coloring] functions now fail if the graph is directed 11 11 + - * [Coloring] now uses a single, global exception [NoColoring] 12 12 + - [Coloring] new function two_color to 2-color a graph (or fail) 13 13 + - * [Fixpoint] Take initial labeling of nodes into account (Johannes Kloos) 14 14 + 15 15 + # 1.8.8, October 17, 2017 16 16 + 17 17 + - fixed installation (Virgile Prevosto, Jacques-Pascal Deplaix) 18 18 + - safe-string compatible (Jacques-Pascal Deplaix) 19 19 + - * fixed method get_edge_layout of class abstract_model of DGraphModel.Make. The 20 20 + bug could have occured when there are several edges between two vertices. 21 21 + - [Traverse/Pack] added Dfs.fold and Dfs.fold_component (tail-recursive) 22 22 + (contributed by Guillaume Chelfi) 23 23 + - * fixed implementation of Golberg-Tarjan maximal flow algorithm 24 24 + (contributed by Guyslain Naves) No more function min_capacity in 25 25 + the input interface. Renaming as follows: Flow.Goldberg -> 26 26 + Flow.Goldberg_Tarjan and Pack.goldberg -> Pack.goldberg_tarjan 27 27 + - new functors [WeakTopological] and [ChaoticIteration] to compute 28 28 + fixpoints with widening, following Bourdoncle's algorithms (contributed 29 29 + by Thibault Suzanne) 30 30 + 31 31 + # 1.8.7, April 12, 2016 32 32 + 33 33 + - fixed examples/demo.ml so that it also compiles with an installed OCamlGraph 34 34 + - [Components] fixed stack overflow with [scc] (patch by Albin Coquereau) 35 35 + - [Dominator] fixed stack overflow (patch by Albin Coquereau) 36 36 + - new functor [Path.Johnson] to compute all pairs of shortest paths 37 37 + using Johnson's algorithm (contributed by Mário Pereira) 38 38 + - fixed configuration on Windows (patch by Martin R. Neuhäußer) 39 39 + - new functor [Components.Undirected] to compute connected components 40 40 + - Graphviz: fixed printing of attribute BgcolorWithTransparency 41 41 + - * Prim, Nonnegative: function weight now has the more general type "edge -> t" 42 42 + (to be consistent with Path) 43 43 + - new module type Sig.WEIGHT (used in Path, Prim, and Nonnegative) 44 44 + - Fixpoint: do not catch Not_found raised by a user-provided function. 45 45 + - Adding folds to BFS. 46 46 + 47 47 + # 1.8.6, January 23, 2015 48 48 + 49 49 + - * Dominator: new functor [Make_graph] with may use graph building operations, 50 50 + while the old functor [Make] now only requires a read-only graph. 51 51 + Function [compute_all] and [compute_dom_graph] are now only defined in the 52 52 + new [Make_graph] functor. 53 53 + - Graphviz: support for additional polygonal-shapes 54 54 + - New module Clique (contributed by Giselle Reis) 55 55 + - Avoid ocamldoc error with OCaml 4.02 56 56 + - * Path: function weight now has the more general type "edge -> t" 57 57 + (contributed by Steffen Smolka) 58 58 + update your code by turning "weight l" into "weight (G.E.label e)" 59 59 + - installation: "make install-findlib" now uses DESTDIR when defined 60 60 + - Traverse: documentation is clarified: providing iterators over the roots of 61 61 + the graph is enough. 62 62 + - Imperative concreate (di)graph: fix bug of functions add_edge* of 63 63 + imperative concrete (di)graphs which appears when the added edge 64 64 + [e] was already in the graph [g] and one of the vertices of [e] is 65 65 + equal to another vertex of [g] (when using the user-defined 66 66 + equality [G.V.equal]), but not physically equal to it. This bug 67 67 + only occurs with OCaml version >= 4.0. 68 68 + - functions in modules Components, Dominator, Flow, Topological and 69 69 + Traverse now create smaller auxiliary hash tables 70 70 + - Graphviz: add the attribute `HtmlLabel to specify html strings. 71 71 + 72 72 + # 1.8.5, March 4, 2014 73 73 + 74 74 + - Graphviz: reverted to the old API where edges and vertices are 75 75 + given a single style attribute; but such attributes are collected 76 76 + and output in the DOT file into a list (thus allowing multiple 77 77 + style attributes) 78 78 + - fixed issue in ./configure with ocamlfind on Win32. 79 79 + - fixed compilation when laglgnomecanvas is missing (bug introduced in 1.8.4). 80 80 + - fixed more issues with 'make -j'. 81 81 + 82 82 + # version 1.8.4, February 4, 2014 83 83 + 84 84 + - fixed [Graphml] printer (contributed by Johannes Schauer) 85 85 + - Components: the components of [scc_list] are provided in the same order than 86 86 + the ones of [scc_array]. 87 87 + - fix compilation with 'make -j' 88 88 + - Graphviz: handle attribute penwidth on edges and vertices 89 89 + - also install graph.o and graph.cmxs 90 90 + - fixed installation with ocamlfind (thanks to Virgile Prevosto) 91 91 + - new functions [gnp] and [gnp_labeled] in module [Rand] to generate random 92 92 + graphs using the G(n,p) model (contributed by Thomas Aubry) 93 93 + - Prim's algorithm (in module [Prim]; not exported in [Pack]) 94 94 + (contributed by Thomas Aubry) 95 95 + - Graphviz: support for nested subgraphs. (Backward-incompatible change: 96 96 + add 'sg_parent = None' to obtain subgraphs whose parents are the main graph) 97 97 + - Graphviz: edges and vertices can now receive multiple styles. 98 98 + (Backward-incompatible change: constructors `Style now require a 99 99 + list as argument) 100 100 + - Graphviz: new vertex style 'rounded' 101 101 + - Merge: fixed bug with vertices with no incoming nor outcoming edge. 102 102 + - fixed compilation issue with OCaml 3.12.1 103 103 + 104 104 + # 1.8.3, April 17, 2013 105 105 + 106 106 + - new module Merge implementing several different merges of vertices and 107 107 + edges into a graph (contributed by Emmanuel Haucourt) 108 108 + - fixed DOT parser (contributed by Alex Reece) 109 109 + - Topological: fixed bug in presence of disjoint cycles; new implementation 110 110 + - new module [Graphml] to export graphs into the graphml format 111 111 + (contributed by Pietro Abate) 112 112 + - Builder.S now contains functions remove_*. 113 113 + - modified Fixpoint module so that it also works with unlabeled 114 114 + graphs, break backward compatibility yet (contributed by Markus W. Weissmann) 115 115 + - support of lablgtk2 installed with findlib (contributed by B. Monate) 116 116 + - new module [Dominator] to compute dominators 117 117 + (contributed by David Brumley and Ivan Jager) 118 118 + 119 119 + # 1.8.2, May 12, 2012 120 120 + 121 121 + - new module [Path.BellmanFord] implementing Bellman-Ford algorithm 122 122 + (contributed by Yuto Takei) 123 123 + - new module Contraction implementing edge contraction 124 124 + (contributed by Markus W. Weissmann) 125 125 + - Gmap: new function [filter_map] (contributed by Markus W. Weissmann) 126 126 + - Topological: fix bug when a cycle depends on another cycle. That breaks 127 127 + compatibility: the input graph must implement Sig.COMPARABLE instead of 128 128 + Sig.HASHABLE 129 129 + - new module Topological.Make_stable to iterate over a graph in a **stable** 130 130 + topological order. Stable means that the provided ordering only depends on 131 131 + the graph topology and on the user's vertices ordering. 132 132 + - new module Leaderlist to compute the leader list algorithm (see the Dragon) 133 133 + (contributed by Markus W. Weissmann <markus.weissmann@in.tum.de>) 134 134 + 135 135 + # 1.8.1, October 17, 2011 136 136 + 137 137 + - module Gmap now has a signature for edges (E_SRC) compatible with 138 138 + Sig, so that it is easier to apply functor Gmap.Edge 139 139 + (contributed by Markus W. Weissmann <markus.weissmann@in.tum.de>) 140 140 + - new module Fixpoint to compute fixpoints using the work-list 141 141 + algorithm, e.g. for data flow analysis 142 142 + (contributed by Markus W. Weissmann <markus.weissmann@in.tum.de>) 143 143 + 144 144 + # 1.8, October 4, 2011 145 145 + 146 146 + - removed ocamlyacc shift/reduce conflict in dot_parser.mly 147 147 + (patch contributed by Till Varoquaux) 148 148 + - Dgraph: Correct height and width-related problems with text 149 149 + - DGraph: many bug fixes. Patch by Benjamin Monate 150 150 + - Sig.G: new function [find_all_edges] for each graph implementation 151 151 + - Oper: fixed bug with function [intersect]: now use G.E.compare instead of (=) 152 152 + - fixed "make install-findlib" 153 153 + 154 154 + # 1.7, February 23, 2011 155 155 + 156 156 + - Makefile: fixed bug when installing ocamlgraph with ocamlfind 157 157 + - DGraph: fixed bug with colors on some windows manager 158 158 + - Configure: fixed issue with automatic detection of extension under 159 159 + Windows/Mingw 160 160 + 161 161 + # 1.6, December 13, 2010 162 162 + 163 163 + - DGraph: new viewer mode (called `tree') which focus on a subset part of the 164 164 + graph centered on a given node 165 165 + - Graphviz: fixed bug with attribute `Constraint (was `Constraints) (patch by 166 166 + Boris Yakobowski) 167 167 + - DGraph: fixed font size issue when zooming 168 168 + - DGraph: now interpret text anchors and espaced sequences correctly 169 169 + - DGraph: offer possibility to disable the default callbacks on nodes 170 170 + - 'make -j' works again 171 171 + - new implementation Persistent.Digraph.ConcreteBidirectionalLabeled 172 172 + - new implementation Persistent.Digraph.ConcreteBidirectional 173 173 + - Makefile: bug fixed when ocamlc (resp. ocamlopt) and ocamlc.opt 174 174 + (resp. ocamlopt.opt) are unconsistent 175 175 + 176 176 + # 1.5, April 29, 2010 177 177 + 178 178 + - Makefile: bug fixed when installing ocamlgraph with ocamlfind 179 179 + (patch by Virgile Prevosto) 180 180 + - DGraph: new method set_zoom_padding in DgraphView.view 181 181 + - Traverse.Dfs.has_cycle: can now be used on undirected graphs as well, 182 182 + and is now tail recursive 183 183 + - DGraph: handle dotted ellipse 184 184 + 185 185 + # 1.4, March 24, 2010 186 186 + 187 187 + - new function [clear] for imperative graphs 188 188 + - new implementation Imperative.Digraph.ConcreteBidirectionalLabeled 189 189 + (contribution of Jaap Boender) 190 190 + - Dgraph displays graphs faster 191 191 + - DGraph: several bugs fixed 192 192 + - DGraph: several API changes 193 193 + (may break compatibility with existing development) 194 194 + 195 195 + # 1.3, October 2, 2009 196 196 + 197 197 + - Oper.mirror: undirected graphs are not copied anymore 198 198 + - Oper.mirror: fixed bug (isolated vertices were lost) 199 199 + - Graphviz: new signature GraphWithDotAttrs 200 200 + - Improvements of Dgraph 201 201 + - Configure: better test for detecting lablgtk 202 202 + - OcamlGraph is now installed by default in `ocamlc -where`/ocamlgraph 203 203 + - Viewgraph is now packed in a single module Viewgraph (break compatibility 204 204 + with previous version) 205 205 + - Dgraph is now packed in a single module Dgraph (break compatibility with 206 206 + previous version) 207 207 + - Makefile: fixed bug when the installation directory of binaries does not 208 208 + exist 209 209 + - Makefile: fixed bug of ocamldep under Windows 210 210 + 211 211 + # 1.2, August 31, 2009 212 212 + 213 213 + - experimental: new GTK-based graph viewer called Dgraph 214 214 + (viewGraph is now deprecated) 215 215 + - added Delaunay.iter_triangles (not of use in Ocamlgraph, actually) 216 216 + 217 217 + # 1.1, June 23, 2009 218 218 + 219 219 + - added constraint "type E.label = unit" to unlabeled graph data structure 220 220 + - viewGraph: new module viewGraph_utils; fixed compilation (gtkInit 221 221 + was missing; patch by Mehdi Dogguy) 222 222 + - configure: fixed bug under Cygwin (patch by Julien Bernet) 223 223 + - configure: look for lablgnomecanvas.cmxa when compiling in native code 224 224 + - Makefile: fixed make install-findlib when lablgtk and/or 225 225 + lablgnomecanvas not installed (patch by Peter Hawkins) 226 226 + 227 227 + # 1.0, October 14, 2008 228 228 + 229 229 + - license: LGPL updated to version 2.1 230 230 + - ocamlgraph now requires ocaml 3.10 or higher 231 231 + - experimental: GTK-based graph viewer based on dot 232 232 + (contribution of Anne Pacalet) 233 233 + - Makefile: 234 234 + - fixed bug when lablgnomecanvas is not installed 235 235 + - fixed bug when ocamlfind is installed 236 236 + - patch to the build system for a DESTDIR (patch by Igor Galic) 237 237 + - "make -j" compliant 238 238 + - new function Blocks.after_unserialization in order to be able to safely 239 239 + serialize abstract vertices (see the FAQ) 240 240 + - Dot: 241 241 + - fixed bug in the parsing of attributes 242 242 + - fixed bug in the parsing of subgraphs (patch by Anne Pacalet) 243 243 + - Oper: fixed bug in intersect 244 244 + - Path: improved efficiency of Dijkstra 245 245 + - Topological: 246 246 + - fixed bug in Make.{iter,fold} 247 247 + - folding is now tail-recursive (patch by Michael Furr) 248 248 + 249 249 + # 0.99c, April 3rd, 2008 250 250 + 251 251 + - replicated a bug fix of Bitv (could not affect Matrix, though) 252 252 + - fixed DFS traversal in Traverse.Dfs.{prefix,prefix_component,iterator} 253 253 + 254 254 + # 0.99b, December 18th, 2007 255 255 + 256 256 + - fixed link bug with ocaml 3.09 257 257 + (see http://caml.inria.fr/mantis/view.php?id=4124) 258 258 + 259 259 + # 0.99a, November 21st, 2007 260 260 + 261 261 + - fixed bug in Makefile when lablgtk2 is not installed 262 262 + - Sig.I.create and Sig_pack.create are now of type ?size:int -> unit -> t 263 263 + (instead of unit -> t) to indicate an initial guess on the graph size 264 264 + 265 265 + # 0.99, June 27th, 2007 266 266 + 267 267 + - experimental: GTK-based graph editor based on hyperbolic geometry; 268 268 + to build it and test it, cd to editor/ and type make 269 269 + - [Components.Make] functor: function [scc] as a new profile and a 270 270 + more precise specification. New function [scc_array]. 271 271 + - fixed configure to set ocaml's standard library using "ocamlc -where" 272 272 + - new module Dot to parse files in Graphviz's DOT format 273 273 + - slight change in the license (no more clause 6 of the LGPL; see LICENSE) 274 274 + - new module Strat implementing simple game strategies 275 275 + - Graphviz: little refactoring and improved documentation 276 276 + 277 277 + # 0.98, Sep 27th, 2006 278 278 + 279 279 + - rename Sig.IA to Sig.IM 280 280 + - add subgraph support in Graphviz 281 281 + (breaks ascendent compatibility if you use Graphviz: by default add 282 282 + let get_subgraph _ = None 283 283 + in the argument of Graphviz.Dot and Graphviz.Neato) 284 284 + 285 285 + # 0.97, July 20th, 2006 286 286 + 287 287 + - fixed compilation under Windows/Cygwin (contributed by Denis Berthod) 288 288 + - fixed bug with escaped string in Graphviz 289 289 + 290 290 + # 0.96, May 2nd, 2006 291 291 + 292 292 + - new demo program: sudoku.ml (solving the Sudoku using graph coloring) 293 293 + - new module Coloring for (rather brute force) graph coloring 294 294 + - new implementation Imperative.Digraph.ConcreteBidirectional 295 295 + that maintains the set of ingoing edges for each node, thus improving the 296 296 + efficiency of functions such as iter_pred, pred, in_degree, etc. 297 297 + (contributed by Ted Kremenek) 298 298 + 299 299 + # 0.95, November 2nd, 2005 300 300 + 301 301 + - compatibility with ocaml 3.09 302 302 + - new module Path.Check to check for paths 303 303 + 304 304 + # 0.94, July 6th, 2005 305 305 + 306 306 + - new module Gml to parse and print graphs in GML file format 307 307 + (see http://www.infosun.fmi.uni-passau.de/Graphlet/GML) 308 308 + corresponding functions parse_gml_file and print_gml_file in Pack 309 309 + - added display_with_gv in Pack 310 310 + - improved implementation of Unionfind (patch by Marc Lasson) 311 311 + 312 312 + # 0.93, March 31st, 2005 313 313 + 314 314 + - fixed bug in Rand (integer overflow causing Invalid_argument "random"); 315 315 + improved code in Rand 316 316 + - bug fixed in the META file 317 317 + - add find_edge in Sig.G (and so in all graph implementations) 318 318 + 319 319 + # 0.92, January 18th, 2005 320 320 + 321 321 + - fixed escaped labels in Graphviz output (patch by Boris Yakobowski) 322 322 + - new Graphviz option OrderingOut (patch by Boris Yakobowski) 323 323 + - fixed sharing bugs in Oper (patch by Boris Yakobowski) 324 324 + - fixed bug in nb_edges for undirected graphs 325 325 + - improvement of iterators of undirected concrete graphs 326 326 + 327 327 + # 0.91, December 16th, 2004 328 328 + 329 329 + - more precise specifications of remove_edge and shortest_path. 330 330 + - bug fixed in mem_edge_e of labelled graphs 331 331 + - generation of random graphs improved 332 332 + - add Rand.Make and Rand.Planar.Make (generic functors) 333 333 + - add signatures Persistent.S and Imperative.S 334 334 + 335 335 + # 0.90, November 30th, 2004 336 336 + 337 337 + - graph.cma graph.cmxa 338 338 + - version.ml and META files are now writable 339 339 + - add interfaces Sig.VERTEX and Sig.EDGE 340 340 + - "sig.ml" and "sig_pack.ml" removed; ocamlgraph now requires ocaml 3.08.0 341 341 + - improvement of Minsep 342 342 + - add Components.scc_list 343 343 + - Oper.Neighbourhood replaces Neighborhood 344 344 + - Gmap replaces Copy 345 345 + - add types Sig_pack.vertex and Sig_pack.edge 346 346 + - fixed bug in Ford-Fulkerson: G.V.equal instead of = in two asserts 347 347 + 348 348 + # 0.81, July 13th, 2004 349 349 + 350 350 + - compatibility with ocaml 3.08 351 351 + - Oper.Choose.choose_edge: choose an edge in a graph 352 352 + - add types Sig.G.edge and Sig.G.vertex resp. equal to Sig.G.V.t and Sig.G.E.t 353 353 + - fixed typos in invalid_arg arguments (in Bitv) 354 354 + 355 355 + # 0.80, June 28th, 2004 356 356 + 357 357 + - major contribution by Matthieu Sozeau and Pierre-Loïc Garoche. 358 358 + New modules are: 359 359 + - Md: Minimum Degree algorithm 360 360 + - Cliquetree: the clique tree of a graph 361 361 + - Mcs_m: Maximal Cardinality Search (MCS-M) algorithm 362 362 + - Minsep: Minimal separators of a graph 363 363 + - Neighborhood: compute the neighborhood of a vertex/some vertices 364 364 + - Oper.Difference: subgraphs induced by the elimination of some vertices 365 365 + - Oper.Choose: choose a vertex in a graph 366 366 + - Copy: graphs copying 367 367 + - Util.DataV: create a vertex type with data attached to it 368 368 + - out_degree: raises Invalid_argument if v not in g (instead of Not_found) 369 369 + - Pack.Graph: golberg/ford_fulkerson fail ("not a directed graph") 370 370 + 371 371 + # 0.70, Feb 27th, 2004 372 372 + 373 373 + - Makefile.in: dependences ("make -j" works) 374 374 + - union and intersection (see Oper.S.union and Oper.S.intersection) 375 375 + - Golberg/Ford_fulkerson algorithms in a single module Flow 376 376 + - step-by-step iterators in Traverse.{Dfs,Bfs} 377 377 + - Ford_fulkerson: maxflow now returns a flow function over edges 378 378 + 379 379 + # 0.60, Feb 18th, 2004 380 380 + 381 381 + - fixed bug in Ford-Fulkerson 382 382 + - random planar graphs (see Rand.Planar) 383 383 + - Delaunay triangulation (see Delaunay) 384 384 + - implementations with adjacency matrices (see Imperative.Matrix) 385 385 + - operations on predecessors for undirected graphs optimized 386 386 + - Traverse.Dfs.{prefix,prefix_component} optimized (now tail recursive) 387 387 + 388 388 + # 0.50, Feb 4th, 2004 389 389 + 390 390 + - first release 391 391 + 392 392 +

-31

INSTALL.adoc

reviewed

··· 1 1 - 2 2 - = How to create the library ? 3 3 - 4 4 - You need Objective Caml >= 3.10.2 to compile this library. 5 5 - 6 6 - Configure with 7 7 - 8 8 - autoconf 9 9 - ./configure 10 10 - 11 11 - Compile with 12 12 - 13 13 - make 14 14 - 15 15 - Install (as root if needed) with 16 16 - 17 17 - make install 18 18 - 19 19 - To install somewhere else, with a different path prefix, use instead 20 20 - 21 21 - make DESTDIR=/another/place install 22 22 - 23 23 - findlib users may also do 24 24 - 25 25 - make install-findlib 26 26 - 27 27 - == How to create the documentation ? 28 28 - 29 29 - create a local documentation with 30 30 - 31 31 - make doc

+28

INSTALL.md

reviewed

··· 1 1 + 2 2 + The simplest way to install OCamlGraph is via opam. 3 3 + 4 4 + If instead you choose to compile OCamlGraph from sources, 5 5 + the simplest way is to use `dune`. 6 6 + 7 7 + Otherwise, you can still use the old way: 8 8 + - Configure with 9 9 + ``` 10 10 + autoconf 11 11 + ./configure 12 12 + ``` 13 13 + - Compile with 14 14 + ``` 15 15 + make 16 16 + ``` 17 17 + - Install (as root if needed) with 18 18 + ``` 19 19 + make install 20 20 + ``` 21 21 + To install somewhere else, with a different path prefix, use instead 22 22 + ``` 23 23 + make DESTDIR=/another/place install 24 24 + ``` 25 25 + findlib users may also do 26 26 + ``` 27 27 + make install-findlib 28 28 + ```

-68

README.adoc

reviewed

··· 1 1 - = OCamlgraph 2 2 - 3 3 - OCamlgraph is a graph library for Ocaml. Its contribution is three-fold: 4 4 - 5 5 - 1. It provides an easy-to-use graph implementation together with several 6 6 - operations and algorithms over graphs, in Graph.Pack.Digraph. 7 7 - It is a reasonably efficient imperative data structure for directed graphs 8 8 - with vertices and edges labeled with integers. 9 9 - + 10 10 - Have a look at this module first in order to get an overview of what 11 11 - this library provides. See also `demo.ml`. 12 12 - 13 13 - 2. Then OCamlgraph provides several other graph implementations for those 14 14 - not satisfied with the one above. Some are persistent (immutable) and other 15 15 - imperative (mutable). Some are directed and other are not. 16 16 - Some have labels for vertices, or labels for edges, or both. 17 17 - Some have abstract types for vertices. etc. 18 18 - + 19 19 - See interface Sig for the graph signatures and modules Persistent and 20 20 - Imperative for the implementations. 21 21 - + 22 22 - These implementations are written as functors: you give the types of 23 23 - vertices labels, edge labels, etc. and you get the data structure as a 24 24 - result. 25 25 - 26 26 - 3. Finally, OCamlgraph provides several classic operations and algorithms 27 27 - over graphs. They are also written as functors i.e. independently of the 28 28 - data structure for graphs. One consequence is that you can define your own 29 29 - data structure for graphs and yet re-use all the algorithms from this 30 30 - library -- you only need to provide a few operations such as iterating over 31 31 - all vertices, over the successors of a vertex, etc. 32 32 - 33 33 - 34 34 - == How to link with OCamlgraph 35 35 - 36 36 - You can use the `ocamlgraph` ocamlfind package: 37 37 - 38 38 - ocamlfind ocamlopt -package ocamlgraph ... 39 39 - 40 40 - (To produce an executable, also add the `-linkpkg` option.) 41 41 - 42 42 - If you want to invoke the compiler directly, OCamlgraph is packaged as 43 43 - a single module `Graph`. Linking is done as follows: 44 44 - 45 45 - bytecode:: 46 46 - 47 47 - ocamlc graph.cma <other files> 48 48 - 49 49 - native code:: 50 50 - 51 51 - ocamlopt graph.cmxa <other files> 52 52 - 53 53 - == Examples 54 54 - 55 55 - You'll find examples of OCamlgraph use in subdirectory examples/ 56 56 - (demo.ml, demo_planar.ml, color.ml, etc.). You can compile these 57 57 - programs with `make examples`. Corresponding binaries are produced in 58 58 - subdirectory bin/. You can also build them individually, e.g. `make 59 59 - bin/demo.opt` compiles examples/demo.ml. 60 60 - 61 61 - 62 62 - == Bug reports 63 63 - 64 64 - Bug reports can be sent to 65 65 - 66 66 - Sylvain Conchon <sylvain.conchon@lri.fr> 67 67 - Jean-Christophe Filliatre <filliatr@lri.fr> 68 68 - Julien Signoles <julien.signoles@cea.fr>

+48

README.md

reviewed

··· 1 1 + # OCamlgraph 2 2 + 3 3 + OCamlgraph is a graph library for Ocaml. Its contribution is three-fold: 4 4 + 5 5 + 1. It provides an easy-to-use graph implementation together with several 6 6 + operations and algorithms over graphs, in Graph.Pack.Digraph. 7 7 + It is a reasonably efficient imperative data structure for directed graphs 8 8 + with vertices and edges labeled with integers. 9 9 + 10 10 + Have a look at this module first in order to get an overview of what 11 11 + this library provides. See also `demo.ml`. 12 12 + 13 13 + 2. Then OCamlgraph provides several other graph implementations for those 14 14 + not satisfied with the one above. Some are persistent (immutable) and other 15 15 + imperative (mutable). Some are directed and other are not. 16 16 + Some have labels for vertices, or labels for edges, or both. 17 17 + Some have abstract types for vertices. etc. 18 18 + 19 19 + See interface Sig for the graph signatures and modules Persistent and 20 20 + Imperative for the implementations. 21 21 + 22 22 + These implementations are written as functors: you give the types of 23 23 + vertices labels, edge labels, etc. and you get the data structure as a 24 24 + result. 25 25 + 26 26 + 3. Finally, OCamlgraph provides several classic operations and algorithms 27 27 + over graphs. They are also written as functors i.e. independently of the 28 28 + data structure for graphs. One consequence is that you can define your own 29 29 + data structure for graphs and yet re-use all the algorithms from this 30 30 + library -- you only need to provide a few operations such as iterating over 31 31 + all vertices, over the successors of a vertex, etc. 32 32 + 33 33 + 34 34 + ## Documentation 35 35 + 36 36 + https://backtracking.github.io/ocamlgraph/ 37 37 + 38 38 + 39 39 + ## Examples 40 40 + 41 41 + You'll find examples of OCamlgraph use in subdirectory examples/ 42 42 + (demo.ml, demo_planar.ml, color.ml, etc.). 43 43 + 44 44 + 45 45 + ## Bug reports 46 46 + 47 47 + https://github.com/backtracking/ocamlgraph/issues 48 48 +

+2 -2

TODO.adoc TODO.md

reviewed

··· 10 10 only Imperative.Digraph.ConcreteBidirectional exists at this day. 11 11 - Provide generic marks (instead of only integer marks) 12 12 13 13 - == DGraph 13 13 + ## DGraph 14 14 15 15 - === mode Tree: 15 15 + ### mode Tree 16 16 17 17 - texte trop bas 18 18 - texte multi-ligne