<html> <head> <link rel="stylesheet" href="style.css" type="text/css"> <meta content="text/html; charset=iso-8859-1" http-equiv="Content-Type"> <link rel="Start" href="index.html"> <link title="Index of types" rel=Appendix href="index_types.html"> <link title="Index of exceptions" rel=Appendix href="index_exceptions.html"> <link title="Index of values" rel=Appendix href="index_values.html"> <link title="Index of modules" rel=Appendix href="index_modules.html"> <link title="Index of module types" rel=Appendix href="index_module_types.html"> <link title="Sig" rel="Chapter" href="Sig.html"> <link title="Sig_pack" rel="Chapter" href="Sig_pack.html"> <link title="Dot_ast" rel="Chapter" href="Dot_ast.html"> <link title="Util" rel="Chapter" href="Util.html"> <link title="Persistent" rel="Chapter" href="Persistent.html"> <link title="Imperative" rel="Chapter" href="Imperative.html"> <link title="Delaunay" rel="Chapter" href="Delaunay.html"> <link title="Builder" rel="Chapter" href="Builder.html"> <link title="Classic" rel="Chapter" href="Classic.html"> <link title="Rand" rel="Chapter" href="Rand.html"> <link title="Oper" rel="Chapter" href="Oper.html"> <link title="Path" rel="Chapter" href="Path.html"> <link title="Traverse" rel="Chapter" href="Traverse.html"> <link title="Coloring" rel="Chapter" href="Coloring.html"> <link title="Topological" rel="Chapter" href="Topological.html"> <link title="Components" rel="Chapter" href="Components.html"> <link title="Kruskal" rel="Chapter" href="Kruskal.html"> <link title="Flow" rel="Chapter" href="Flow.html"> <link title="Graphviz" rel="Chapter" href="Graphviz.html"> <link title="Gml" rel="Chapter" href="Gml.html"> <link title="Dot" rel="Chapter" href="Dot.html"> <link title="Pack" rel="Chapter" href="Pack.html"> <link title="Gmap" rel="Chapter" href="Gmap.html"> <link title="Minsep" rel="Chapter" href="Minsep.html"> <link title="Cliquetree" rel="Chapter" href="Cliquetree.html"> <link title="Mcs_m" rel="Chapter" href="Mcs_m.html"> <link title="Md" rel="Chapter" href="Md.html"> <link title="Strat" rel="Chapter" href="Strat.html"><title>Index of values</title> </head> <body> <center><h1>Index of values</h1></center> <table> <tr><td align="left"><br>A</td></tr> <tr><td><a href="Strat.STRAT.html#VALadd">add</a> [<a href="Strat.STRAT.html">Strat.STRAT</a>]</td> <td></td></tr> <tr><td><a href="Flow.FLOW.html#VALadd">add</a> [<a href="Flow.FLOW.html">Flow.FLOW</a>]</td> <td></td></tr> <tr><td><a href="Path.WEIGHT.html#VALadd">add</a> [<a href="Path.WEIGHT.html">Path.WEIGHT</a>]</td> <td><div class="info"> Addition of weights. </div> </td></tr> <tr><td><a href="Builder.S.html#VALadd_edge">add_edge</a> [<a href="Builder.S.html">Builder.S</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALadd_edge">add_edge</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">add_edge g v1 v2</code> adds an edge from the vertex <code class="code">v1</code> to the vertex <code class="code">v2</code> in the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.I.html#VALadd_edge">add_edge</a> [<a href="Sig.I.html">Sig.I</a>]</td> <td><div class="info"> <code class="code">add_edge g v1 v2</code> adds an edge from the vertex <code class="code">v1</code> to the vertex <code class="code">v2</code> in the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.P.html#VALadd_edge">add_edge</a> [<a href="Sig.P.html">Sig.P</a>]</td> <td><div class="info"> <code class="code">add_edge g v1 v2</code> adds an edge from the vertex <code class="code">v1</code> to the vertex <code class="code">v2</code> in the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Gmap.E_DST.html#VALadd_edge_e">add_edge_e</a> [<a href="Gmap.E_DST.html">Gmap.E_DST</a>]</td> <td></td></tr> <tr><td><a href="Builder.S.html#VALadd_edge_e">add_edge_e</a> [<a href="Builder.S.html">Builder.S</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALadd_edge_e">add_edge_e</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">add_edge_e g e</code> adds the edge <code class="code">e</code> in the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.I.html#VALadd_edge_e">add_edge_e</a> [<a href="Sig.I.html">Sig.I</a>]</td> <td><div class="info"> <code class="code">add_edge_e g e</code> adds the edge <code class="code">e</code> in the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.P.html#VALadd_edge_e">add_edge_e</a> [<a href="Sig.P.html">Sig.P</a>]</td> <td><div class="info"> <code class="code">add_edge_e g e</code> adds the edge <code class="code">e</code> in the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Oper.S.html#VALadd_transitive_closure">add_transitive_closure</a> [<a href="Oper.S.html">Oper.S</a>]</td> <td><div class="info"> <code class="code">add_transitive_closure ?reflexive g</code> replaces <code class="code">g</code> by its transitive closure. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALadd_transitive_closure">add_transitive_closure</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">add_transitive_closure ?reflexive g</code> replaces <code class="code">g</code> by its transitive closure. </div> </td></tr> <tr><td><a href="Gmap.V_DST.html#VALadd_vertex">add_vertex</a> [<a href="Gmap.V_DST.html">Gmap.V_DST</a>]</td> <td></td></tr> <tr><td><a href="Builder.S.html#VALadd_vertex">add_vertex</a> [<a href="Builder.S.html">Builder.S</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALadd_vertex">add_vertex</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">add_vertex g v</code> adds the vertex <code class="code">v</code> from the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.I.html#VALadd_vertex">add_vertex</a> [<a href="Sig.I.html">Sig.I</a>]</td> <td><div class="info"> <code class="code">add_vertex g v</code> adds the vertex <code class="code">v</code> from the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.P.html#VALadd_vertex">add_vertex</a> [<a href="Sig.P.html">Sig.P</a>]</td> <td><div class="info"> <code class="code">add_vertex g v</code> adds the vertex <code class="code">v</code> from the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Minsep.MINSEP.html#VALallminsep">allminsep</a> [<a href="Minsep.MINSEP.html">Minsep.MINSEP</a>]</td> <td><div class="info"> <code class="code">allminsep g</code> computes the list of all minimal separators of g. </div> </td></tr> <tr><td align="left"><br>C</td></tr> <tr><td><a href="Delaunay.CCC.html#VALccw">ccw</a> [<a href="Delaunay.CCC.html">Delaunay.CCC</a>]</td> <td><div class="info"> The counterclockwise relation <code class="code">ccw p q r</code> states that the circle through points <code class="code">(p,q,r)</code> is traversed counterclockwise when we encounter the points in cyclic order <code class="code">p,q,r,p,...</code> * </div> </td></tr> <tr><td><a href="Path.Check.html#VALcheck_path">check_path</a> [<a href="Path.Check.html">Path.Check</a>]</td> <td><div class="info"> <code class="code">check_path pc v1 v2</code> checks whether there is a path from <code class="code">v1</code> to <code class="code">v2</code> in the graph associated to the path checker <code class="code">pc</code>. </div> </td></tr> <tr><td><a href="Sig_pack.S.PathCheck.html#VALcheck_path">check_path</a> [<a href="Sig_pack.S.PathCheck.html">Sig_pack.S.PathCheck</a>]</td> <td></td></tr> <tr><td><a href="Oper.Choose.html#VALchoose_edge">choose_edge</a> [<a href="Oper.Choose.html">Oper.Choose</a>]</td> <td><div class="info"> <code class="code">choose_edge g</code> returns an edge from the graph. </div> </td></tr> <tr><td><a href="Oper.Choose.html#VALchoose_vertex">choose_vertex</a> [<a href="Oper.Choose.html">Oper.Choose</a>]</td> <td><div class="info"> <code class="code">choose_vertex g</code> returns a vertex from the graph. </div> </td></tr> <tr><td><a href="Traverse.GM.Mark.html#VALclear">clear</a> [<a href="Traverse.GM.Mark.html">Traverse.GM.Mark</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.Mark.html#VALclear">clear</a> [<a href="Sig_pack.S.Mark.html">Sig_pack.S.Mark</a>]</td> <td><div class="info"> <code class="code">clear g</code> sets all marks to 0 from all the vertives of <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.MARK.html#VALclear">clear</a> [<a href="Sig.MARK.html">Sig.MARK</a>]</td> <td><div class="info"> <code class="code">clear g</code> sets all the marks to 0 for all the vertices of <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Strat.Algo.html#VALcoherent_player">coherent_player</a> [<a href="Strat.Algo.html">Strat.Algo</a>]</td> <td><div class="info"> <code class="code">coherent_player g p</code> returns <code class="code">true</code> iff the completion <code class="code">p</code> is coherent w.r.t. </div> </td></tr> <tr><td><a href="Strat.Algo.html#VALcoherent_strat">coherent_strat</a> [<a href="Strat.Algo.html">Strat.Algo</a>]</td> <td><div class="info"> <code class="code">coherent_strat g s</code> returns <code class="code">true</code> iff the strategy <code class="code">s</code> is coherent w.r.t. </div> </td></tr> <tr><td><a href="Coloring.Mark.html#VALcoloring">coloring</a> [<a href="Coloring.Mark.html">Coloring.Mark</a>]</td> <td><div class="info"> <code class="code">coloring g k</code> colors the nodes of graph <code class="code">g</code> using k colors, assigning the marks integer values between 1 and k. </div> </td></tr> <tr><td><a href="Coloring.Make.html#VALcoloring">coloring</a> [<a href="Coloring.Make.html">Coloring.Make</a>]</td> <td><div class="info"> <code class="code">coloring g k</code> colors the graph <code class="code">g</code> with <code class="code">k</code> colors and returns the coloring as a hash table mapping nodes to their colors. </div> </td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueTreeE.html#VALcompare">compare</a> [<a href="Cliquetree.CliqueTree.CliqueTreeE.html">Cliquetree.CliqueTree.CliqueTreeE</a>]</td> <td></td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueTreeV.html#VALcompare">compare</a> [<a href="Cliquetree.CliqueTree.CliqueTreeV.html">Cliquetree.CliqueTree.CliqueTreeV</a>]</td> <td></td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueV.html#VALcompare">compare</a> [<a href="Cliquetree.CliqueTree.CliqueV.html">Cliquetree.CliqueTree.CliqueV</a>]</td> <td></td></tr> <tr><td><a href="Flow.FLOW.html#VALcompare">compare</a> [<a href="Flow.FLOW.html">Flow.FLOW</a>]</td> <td></td></tr> <tr><td><a href="Path.WEIGHT.html#VALcompare">compare</a> [<a href="Path.WEIGHT.html">Path.WEIGHT</a>]</td> <td><div class="info"> Weights must be ordered. </div> </td></tr> <tr><td><a href="Util.DataV.html#VALcompare">compare</a> [<a href="Util.DataV.html">Util.DataV</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.E.html#VALcompare">compare</a> [<a href="Sig_pack.S.E.html">Sig_pack.S.E</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.V.html#VALcompare">compare</a> [<a href="Sig_pack.S.V.html">Sig_pack.S.V</a>]</td> <td></td></tr> <tr><td><a href="Sig.COMPARABLE.html#VALcompare">compare</a> [<a href="Sig.COMPARABLE.html">Sig.COMPARABLE</a>]</td> <td></td></tr> <tr><td><a href="Sig.ORDERED_TYPE.html#VALcompare">compare</a> [<a href="Sig.ORDERED_TYPE.html">Sig.ORDERED_TYPE</a>]</td> <td></td></tr> <tr><td><a href="Sig.EDGE.html#VALcompare">compare</a> [<a href="Sig.EDGE.html">Sig.EDGE</a>]</td> <td></td></tr> <tr><td><a href="Sig.VERTEX.html#VALcompare">compare</a> [<a href="Sig.VERTEX.html">Sig.VERTEX</a>]</td> <td></td></tr> <tr><td><a href="Oper.S.html#VALcomplement">complement</a> [<a href="Oper.S.html">Oper.S</a>]</td> <td><div class="info"> <code class="code">complement g</code> returns a new graph which is the complement of <code class="code">g</code>: each edge present in <code class="code">g</code> is not present in the resulting graph and vice-versa. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALcomplement">complement</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">complement g</code> builds a new graph which is the complement of <code class="code">g</code>: each edge present in <code class="code">g</code> is not present in the resulting graph and vice-versa. </div> </td></tr> <tr><td><a href="Builder.S.html#VALcopy">copy</a> [<a href="Builder.S.html">Builder.S</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALcopy">copy</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">copy g</code> returns a copy of <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.I.html#VALcopy">copy</a> [<a href="Sig.I.html">Sig.I</a>]</td> <td><div class="info"> <code class="code">copy g</code> returns a copy of <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueTreeE.html#VALcreate">create</a> [<a href="Cliquetree.CliqueTree.CliqueTreeE.html">Cliquetree.CliqueTree.CliqueTreeE</a>]</td> <td></td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueTreeV.html#VALcreate">create</a> [<a href="Cliquetree.CliqueTree.CliqueTreeV.html">Cliquetree.CliqueTree.CliqueTreeV</a>]</td> <td></td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueV.html#VALcreate">create</a> [<a href="Cliquetree.CliqueTree.CliqueV.html">Cliquetree.CliqueTree.CliqueV</a>]</td> <td></td></tr> <tr><td><a href="Path.Check.html#VALcreate">create</a> [<a href="Path.Check.html">Path.Check</a>]</td> <td><div class="info"> <code class="code">create g</code> builds a new path checker for the graph <code class="code">g</code>; if the graph is mutable, it must not be mutated while this path checker is in use (through the function <code class="code">check_path</code> below). </div> </td></tr> <tr><td><a href="Util.DataV.html#VALcreate">create</a> [<a href="Util.DataV.html">Util.DataV</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.PathCheck.html#VALcreate">create</a> [<a href="Sig_pack.S.PathCheck.html">Sig_pack.S.PathCheck</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.E.html#VALcreate">create</a> [<a href="Sig_pack.S.E.html">Sig_pack.S.E</a>]</td> <td><div class="info"> <code class="code">create v1 l v2</code> creates an edge from <code class="code">v1</code> to <code class="code">v2</code> with label <code class="code">l</code> </div> </td></tr> <tr><td><a href="Sig_pack.S.V.html#VALcreate">create</a> [<a href="Sig_pack.S.V.html">Sig_pack.S.V</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALcreate">create</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> Return an empty graph. </div> </td></tr> <tr><td><a href="Sig.I.html#VALcreate">create</a> [<a href="Sig.I.html">Sig.I</a>]</td> <td><div class="info"> <code class="code">create ()</code> returns an empty graph. </div> </td></tr> <tr><td><a href="Sig.EDGE.html#VALcreate">create</a> [<a href="Sig.EDGE.html">Sig.EDGE</a>]</td> <td><div class="info"> <code class="code">create v1 l v2</code> creates an edge from <code class="code">v1</code> to <code class="code">v2</code> with label <code class="code">l</code> </div> </td></tr> <tr><td><a href="Sig.VERTEX.html#VALcreate">create</a> [<a href="Sig.VERTEX.html">Sig.VERTEX</a>]</td> <td></td></tr> <tr><td align="left"><br>D</td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueTreeV.html#VALdata">data</a> [<a href="Cliquetree.CliqueTree.CliqueTreeV.html">Cliquetree.CliqueTree.CliqueTreeV</a>]</td> <td></td></tr> <tr><td><a href="Util.DataV.html#VALdata">data</a> [<a href="Util.DataV.html">Util.DataV</a>]</td> <td></td></tr> <tr><td><a href="Classic.S.html#VALde_bruijn">de_bruijn</a> [<a href="Classic.S.html">Classic.S</a>]</td> <td><div class="info"> <code class="code">de_bruijn n</code> builds the de Bruijn graph of order <code class="code">n</code>. </div> </td></tr> <tr><td><a href="Sig_pack.S.Classic.html#VALde_bruijn">de_bruijn</a> [<a href="Sig_pack.S.Classic.html">Sig_pack.S.Classic</a>]</td> <td><div class="info"> <code class="code">de_bruijn n</code> builds the de Bruijn graph of order <code class="code">n</code>. </div> </td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueTreeE.html#VALdefault">default</a> [<a href="Cliquetree.CliqueTree.CliqueTreeE.html">Cliquetree.CliqueTree.CliqueTreeE</a>]</td> <td></td></tr> <tr><td><a href="Sig.ORDERED_TYPE_DFT.html#VALdefault">default</a> [<a href="Sig.ORDERED_TYPE_DFT.html">Sig.ORDERED_TYPE_DFT</a>]</td> <td></td></tr> <tr><td><a href="Graphviz.GraphWithDotAttrs.html#VALdefault_edge_attributes">default_edge_attributes</a> [<a href="Graphviz.GraphWithDotAttrs.html">Graphviz.GraphWithDotAttrs</a>]</td> <td><div class="info"> Edge attributes </div> </td></tr> <tr><td><a href="Graphviz.GraphWithDotAttrs.html#VALdefault_vertex_attributes">default_vertex_attributes</a> [<a href="Graphviz.GraphWithDotAttrs.html">Graphviz.GraphWithDotAttrs</a>]</td> <td><div class="info"> Vertex attributes </div> </td></tr> <tr><td><a href="Traverse.Mark.html#VALdfs">dfs</a> [<a href="Traverse.Mark.html">Traverse.Mark</a>]</td> <td><div class="info"> <code class="code">dfs g</code> traverses <code class="code">g</code> in depth-first search, marking all nodes. </div> </td></tr> <tr><td><a href="Sig_pack.S.Marking.html#VALdfs">dfs</a> [<a href="Sig_pack.S.Marking.html">Sig_pack.S.Marking</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALdisplay_with_gv">display_with_gv</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> Displays the given graph using the external tools "dot" and "gv" and returns when gv's window is closed </div> </td></tr> <tr><td><a href="Classic.S.html#VALdivisors">divisors</a> [<a href="Classic.S.html">Classic.S</a>]</td> <td><div class="info"> <code class="code">divisors n</code> builds the graph of divisors. </div> </td></tr> <tr><td><a href="Sig_pack.S.Classic.html#VALdivisors">divisors</a> [<a href="Sig_pack.S.Classic.html">Sig_pack.S.Classic</a>]</td> <td><div class="info"> <code class="code">divisors n</code> builds the graph of divisors. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALdot_output">dot_output</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> DOT output </div> </td></tr> <tr><td><a href="Gml.G.E.html#VALdst">dst</a> [<a href="Gml.G.E.html">Gml.G.E</a>]</td> <td></td></tr> <tr><td><a href="Flow.G_FORD_FULKERSON.E.html#VALdst">dst</a> [<a href="Flow.G_FORD_FULKERSON.E.html">Flow.G_FORD_FULKERSON.E</a>]</td> <td></td></tr> <tr><td><a href="Kruskal.G.E.html#VALdst">dst</a> [<a href="Kruskal.G.E.html">Kruskal.G.E</a>]</td> <td></td></tr> <tr><td><a href="Path.G.E.html#VALdst">dst</a> [<a href="Path.G.E.html">Path.G.E</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.E.html#VALdst">dst</a> [<a href="Sig_pack.S.E.html">Sig_pack.S.E</a>]</td> <td></td></tr> <tr><td><a href="Sig.EDGE.html#VALdst">dst</a> [<a href="Sig.EDGE.html">Sig.EDGE</a>]</td> <td><div class="info"> Edge destination. </div> </td></tr> <tr><td align="left"><br>E</td></tr> <tr><td><a href="Graphviz.GraphWithDotAttrs.html#VALedge_attributes">edge_attributes</a> [<a href="Graphviz.GraphWithDotAttrs.html">Graphviz.GraphWithDotAttrs</a>]</td> <td></td></tr> <tr><td><a href="Strat.STRAT.html#VALempty">empty</a> [<a href="Strat.STRAT.html">Strat.STRAT</a>]</td> <td></td></tr> <tr><td><a href="Gmap.E_DST.html#VALempty">empty</a> [<a href="Gmap.E_DST.html">Gmap.E_DST</a>]</td> <td></td></tr> <tr><td><a href="Gmap.V_DST.html#VALempty">empty</a> [<a href="Gmap.V_DST.html">Gmap.V_DST</a>]</td> <td></td></tr> <tr><td><a href="Builder.S.html#VALempty">empty</a> [<a href="Builder.S.html">Builder.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.P.html#VALempty">empty</a> [<a href="Sig.P.html">Sig.P</a>]</td> <td><div class="info"> The empty graph. </div> </td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueTreeV.html#VALequal">equal</a> [<a href="Cliquetree.CliqueTree.CliqueTreeV.html">Cliquetree.CliqueTree.CliqueTreeV</a>]</td> <td></td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueV.html#VALequal">equal</a> [<a href="Cliquetree.CliqueTree.CliqueV.html">Cliquetree.CliqueTree.CliqueV</a>]</td> <td></td></tr> <tr><td><a href="Gml.G.V.html#VALequal">equal</a> [<a href="Gml.G.V.html">Gml.G.V</a>]</td> <td></td></tr> <tr><td><a href="Util.DataV.html#VALequal">equal</a> [<a href="Util.DataV.html">Util.DataV</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.V.html#VALequal">equal</a> [<a href="Sig_pack.S.V.html">Sig_pack.S.V</a>]</td> <td></td></tr> <tr><td><a href="Sig.COMPARABLE.html#VALequal">equal</a> [<a href="Sig.COMPARABLE.html">Sig.COMPARABLE</a>]</td> <td></td></tr> <tr><td><a href="Sig.HASHABLE.html#VALequal">equal</a> [<a href="Sig.HASHABLE.html">Sig.HASHABLE</a>]</td> <td></td></tr> <tr><td><a href="Sig.VERTEX.html#VALequal">equal</a> [<a href="Sig.VERTEX.html">Sig.VERTEX</a>]</td> <td></td></tr> <tr><td align="left"><br>F</td></tr> <tr><td><a href="Kruskal.UNIONFIND.html#VALfind">find</a> [<a href="Kruskal.UNIONFIND.html">Kruskal.UNIONFIND</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALfind_edge">find_edge</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALfind_edge">find_edge</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> <code class="code">find_edge g v1 v2</code> returns the edge from <code class="code">v1</code> to <code class="code">v2</code> if it exists. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALfind_vertex">find_vertex</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">vertex g i</code> returns a vertex of label <code class="code">i</code> in <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Flow.FLOW.html#VALflow">flow</a> [<a href="Flow.FLOW.html">Flow.FLOW</a>]</td> <td></td></tr> <tr><td><a href="Topological.Make.html#VALfold">fold</a> [<a href="Topological.Make.html">Topological.Make</a>]</td> <td><div class="info"> <code class="code">fold action g seed</code> allows iterating over the graph <code class="code">g</code> in topological order. </div> </td></tr> <tr><td><a href="Delaunay.Triangulation.html#VALfold">fold</a> [<a href="Delaunay.Triangulation.html">Delaunay.Triangulation</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.Topological.html#VALfold">fold</a> [<a href="Sig_pack.S.Topological.html">Sig_pack.S.Topological</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALfold_edges">fold_edges</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALfold_edges">fold_edges</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> Fold on all edges of a graph. </div> </td></tr> <tr><td><a href="Gmap.E_SRC.html#VALfold_edges_e">fold_edges_e</a> [<a href="Gmap.E_SRC.html">Gmap.E_SRC</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALfold_edges_e">fold_edges_e</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALfold_edges_e">fold_edges_e</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> Fold on all edges of a graph. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALfold_pred">fold_pred</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALfold_pred">fold_pred</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td></td></tr> <tr><td><a href="Flow.G_GOLDBERG.html#VALfold_pred_e">fold_pred_e</a> [<a href="Flow.G_GOLDBERG.html">Flow.G_GOLDBERG</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALfold_pred_e">fold_pred_e</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALfold_pred_e">fold_pred_e</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td></td></tr> <tr><td><a href="Strat.G.html#VALfold_succ">fold_succ</a> [<a href="Strat.G.html">Strat.G</a>]</td> <td></td></tr> <tr><td><a href="Minsep.G.html#VALfold_succ">fold_succ</a> [<a href="Minsep.G.html">Minsep.G</a>]</td> <td></td></tr> <tr><td><a href="Coloring.GM.html#VALfold_succ">fold_succ</a> [<a href="Coloring.GM.html">Coloring.GM</a>]</td> <td></td></tr> <tr><td><a href="Coloring.G.html#VALfold_succ">fold_succ</a> [<a href="Coloring.G.html">Coloring.G</a>]</td> <td></td></tr> <tr><td><a href="Traverse.G.html#VALfold_succ">fold_succ</a> [<a href="Traverse.G.html">Traverse.G</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALfold_succ">fold_succ</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALfold_succ">fold_succ</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td></td></tr> <tr><td><a href="Flow.G_GOLDBERG.html#VALfold_succ_e">fold_succ_e</a> [<a href="Flow.G_GOLDBERG.html">Flow.G_GOLDBERG</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALfold_succ_e">fold_succ_e</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALfold_succ_e">fold_succ_e</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td></td></tr> <tr><td><a href="Strat.G.html#VALfold_vertex">fold_vertex</a> [<a href="Strat.G.html">Strat.G</a>]</td> <td></td></tr> <tr><td><a href="Minsep.G.html#VALfold_vertex">fold_vertex</a> [<a href="Minsep.G.html">Minsep.G</a>]</td> <td></td></tr> <tr><td><a href="Gmap.V_SRC.html#VALfold_vertex">fold_vertex</a> [<a href="Gmap.V_SRC.html">Gmap.V_SRC</a>]</td> <td></td></tr> <tr><td><a href="Kruskal.G.html#VALfold_vertex">fold_vertex</a> [<a href="Kruskal.G.html">Kruskal.G</a>]</td> <td></td></tr> <tr><td><a href="Coloring.GM.html#VALfold_vertex">fold_vertex</a> [<a href="Coloring.GM.html">Coloring.GM</a>]</td> <td></td></tr> <tr><td><a href="Coloring.G.html#VALfold_vertex">fold_vertex</a> [<a href="Coloring.G.html">Coloring.G</a>]</td> <td></td></tr> <tr><td><a href="Traverse.G.html#VALfold_vertex">fold_vertex</a> [<a href="Traverse.G.html">Traverse.G</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALfold_vertex">fold_vertex</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALfold_vertex">fold_vertex</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> Fold on all vertices of a graph. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALford_fulkerson">ford_fulkerson</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> Ford Fulkerson maximum flow algorithm </div> </td></tr> <tr><td><a href="Graphviz.Neato.html#VALfprint_graph">fprint_graph</a> [<a href="Graphviz.Neato.html">Graphviz.Neato</a>]</td> <td><div class="info"> <code class="code">fprint_graph ppf graph</code> pretty prints the graph <code class="code">graph</code> in the CGL language on the formatter <code class="code">ppf</code>. </div> </td></tr> <tr><td><a href="Graphviz.Dot.html#VALfprint_graph">fprint_graph</a> [<a href="Graphviz.Dot.html">Graphviz.Dot</a>]</td> <td><div class="info"> <code class="code">fprint_graph ppf graph</code> pretty prints the graph <code class="code">graph</code> in the CGL language on the formatter <code class="code">ppf</code>. </div> </td></tr> <tr><td><a href="Classic.S.html#VALfull">full</a> [<a href="Classic.S.html">Classic.S</a>]</td> <td><div class="info"> <code class="code">full n</code> builds a graph with <code class="code">n</code> vertices and all possible edges. </div> </td></tr> <tr><td><a href="Sig_pack.S.Classic.html#VALfull">full</a> [<a href="Sig_pack.S.Classic.html">Sig_pack.S.Classic</a>]</td> <td><div class="info"> <code class="code">full n</code> builds a graph with <code class="code">n</code> vertices and all possible edges. </div> </td></tr> <tr><td align="left"><br>G</td></tr> <tr><td><a href="Strat.Algo.html#VALgame">game</a> [<a href="Strat.Algo.html">Strat.Algo</a>]</td> <td><div class="info"> <code class="code">game g p a b</code> returns <code class="code">true</code> iff <code class="code">a</code> wins in <code class="code">g</code> given the completion <code class="code">p</code> (i.e. </div> </td></tr> <tr><td><a href="Coloring.GM.Mark.html#VALget">get</a> [<a href="Coloring.GM.Mark.html">Coloring.GM.Mark</a>]</td> <td></td></tr> <tr><td><a href="Traverse.GM.Mark.html#VALget">get</a> [<a href="Traverse.GM.Mark.html">Traverse.GM.Mark</a>]</td> <td></td></tr> <tr><td><a href="Traverse.Bfs.html#VALget">get</a> [<a href="Traverse.Bfs.html">Traverse.Bfs</a>]</td> <td></td></tr> <tr><td><a href="Traverse.Dfs.html#VALget">get</a> [<a href="Traverse.Dfs.html">Traverse.Dfs</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.Mark.html#VALget">get</a> [<a href="Sig_pack.S.Mark.html">Sig_pack.S.Mark</a>]</td> <td></td></tr> <tr><td><a href="Sig.MARK.html#VALget">get</a> [<a href="Sig.MARK.html">Sig.MARK</a>]</td> <td><div class="info"> Mark value (in O(1)). </div> </td></tr> <tr><td><a href="Strat.PLAYER.html#VALget_initial">get_initial</a> [<a href="Strat.PLAYER.html">Strat.PLAYER</a>]</td> <td></td></tr> <tr><td><a href="Graphviz.GraphWithDotAttrs.html#VALget_subgraph">get_subgraph</a> [<a href="Graphviz.GraphWithDotAttrs.html">Graphviz.GraphWithDotAttrs</a>]</td> <td><div class="info"> The box (if exists) which the vertex belongs to. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALgoldberg">goldberg</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> Goldberg maximum flow algorithm </div> </td></tr> <tr><td><a href="Rand.Planar.S.html#VALgraph">graph</a> [<a href="Rand.Planar.S.html">Rand.Planar.S</a>]</td> <td><div class="info"> <code class="code">graph xrange yrange prob v</code> generates a random planar graph with exactly <code class="code">v</code> vertices. </div> </td></tr> <tr><td><a href="Rand.S.html#VALgraph">graph</a> [<a href="Rand.S.html">Rand.S</a>]</td> <td><div class="info"> <code class="code">graph v e</code> generates a random graph with exactly <code class="code">v</code> vertices and <code class="code">e</code> edges. </div> </td></tr> <tr><td><a href="Sig_pack.S.Rand.html#VALgraph">graph</a> [<a href="Sig_pack.S.Rand.html">Sig_pack.S.Rand</a>]</td> <td><div class="info"> <code class="code">random v e</code> generates a random with <code class="code">v</code> vertices and <code class="code">e</code> edges. </div> </td></tr> <tr><td><a href="Graphviz.GraphWithDotAttrs.html#VALgraph_attributes">graph_attributes</a> [<a href="Graphviz.GraphWithDotAttrs.html">Graphviz.GraphWithDotAttrs</a>]</td> <td><div class="info"> Graph, vertex and edge attributes. </div> </td></tr> <tr><td align="left"><br>H</td></tr> <tr><td><a href="Graphviz.Neato.html#VALhandle_error">handle_error</a> [<a href="Graphviz.Neato.html">Graphviz.Neato</a>]</td> <td></td></tr> <tr><td><a href="Traverse.Mark.html#VALhas_cycle">has_cycle</a> [<a href="Traverse.Mark.html">Traverse.Mark</a>]</td> <td><div class="info"> <code class="code">has_cycle g</code> checks for a cycle in <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Traverse.Dfs.html#VALhas_cycle">has_cycle</a> [<a href="Traverse.Dfs.html">Traverse.Dfs</a>]</td> <td><div class="info"> <code class="code">has_cycle g</code> checks for a cycle in <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig_pack.S.Marking.html#VALhas_cycle">has_cycle</a> [<a href="Sig_pack.S.Marking.html">Sig_pack.S.Marking</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.Dfs.html#VALhas_cycle">has_cycle</a> [<a href="Sig_pack.S.Dfs.html">Sig_pack.S.Dfs</a>]</td> <td></td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueTreeV.html#VALhash">hash</a> [<a href="Cliquetree.CliqueTree.CliqueTreeV.html">Cliquetree.CliqueTree.CliqueTreeV</a>]</td> <td></td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueV.html#VALhash">hash</a> [<a href="Cliquetree.CliqueTree.CliqueV.html">Cliquetree.CliqueTree.CliqueV</a>]</td> <td></td></tr> <tr><td><a href="Gml.G.V.html#VALhash">hash</a> [<a href="Gml.G.V.html">Gml.G.V</a>]</td> <td></td></tr> <tr><td><a href="Util.DataV.html#VALhash">hash</a> [<a href="Util.DataV.html">Util.DataV</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.V.html#VALhash">hash</a> [<a href="Sig_pack.S.V.html">Sig_pack.S.V</a>]</td> <td></td></tr> <tr><td><a href="Sig.COMPARABLE.html#VALhash">hash</a> [<a href="Sig.COMPARABLE.html">Sig.COMPARABLE</a>]</td> <td></td></tr> <tr><td><a href="Sig.HASHABLE.html#VALhash">hash</a> [<a href="Sig.HASHABLE.html">Sig.HASHABLE</a>]</td> <td></td></tr> <tr><td><a href="Sig.VERTEX.html#VALhash">hash</a> [<a href="Sig.VERTEX.html">Sig.VERTEX</a>]</td> <td></td></tr> <tr><td align="left"><br>I</td></tr> <tr><td><a href="Delaunay.CCC.html#VALin_circle">in_circle</a> [<a href="Delaunay.CCC.html">Delaunay.CCC</a>]</td> <td><div class="info"> The relation <code class="code">in_circle p q r s</code> states that <code class="code">s</code> lies inside the circle <code class="code">(p,q,r)</code> if <code class="code">ccw p q r</code> is true, or outside that circle if <code class="code">ccw p q r</code> is false. </div> </td></tr> <tr><td><a href="Topological.G.html#VALin_degree">in_degree</a> [<a href="Topological.G.html">Topological.G</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALin_degree">in_degree</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">in_degree g v</code> returns the in-degree of <code class="code">v</code> in <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.G.html#VALin_degree">in_degree</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> <code class="code">in_degree g v</code> returns the in-degree of <code class="code">v</code> in <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Kruskal.UNIONFIND.html#VALinit">init</a> [<a href="Kruskal.UNIONFIND.html">Kruskal.UNIONFIND</a>]</td> <td></td></tr> <tr><td><a href="Oper.S.html#VALintersect">intersect</a> [<a href="Oper.S.html">Oper.S</a>]</td> <td><div class="info"> <code class="code">intersect g1 g2</code> returns a new graph which is the intersection of <code class="code">g1</code> and <code class="code">g2</code>: each vertex and edge present in <code class="code">g1</code> *and* <code class="code">g2</code> is present in the resulting graph. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALintersect">intersect</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">intersect g1 g2</code> returns a new graph which is the intersection of <code class="code">g1</code> and <code class="code">g2</code>: each vertex and edge present in <code class="code">g1</code> *and* <code class="code">g2</code> is present in the resulting graph. </div> </td></tr> <tr><td><a href="Cliquetree.CliqueTree.html#VALis_chordal">is_chordal</a> [<a href="Cliquetree.CliqueTree.html">Cliquetree.CliqueTree</a>]</td> <td><div class="info"> <code class="code">is_chordal g</code> uses the clique tree construction to test if a graph is chordal or not. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALis_directed">is_directed</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> is this an implementation of directed graphs? </div> </td></tr> <tr><td><a href="Sig.G.html#VALis_directed">is_directed</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> Is this an implementation of directed graphs? </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALis_empty">is_empty</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALis_empty">is_empty</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td></td></tr> <tr><td><a href="Strat.PLAYER.html#VALis_final">is_final</a> [<a href="Strat.PLAYER.html">Strat.PLAYER</a>]</td> <td></td></tr> <tr><td><a href="Topological.Make.html#VALiter">iter</a> [<a href="Topological.Make.html">Topological.Make</a>]</td> <td><div class="info"> <code class="code">iter action</code> calls <code class="code">action node</code> repeatedly. </div> </td></tr> <tr><td><a href="Traverse.Bfs.html#VALiter">iter</a> [<a href="Traverse.Bfs.html">Traverse.Bfs</a>]</td> <td></td></tr> <tr><td><a href="Traverse.Dfs.html#VALiter">iter</a> [<a href="Traverse.Dfs.html">Traverse.Dfs</a>]</td> <td><div class="info"> <code class="code">iter pre post g</code> visits all nodes of <code class="code">g</code> in depth-first search, applying <code class="code">pre</code> to each visited node before its successors, and <code class="code">post</code> after them. </div> </td></tr> <tr><td><a href="Delaunay.Triangulation.html#VALiter">iter</a> [<a href="Delaunay.Triangulation.html">Delaunay.Triangulation</a>]</td> <td><div class="info"> <code class="code">iter f t</code> iterates over all edges of the triangulation <code class="code">t</code>. </div> </td></tr> <tr><td><a href="Sig_pack.S.Topological.html#VALiter">iter</a> [<a href="Sig_pack.S.Topological.html">Sig_pack.S.Topological</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.Bfs.html#VALiter">iter</a> [<a href="Sig_pack.S.Bfs.html">Sig_pack.S.Bfs</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.Dfs.html#VALiter">iter</a> [<a href="Sig_pack.S.Dfs.html">Sig_pack.S.Dfs</a>]</td> <td><div class="info"> <code class="code">iter pre post g</code> visits all nodes of <code class="code">g</code> in depth-first search, applying <code class="code">pre</code> to each visited node before its successors, and <code class="code">post</code> after them. </div> </td></tr> <tr><td><a href="Traverse.Bfs.html#VALiter_component">iter_component</a> [<a href="Traverse.Bfs.html">Traverse.Bfs</a>]</td> <td></td></tr> <tr><td><a href="Traverse.Dfs.html#VALiter_component">iter_component</a> [<a href="Traverse.Dfs.html">Traverse.Dfs</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.Bfs.html#VALiter_component">iter_component</a> [<a href="Sig_pack.S.Bfs.html">Sig_pack.S.Bfs</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.Dfs.html#VALiter_component">iter_component</a> [<a href="Sig_pack.S.Dfs.html">Sig_pack.S.Dfs</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALiter_edges">iter_edges</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALiter_edges">iter_edges</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> Iter on all edges of a graph. </div> </td></tr> <tr><td><a href="Gml.G.html#VALiter_edges_e">iter_edges_e</a> [<a href="Gml.G.html">Gml.G</a>]</td> <td></td></tr> <tr><td><a href="Flow.G_GOLDBERG.html#VALiter_edges_e">iter_edges_e</a> [<a href="Flow.G_GOLDBERG.html">Flow.G_GOLDBERG</a>]</td> <td></td></tr> <tr><td><a href="Kruskal.G.html#VALiter_edges_e">iter_edges_e</a> [<a href="Kruskal.G.html">Kruskal.G</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALiter_edges_e">iter_edges_e</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALiter_edges_e">iter_edges_e</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> Iter on all edges of a graph. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALiter_pred">iter_pred</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALiter_pred">iter_pred</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td></td></tr> <tr><td><a href="Flow.G_FORD_FULKERSON.html#VALiter_pred_e">iter_pred_e</a> [<a href="Flow.G_FORD_FULKERSON.html">Flow.G_FORD_FULKERSON</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALiter_pred_e">iter_pred_e</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALiter_pred_e">iter_pred_e</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td></td></tr> <tr><td><a href="Minsep.G.html#VALiter_succ">iter_succ</a> [<a href="Minsep.G.html">Minsep.G</a>]</td> <td></td></tr> <tr><td><a href="Components.G.html#VALiter_succ">iter_succ</a> [<a href="Components.G.html">Components.G</a>]</td> <td></td></tr> <tr><td><a href="Topological.G.html#VALiter_succ">iter_succ</a> [<a href="Topological.G.html">Topological.G</a>]</td> <td></td></tr> <tr><td><a href="Coloring.GM.html#VALiter_succ">iter_succ</a> [<a href="Coloring.GM.html">Coloring.GM</a>]</td> <td></td></tr> <tr><td><a href="Coloring.G.html#VALiter_succ">iter_succ</a> [<a href="Coloring.G.html">Coloring.G</a>]</td> <td></td></tr> <tr><td><a href="Traverse.GM.html#VALiter_succ">iter_succ</a> [<a href="Traverse.GM.html">Traverse.GM</a>]</td> <td></td></tr> <tr><td><a href="Traverse.G.html#VALiter_succ">iter_succ</a> [<a href="Traverse.G.html">Traverse.G</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALiter_succ">iter_succ</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALiter_succ">iter_succ</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td></td></tr> <tr><td><a href="Flow.G_FORD_FULKERSON.html#VALiter_succ_e">iter_succ_e</a> [<a href="Flow.G_FORD_FULKERSON.html">Flow.G_FORD_FULKERSON</a>]</td> <td></td></tr> <tr><td><a href="Path.G.html#VALiter_succ_e">iter_succ_e</a> [<a href="Path.G.html">Path.G</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALiter_succ_e">iter_succ_e</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALiter_succ_e">iter_succ_e</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td></td></tr> <tr><td><a href="Delaunay.Triangulation.html#VALiter_triangles">iter_triangles</a> [<a href="Delaunay.Triangulation.html">Delaunay.Triangulation</a>]</td> <td></td></tr> <tr><td><a href="Minsep.G.html#VALiter_vertex">iter_vertex</a> [<a href="Minsep.G.html">Minsep.G</a>]</td> <td></td></tr> <tr><td><a href="Gml.G.html#VALiter_vertex">iter_vertex</a> [<a href="Gml.G.html">Gml.G</a>]</td> <td></td></tr> <tr><td><a href="Flow.G_GOLDBERG.html#VALiter_vertex">iter_vertex</a> [<a href="Flow.G_GOLDBERG.html">Flow.G_GOLDBERG</a>]</td> <td></td></tr> <tr><td><a href="Components.G.html#VALiter_vertex">iter_vertex</a> [<a href="Components.G.html">Components.G</a>]</td> <td></td></tr> <tr><td><a href="Topological.G.html#VALiter_vertex">iter_vertex</a> [<a href="Topological.G.html">Topological.G</a>]</td> <td></td></tr> <tr><td><a href="Coloring.GM.html#VALiter_vertex">iter_vertex</a> [<a href="Coloring.GM.html">Coloring.GM</a>]</td> <td></td></tr> <tr><td><a href="Coloring.G.html#VALiter_vertex">iter_vertex</a> [<a href="Coloring.G.html">Coloring.G</a>]</td> <td></td></tr> <tr><td><a href="Traverse.GM.html#VALiter_vertex">iter_vertex</a> [<a href="Traverse.GM.html">Traverse.GM</a>]</td> <td></td></tr> <tr><td><a href="Traverse.G.html#VALiter_vertex">iter_vertex</a> [<a href="Traverse.G.html">Traverse.G</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALiter_vertex">iter_vertex</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALiter_vertex">iter_vertex</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> Iter on all vertices of a graph. </div> </td></tr> <tr><td align="left"><br>L</td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueTreeV.html#VALlabel">label</a> [<a href="Cliquetree.CliqueTree.CliqueTreeV.html">Cliquetree.CliqueTree.CliqueTreeV</a>]</td> <td></td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueV.html#VALlabel">label</a> [<a href="Cliquetree.CliqueTree.CliqueV.html">Cliquetree.CliqueTree.CliqueV</a>]</td> <td></td></tr> <tr><td><a href="Gml.G.E.html#VALlabel">label</a> [<a href="Gml.G.E.html">Gml.G.E</a>]</td> <td></td></tr> <tr><td><a href="Gml.G.V.html#VALlabel">label</a> [<a href="Gml.G.V.html">Gml.G.V</a>]</td> <td></td></tr> <tr><td><a href="Flow.G_FORD_FULKERSON.E.html#VALlabel">label</a> [<a href="Flow.G_FORD_FULKERSON.E.html">Flow.G_FORD_FULKERSON.E</a>]</td> <td></td></tr> <tr><td><a href="Kruskal.G.E.html#VALlabel">label</a> [<a href="Kruskal.G.E.html">Kruskal.G.E</a>]</td> <td></td></tr> <tr><td><a href="Path.G.E.html#VALlabel">label</a> [<a href="Path.G.E.html">Path.G.E</a>]</td> <td></td></tr> <tr><td><a href="Util.DataV.html#VALlabel">label</a> [<a href="Util.DataV.html">Util.DataV</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.E.html#VALlabel">label</a> [<a href="Sig_pack.S.E.html">Sig_pack.S.E</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.V.html#VALlabel">label</a> [<a href="Sig_pack.S.V.html">Sig_pack.S.V</a>]</td> <td></td></tr> <tr><td><a href="Sig.EDGE.html#VALlabel">label</a> [<a href="Sig.EDGE.html">Sig.EDGE</a>]</td> <td><div class="info"> Get the label of an edge. </div> </td></tr> <tr><td><a href="Sig.VERTEX.html#VALlabel">label</a> [<a href="Sig.VERTEX.html">Sig.VERTEX</a>]</td> <td></td></tr> <tr><td><a href="Rand.S.html#VALlabeled">labeled</a> [<a href="Rand.S.html">Rand.S</a>]</td> <td><div class="info"> <code class="code">labeled f</code> is similar to <code class="code">graph</code> except that edges are labeled using function <code class="code">f</code>. </div> </td></tr> <tr><td><a href="Sig_pack.S.Rand.html#VALlabeled">labeled</a> [<a href="Sig_pack.S.Rand.html">Sig_pack.S.Rand</a>]</td> <td><div class="info"> <code class="code">random_labeled f</code> is similar to <code class="code">random</code> except that edges are labeled using function <code class="code">f</code> </div> </td></tr> <tr><td><a href="Oper.Neighbourhood.html#VALlist_from_vertex">list_from_vertex</a> [<a href="Oper.Neighbourhood.html">Oper.Neighbourhood</a>]</td> <td><div class="info"> Neighbourhood of a vertex as a list. </div> </td></tr> <tr><td><a href="Oper.Neighbourhood.html#VALlist_from_vertices">list_from_vertices</a> [<a href="Oper.Neighbourhood.html">Oper.Neighbourhood</a>]</td> <td><div class="info"> Neighbourhood of a list of vertices as a list. </div> </td></tr> <tr><td><a href="Minsep.MINSEP.html#VALlist_of_allminsep">list_of_allminsep</a> [<a href="Minsep.MINSEP.html">Minsep.MINSEP</a>]</td> <td><div class="info"> Less efficient that <code class="code">allminsep</code> </div> </td></tr> <tr><td align="left"><br>M</td></tr> <tr><td><a href="Imperative.Matrix.S.html#VALmake">make</a> [<a href="Imperative.Matrix.S.html">Imperative.Matrix.S</a>]</td> <td><div class="info"> Creation. </div> </td></tr> <tr><td><a href="Gmap.Edge.html#VALmap">map</a> [<a href="Gmap.Edge.html">Gmap.Edge</a>]</td> <td><div class="info"> <code class="code">map f g</code> applies <code class="code">f</code> to each edge of <code class="code">g</code> and so builds a new graph based on <code class="code">g</code> </div> </td></tr> <tr><td><a href="Gmap.Vertex.html#VALmap">map</a> [<a href="Gmap.Vertex.html">Gmap.Vertex</a>]</td> <td><div class="info"> <code class="code">map f g</code> applies <code class="code">f</code> to each vertex of <code class="code">g</code> and so builds a new graph based on <code class="code">g</code> </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALmap_vertex">map_vertex</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> map iterator on vertex </div> </td></tr> <tr><td><a href="Sig.G.html#VALmap_vertex">map_vertex</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> Map on all vertices of a graph. </div> </td></tr> <tr><td><a href="Flow.FLOW.html#VALmax_capacity">max_capacity</a> [<a href="Flow.FLOW.html">Flow.FLOW</a>]</td> <td></td></tr> <tr><td><a href="Flow.Ford_Fulkerson.html#VALmaxflow">maxflow</a> [<a href="Flow.Ford_Fulkerson.html">Flow.Ford_Fulkerson</a>]</td> <td><div class="info"> <code class="code">maxflow g v1 v2</code> searchs the maximal flow from source <code class="code">v1</code> to terminal <code class="code">v2</code> using the Ford-Fulkerson algorithm. </div> </td></tr> <tr><td><a href="Flow.Goldberg.html#VALmaxflow">maxflow</a> [<a href="Flow.Goldberg.html">Flow.Goldberg</a>]</td> <td><div class="info"> <code class="code">maxflow g v1 v2</code> searchs the maximal flow from source <code class="code">v1</code> to terminal <code class="code">v2</code> using the Goldberg algorithm. </div> </td></tr> <tr><td><a href="Cliquetree.CliqueTree.html#VALmaxwidth">maxwidth</a> [<a href="Cliquetree.CliqueTree.html">Cliquetree.CliqueTree</a>]</td> <td><div class="info"> <code class="code">maxwidth g tri tree</code> returns the maxwidth characteristic of the triangulation <code class="code">tri</code> of graph <code class="code">g</code> given the clique tree <code class="code">tree</code> of <code class="code">tri</code>. </div> </td></tr> <tr><td><a href="Cliquetree.CliqueTree.html#VALmcs_clique">mcs_clique</a> [<a href="Cliquetree.CliqueTree.html">Cliquetree.CliqueTree</a>]</td> <td><div class="info"> <code class="code">mcs_clique g</code> return an perfect elimination order of <code class="code">g</code> (if it is chordal), the clique tree of <code class="code">g</code> and its root. </div> </td></tr> <tr><td><a href="Mcs_m.MaximalCardinalitySearch.I.html#VALmcsm">mcsm</a> [<a href="Mcs_m.MaximalCardinalitySearch.I.html">Mcs_m.MaximalCardinalitySearch.I</a>]</td> <td><div class="info"> <code class="code">mcsm g</code> return a tuple <code class="code">(o, e)</code> where o is a perfect elimination order of <code class="code">g'</code> where <code class="code">g'</code> is the triangulation <code class="code">e</code> applied to <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Mcs_m.MaximalCardinalitySearch.P.html#VALmcsm">mcsm</a> [<a href="Mcs_m.MaximalCardinalitySearch.P.html">Mcs_m.MaximalCardinalitySearch.P</a>]</td> <td><div class="info"> <code class="code">mcsm g</code> returns a tuple <code class="code">(o, e)</code> where <code class="code">o</code> is a perfect elimination order of <code class="code">g'</code> where <code class="code">g'</code> is the triangulation <code class="code">e</code> applied to <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Md.I.html#VALmd">md</a> [<a href="Md.I.html">Md.I</a>]</td> <td><div class="info"> <code class="code">md g</code> return a tuple <code class="code">(g', e, o)</code> where <code class="code">g'</code> is a triangulated graph, <code class="code">e</code> is the triangulation of <code class="code">g</code> and <code class="code">o</code> is a perfect elimination order of <code class="code">g'</code> </div> </td></tr> <tr><td><a href="Md.P.html#VALmd">md</a> [<a href="Md.P.html">Md.P</a>]</td> <td><div class="info"> <code class="code">md g</code> return a tuple <code class="code">(g', e, o)</code> where <code class="code">g'</code> is a triangulated graph, <code class="code">e</code> is the triangulation of <code class="code">g</code> and <code class="code">o</code> is a perfect elimination order of <code class="code">g'</code> </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALmem_edge">mem_edge</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALmem_edge">mem_edge</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALmem_edge_e">mem_edge_e</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALmem_edge_e">mem_edge_e</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td></td></tr> <tr><td><a href="Strat.G.html#VALmem_vertex">mem_vertex</a> [<a href="Strat.G.html">Strat.G</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALmem_vertex">mem_vertex</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALmem_vertex">mem_vertex</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td></td></tr> <tr><td><a href="Flow.FLOW.html#VALmin_capacity">min_capacity</a> [<a href="Flow.FLOW.html">Flow.FLOW</a>]</td> <td></td></tr> <tr><td><a href="Oper.S.html#VALmirror">mirror</a> [<a href="Oper.S.html">Oper.S</a>]</td> <td><div class="info"> <code class="code">mirror g</code> returns a new graph which is the mirror image of <code class="code">g</code>: each edge from <code class="code">u</code> to <code class="code">v</code> has been replaced by an edge from <code class="code">v</code> to <code class="code">u</code>. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALmirror">mirror</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">mirror g</code> returns a new graph which is the mirror image of <code class="code">g</code>: each edge from <code class="code">u</code> to <code class="code">v</code> has been replaced by an edge from <code class="code">v</code> to <code class="code">u</code>. </div> </td></tr> <tr><td align="left"><br>N</td></tr> <tr><td><a href="Sig_pack.S.html#VALnb_edges">nb_edges</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALnb_edges">nb_edges</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td></td></tr> <tr><td><a href="Flow.G_GOLDBERG.html#VALnb_vertex">nb_vertex</a> [<a href="Flow.G_GOLDBERG.html">Flow.G_GOLDBERG</a>]</td> <td></td></tr> <tr><td><a href="Coloring.GM.html#VALnb_vertex">nb_vertex</a> [<a href="Coloring.GM.html">Coloring.GM</a>]</td> <td></td></tr> <tr><td><a href="Coloring.G.html#VALnb_vertex">nb_vertex</a> [<a href="Coloring.G.html">Coloring.G</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALnb_vertex">nb_vertex</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig.G.html#VALnb_vertex">nb_vertex</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td></td></tr> <tr><td><a href="Strat.STRAT.html#VALnext">next</a> [<a href="Strat.STRAT.html">Strat.STRAT</a>]</td> <td><div class="info"> </div> </td></tr> <tr><td align="left"><br>O</td></tr> <tr><td><a href="Coloring.GM.html#VALout_degree">out_degree</a> [<a href="Coloring.GM.html">Coloring.GM</a>]</td> <td></td></tr> <tr><td><a href="Coloring.G.html#VALout_degree">out_degree</a> [<a href="Coloring.G.html">Coloring.G</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALout_degree">out_degree</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">out_degree g v</code> returns the out-degree of <code class="code">v</code> in <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.G.html#VALout_degree">out_degree</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> <code class="code">out_degree g v</code> returns the out-degree of <code class="code">v</code> in <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Graphviz.Neato.html#VALoutput_graph">output_graph</a> [<a href="Graphviz.Neato.html">Graphviz.Neato</a>]</td> <td><div class="info"> <code class="code">output_graph oc graph</code> pretty prints the graph <code class="code">graph</code> in the dot language on the channel <code class="code">oc</code>. </div> </td></tr> <tr><td><a href="Graphviz.Dot.html#VALoutput_graph">output_graph</a> [<a href="Graphviz.Dot.html">Graphviz.Dot</a>]</td> <td><div class="info"> <code class="code">output_graph oc graph</code> pretty prints the graph <code class="code">graph</code> in the dot language on the channel <code class="code">oc</code>. </div> </td></tr> <tr><td align="left"><br>P</td></tr> <tr><td><a href="Dot.Parse.html#VALparse">parse</a> [<a href="Dot.Parse.html">Dot.Parse</a>]</td> <td><div class="info"> Parses a dot file </div> </td></tr> <tr><td><a href="Gml.Parse.html#VALparse">parse</a> [<a href="Gml.Parse.html">Gml.Parse</a>]</td> <td></td></tr> <tr><td><a href="Dot.Parse.html#VALparse_bounding_box_and_clusters">parse_bounding_box_and_clusters</a> [<a href="Dot.Parse.html">Dot.Parse</a>]</td> <td><div class="info"> Parses a dot file and returns the graph, its bounding box and a hash table from clusters to dot attributes </div> </td></tr> <tr><td><a href="Dot.html#VALparse_dot_ast">parse_dot_ast</a> [<a href="Dot.html">Dot</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALparse_dot_file">parse_dot_file</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALparse_gml_file">parse_gml_file</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td><a href="Traverse.Dfs.html#VALpostfix">postfix</a> [<a href="Traverse.Dfs.html">Traverse.Dfs</a>]</td> <td><div class="info"> applies only a postfix function. </div> </td></tr> <tr><td><a href="Sig_pack.S.Dfs.html#VALpostfix">postfix</a> [<a href="Sig_pack.S.Dfs.html">Sig_pack.S.Dfs</a>]</td> <td><div class="info"> applies only a postfix function </div> </td></tr> <tr><td><a href="Traverse.Dfs.html#VALpostfix_component">postfix_component</a> [<a href="Traverse.Dfs.html">Traverse.Dfs</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.Dfs.html#VALpostfix_component">postfix_component</a> [<a href="Sig_pack.S.Dfs.html">Sig_pack.S.Dfs</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALpred">pred</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">pred g v</code> returns the predecessors of <code class="code">v</code> in <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.G.html#VALpred">pred</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> <code class="code">pred g v</code> returns the predecessors of <code class="code">v</code> in <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALpred_e">pred_e</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">pred_e g v</code> returns the edges going to <code class="code">v</code> in <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.G.html#VALpred_e">pred_e</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> <code class="code">pred_e g v</code> returns the edges going to <code class="code">v</code> in <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Traverse.Dfs.html#VALprefix">prefix</a> [<a href="Traverse.Dfs.html">Traverse.Dfs</a>]</td> <td><div class="info"> applies only a prefix function; note that this function is more efficient than <code class="code">iter</code> and is tail-recursive. </div> </td></tr> <tr><td><a href="Sig_pack.S.Dfs.html#VALprefix">prefix</a> [<a href="Sig_pack.S.Dfs.html">Sig_pack.S.Dfs</a>]</td> <td><div class="info"> applies only a prefix function </div> </td></tr> <tr><td><a href="Traverse.Dfs.html#VALprefix_component">prefix_component</a> [<a href="Traverse.Dfs.html">Traverse.Dfs</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.Dfs.html#VALprefix_component">prefix_component</a> [<a href="Sig_pack.S.Dfs.html">Sig_pack.S.Dfs</a>]</td> <td></td></tr> <tr><td><a href="Gml.Print.html#VALprint">print</a> [<a href="Gml.Print.html">Gml.Print</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALprint_gml_file">print_gml_file</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td></td></tr> <tr><td align="left"><br>R</td></tr> <tr><td><a href="Rand.S.html#VALrandom_few_edges">random_few_edges</a> [<a href="Rand.S.html">Rand.S</a>]</td> <td></td></tr> <tr><td><a href="Rand.S.html#VALrandom_many_edges">random_many_edges</a> [<a href="Rand.S.html">Rand.S</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALremove_edge">remove_edge</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">remove_edge g v1 v2</code> removes the edge going from <code class="code">v1</code> to <code class="code">v2</code> from the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.I.html#VALremove_edge">remove_edge</a> [<a href="Sig.I.html">Sig.I</a>]</td> <td><div class="info"> <code class="code">remove_edge g v1 v2</code> removes the edge going from <code class="code">v1</code> to <code class="code">v2</code> from the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.P.html#VALremove_edge">remove_edge</a> [<a href="Sig.P.html">Sig.P</a>]</td> <td><div class="info"> <code class="code">remove_edge g v1 v2</code> removes the edge going from <code class="code">v1</code> to <code class="code">v2</code> from the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALremove_edge_e">remove_edge_e</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">remove_edge_e g e</code> removes the edge <code class="code">e</code> from the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.I.html#VALremove_edge_e">remove_edge_e</a> [<a href="Sig.I.html">Sig.I</a>]</td> <td><div class="info"> <code class="code">remove_edge_e g e</code> removes the edge <code class="code">e</code> from the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.P.html#VALremove_edge_e">remove_edge_e</a> [<a href="Sig.P.html">Sig.P</a>]</td> <td><div class="info"> <code class="code">remove_edge_e g e</code> removes the edge <code class="code">e</code> from the graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALremove_vertex">remove_vertex</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">remove g v</code> removes the vertex <code class="code">v</code> from the graph <code class="code">g</code> (and all the edges going from <code class="code">v</code> in <code class="code">g</code>). </div> </td></tr> <tr><td><a href="Sig.I.html#VALremove_vertex">remove_vertex</a> [<a href="Sig.I.html">Sig.I</a>]</td> <td><div class="info"> <code class="code">remove g v</code> removes the vertex <code class="code">v</code> from the graph <code class="code">g</code> (and all the edges going from <code class="code">v</code> in <code class="code">g</code>). </div> </td></tr> <tr><td><a href="Sig.P.html#VALremove_vertex">remove_vertex</a> [<a href="Sig.P.html">Sig.P</a>]</td> <td><div class="info"> <code class="code">remove g v</code> removes the vertex <code class="code">v</code> from the graph <code class="code">g</code> (and all the edges going from <code class="code">v</code> in <code class="code">g</code>). </div> </td></tr> <tr><td align="left"><br>S</td></tr> <tr><td><a href="Components.Make.html#VALscc">scc</a> [<a href="Components.Make.html">Components.Make</a>]</td> <td><div class="info"> <code class="code">scc g</code> computes the strongly connected components of <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig_pack.S.Components.html#VALscc">scc</a> [<a href="Sig_pack.S.Components.html">Sig_pack.S.Components</a>]</td> <td><div class="info"> strongly connected components </div> </td></tr> <tr><td><a href="Components.Make.html#VALscc_array">scc_array</a> [<a href="Components.Make.html">Components.Make</a>]</td> <td><div class="info"> <code class="code">scc_array</code> computes the strongly connected components of <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig_pack.S.Components.html#VALscc_array">scc_array</a> [<a href="Sig_pack.S.Components.html">Sig_pack.S.Components</a>]</td> <td></td></tr> <tr><td><a href="Components.Make.html#VALscc_list">scc_list</a> [<a href="Components.Make.html">Components.Make</a>]</td> <td><div class="info"> <code class="code">scc_list</code> computes the strongly connected components of <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig_pack.S.Components.html#VALscc_list">scc_list</a> [<a href="Sig_pack.S.Components.html">Sig_pack.S.Components</a>]</td> <td></td></tr> <tr><td><a href="Coloring.GM.Mark.html#VALset">set</a> [<a href="Coloring.GM.Mark.html">Coloring.GM.Mark</a>]</td> <td></td></tr> <tr><td><a href="Traverse.GM.Mark.html#VALset">set</a> [<a href="Traverse.GM.Mark.html">Traverse.GM.Mark</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.Mark.html#VALset">set</a> [<a href="Sig_pack.S.Mark.html">Sig_pack.S.Mark</a>]</td> <td></td></tr> <tr><td><a href="Sig.MARK.html#VALset">set</a> [<a href="Sig.MARK.html">Sig.MARK</a>]</td> <td><div class="info"> Set the mark of the given vertex. </div> </td></tr> <tr><td><a href="Graphviz.Neato.html#VALset_command">set_command</a> [<a href="Graphviz.Neato.html">Graphviz.Neato</a>]</td> <td><div class="info"> Several functions provided by this module run the external program <i>neato</i>. </div> </td></tr> <tr><td><a href="Util.DataV.html#VALset_data">set_data</a> [<a href="Util.DataV.html">Util.DataV</a>]</td> <td></td></tr> <tr><td><a href="Oper.Neighbourhood.html#VALset_from_vertex">set_from_vertex</a> [<a href="Oper.Neighbourhood.html">Oper.Neighbourhood</a>]</td> <td><div class="info"> Neighbourhood of a vertex as a set. </div> </td></tr> <tr><td><a href="Oper.Neighbourhood.html#VALset_from_vertices">set_from_vertices</a> [<a href="Oper.Neighbourhood.html">Oper.Neighbourhood</a>]</td> <td><div class="info"> Neighbourhood of a list of vertices as a set. </div> </td></tr> <tr><td><a href="Minsep.MINSEP.html#VALset_of_allminsep">set_of_allminsep</a> [<a href="Minsep.MINSEP.html">Minsep.MINSEP</a>]</td> <td><div class="info"> Less efficient that <code class="code">allminsep</code> </div> </td></tr> <tr><td><a href="Path.Dijkstra.html#VALshortest_path">shortest_path</a> [<a href="Path.Dijkstra.html">Path.Dijkstra</a>]</td> <td><div class="info"> <code class="code">shortest_path g v1 v2</code> computes the shortest path from vertex <code class="code">v1</code> to vertex <code class="code">v2</code> in graph <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALshortest_path">shortest_path</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> Dijkstra's shortest path algorithm. </div> </td></tr> <tr><td><a href="Kruskal.Generic.html#VALspanningtree">spanningtree</a> [<a href="Kruskal.Generic.html">Kruskal.Generic</a>]</td> <td></td></tr> <tr><td><a href="Kruskal.Make.html#VALspanningtree">spanningtree</a> [<a href="Kruskal.Make.html">Kruskal.Make</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALspanningtree">spanningtree</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> Kruskal algorithm </div> </td></tr> <tr><td><a href="Gml.G.E.html#VALsrc">src</a> [<a href="Gml.G.E.html">Gml.G.E</a>]</td> <td></td></tr> <tr><td><a href="Flow.G_FORD_FULKERSON.E.html#VALsrc">src</a> [<a href="Flow.G_FORD_FULKERSON.E.html">Flow.G_FORD_FULKERSON.E</a>]</td> <td></td></tr> <tr><td><a href="Kruskal.G.E.html#VALsrc">src</a> [<a href="Kruskal.G.E.html">Kruskal.G.E</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.E.html#VALsrc">src</a> [<a href="Sig_pack.S.E.html">Sig_pack.S.E</a>]</td> <td></td></tr> <tr><td><a href="Sig.EDGE.html#VALsrc">src</a> [<a href="Sig.EDGE.html">Sig.EDGE</a>]</td> <td><div class="info"> Edge origin. </div> </td></tr> <tr><td><a href="Traverse.Bfs.html#VALstart">start</a> [<a href="Traverse.Bfs.html">Traverse.Bfs</a>]</td> <td></td></tr> <tr><td><a href="Traverse.Dfs.html#VALstart">start</a> [<a href="Traverse.Dfs.html">Traverse.Dfs</a>]</td> <td></td></tr> <tr><td><a href="Traverse.Bfs.html#VALstep">step</a> [<a href="Traverse.Bfs.html">Traverse.Bfs</a>]</td> <td></td></tr> <tr><td><a href="Traverse.Dfs.html#VALstep">step</a> [<a href="Traverse.Dfs.html">Traverse.Dfs</a>]</td> <td></td></tr> <tr><td><a href="Strat.Algo.html#VALstrategy">strategy</a> [<a href="Strat.Algo.html">Strat.Algo</a>]</td> <td><div class="info"> <code class="code">strategy g p s</code> returns <code class="code">true</code> iff <code class="code">s</code> wins in <code class="code">g</code> given the completion <code class="code">p</code>, whatever strategy plays the other player. </div> </td></tr> <tr><td><a href="Strat.Algo.html#VALstrategyA">strategyA</a> [<a href="Strat.Algo.html">Strat.Algo</a>]</td> <td><div class="info"> <code class="code">strategyA g p</code> returns <code class="code">true</code> iff there exists <code class="code">a</code> winning stragegy for the true player. </div> </td></tr> <tr><td><a href="Flow.FLOW.html#VALsub">sub</a> [<a href="Flow.FLOW.html">Flow.FLOW</a>]</td> <td></td></tr> <tr><td><a href="Strat.G.html#VALsucc">succ</a> [<a href="Strat.G.html">Strat.G</a>]</td> <td></td></tr> <tr><td><a href="Minsep.G.html#VALsucc">succ</a> [<a href="Minsep.G.html">Minsep.G</a>]</td> <td></td></tr> <tr><td><a href="Sig_pack.S.html#VALsucc">succ</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">succ g v</code> returns the successors of <code class="code">v</code> in <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.G.html#VALsucc">succ</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> <code class="code">succ g v</code> returns the successors of <code class="code">v</code> in <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALsucc_e">succ_e</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">succ_e g v</code> returns the edges going from <code class="code">v</code> in <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Sig.G.html#VALsucc_e">succ_e</a> [<a href="Sig.G.html">Sig.G</a>]</td> <td><div class="info"> <code class="code">succ_e g v</code> returns the edges going from <code class="code">v</code> in <code class="code">g</code>. </div> </td></tr> <tr><td align="left"><br>T</td></tr> <tr><td><a href="Oper.S.html#VALtransitive_closure">transitive_closure</a> [<a href="Oper.S.html">Oper.S</a>]</td> <td><div class="info"> <code class="code">transitive_closure ?reflexive g</code> returns the transitive closure of <code class="code">g</code> (as a new graph). </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALtransitive_closure">transitive_closure</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">transitive_closure ?reflexive g</code> returns the transitive closure of <code class="code">g</code> (as a new graph). </div> </td></tr> <tr><td><a href="Md.I.html#VALtriangulate">triangulate</a> [<a href="Md.I.html">Md.I</a>]</td> <td><div class="info"> <code class="code">triangulate g</code> return the graph <code class="code">g'</code> produced by applying miminum degree to <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Md.P.html#VALtriangulate">triangulate</a> [<a href="Md.P.html">Md.P</a>]</td> <td><div class="info"> <code class="code">triangulate g</code> return the graph <code class="code">g'</code> produced by applying miminum degree to <code class="code">g</code>. </div> </td></tr> <tr><td><a href="Mcs_m.MaximalCardinalitySearch.I.html#VALtriangulate">triangulate</a> [<a href="Mcs_m.MaximalCardinalitySearch.I.html">Mcs_m.MaximalCardinalitySearch.I</a>]</td> <td><div class="info"> <code class="code">triangulate g</code> triangulates <code class="code">g</code> using the MCS-M algorithm </div> </td></tr> <tr><td><a href="Mcs_m.MaximalCardinalitySearch.P.html#VALtriangulate">triangulate</a> [<a href="Mcs_m.MaximalCardinalitySearch.P.html">Mcs_m.MaximalCardinalitySearch.P</a>]</td> <td><div class="info"> <code class="code">triangulate g</code> computes a triangulation of <code class="code">g</code> using the MCS-M algorithm </div> </td></tr> <tr><td><a href="Delaunay.Triangulation.html#VALtriangulate">triangulate</a> [<a href="Delaunay.Triangulation.html">Delaunay.Triangulation</a>]</td> <td><div class="info"> <code class="code">triangulate a</code> computes the Delaunay triangulation of a set of points, given as an array <code class="code">a</code>. </div> </td></tr> <tr><td><a href="Strat.PLAYER.html#VALturn">turn</a> [<a href="Strat.PLAYER.html">Strat.PLAYER</a>]</td> <td></td></tr> <tr><td align="left"><br>U</td></tr> <tr><td><a href="Kruskal.UNIONFIND.html#VALunion">union</a> [<a href="Kruskal.UNIONFIND.html">Kruskal.UNIONFIND</a>]</td> <td></td></tr> <tr><td><a href="Oper.S.html#VALunion">union</a> [<a href="Oper.S.html">Oper.S</a>]</td> <td><div class="info"> <code class="code">union g1 g2</code> returns a new graph which is the union of <code class="code">g1</code> and <code class="code">g2</code>: each vertex and edge present in <code class="code">g1</code> *or* <code class="code">g2</code> is present in the resulting graph. </div> </td></tr> <tr><td><a href="Sig_pack.S.html#VALunion">union</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td> <td><div class="info"> <code class="code">union g1 g2</code> returns a new graph which is the union of <code class="code">g1</code> and <code class="code">g2</code>: each vertex and edge present in <code class="code">g1</code> *or* <code class="code">g2</code> is present in the resulting graph. </div> </td></tr> <tr><td align="left"><br>V</td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueV.html#VALvertex">vertex</a> [<a href="Cliquetree.CliqueTree.CliqueV.html">Cliquetree.CliqueTree.CliqueV</a>]</td> <td></td></tr> <tr><td><a href="Graphviz.GraphWithDotAttrs.html#VALvertex_attributes">vertex_attributes</a> [<a href="Graphviz.GraphWithDotAttrs.html">Graphviz.GraphWithDotAttrs</a>]</td> <td></td></tr> <tr><td><a href="Graphviz.GraphWithDotAttrs.html#VALvertex_name">vertex_name</a> [<a href="Graphviz.GraphWithDotAttrs.html">Graphviz.GraphWithDotAttrs</a>]</td> <td></td></tr> <tr><td><a href="Classic.S.html#VALvertex_only">vertex_only</a> [<a href="Classic.S.html">Classic.S</a>]</td> <td><div class="info"> <code class="code">vertex_only n</code> builds a graph with <code class="code">n</code> vertices and no edge. </div> </td></tr> <tr><td><a href="Sig_pack.S.Classic.html#VALvertex_only">vertex_only</a> [<a href="Sig_pack.S.Classic.html">Sig_pack.S.Classic</a>]</td> <td><div class="info"> <code class="code">vertex_only n</code> builds a graph with <code class="code">n</code> vertices and no edge. </div> </td></tr> <tr><td><a href="Cliquetree.CliqueTree.CliqueTreeE.html#VALvertices">vertices</a> [<a href="Cliquetree.CliqueTree.CliqueTreeE.html">Cliquetree.CliqueTree.CliqueTreeE</a>]</td> <td><div class="info"> Vertices in the clique tree edge (intersection of the two clique extremities). </div> </td></tr> <tr><td align="left"><br>W</td></tr> <tr><td><a href="Path.WEIGHT.html#VALweight">weight</a> [<a href="Path.WEIGHT.html">Path.WEIGHT</a>]</td> <td><div class="info"> Get the weight of an edge. </div> </td></tr> <tr><td align="left"><br>Z</td></tr> <tr><td><a href="Flow.FLOW.html#VALzero">zero</a> [<a href="Flow.FLOW.html">Flow.FLOW</a>]</td> <td></td></tr> <tr><td><a href="Path.WEIGHT.html#VALzero">zero</a> [<a href="Path.WEIGHT.html">Path.WEIGHT</a>]</td> <td><div class="info"> Neutral element for <a href="Path.WEIGHT.html#VALadd"><code class="code">Path.WEIGHT.add</code></a>. </div> </td></tr> </table><br> </body> </html>