A | |
add [Strat.STRAT] | |
add [Flow.FLOW] | |
add [Sig.WEIGHT] | Addition of weights. |
add_edge [Dominator.I] | |
add_edge [Builder.S] | |
add_edge [Sig_pack.S] |
|
add_edge [Sig.I] |
|
add_edge [Sig.P] |
|
add_edge_e [Contraction.G] | |
add_edge_e [Gmap.E_DST] | |
add_edge_e [Builder.S] | |
add_edge_e [Sig_pack.S] |
|
add_edge_e [Sig.I] |
|
add_edge_e [Sig.P] |
|
add_transitive_closure [Oper.S] |
|
add_transitive_closure [Sig_pack.S] |
|
add_vertex [Gmap.V_DST] | |
add_vertex [Builder.S] | |
add_vertex [Sig_pack.S] |
|
add_vertex [Sig.I] |
|
add_vertex [Sig.P] |
|
all_pairs_shortest_paths [Path.Johnson] |
|
all_shortest_paths [Path.BellmanFord] |
|
allminsep [Minsep.MINSEP] |
|
analyze [ChaoticIteration.Data] | How to analyze one edge: given an edge and the data stored at its origin, it must compute the resulting data to be stored at its destination. |
analyze [Fixpoint.Analysis] | the actual analysis of one edge; provided the edge and the incoming data, it needs to compute the outgoing data |
analyze [Fixpoint.Make] |
|
B | |
bellman_ford [Sig_pack.S] |
|
C | |
ccw [Delaunay.CCC] | The counterclockwise relation |
check_path [Path.Check] |
|
check_path [Sig_pack.S.PathCheck] | |
choose_edge [Oper.Choose] |
|
choose_vertex [Oper.Choose] |
|
clear [Traverse.GM.Mark] | |
clear [Sig_pack.S.Mark] |
|
clear [Sig_pack.S] | Remove all vertices and edges from the given graph. |
clear [Sig.MARK] |
|
clear [Sig.I] | Remove all vertices and edges from the given graph. |
coherent_player [Strat.Algo] |
|
coherent_strat [Strat.Algo] |
|
color_to_color_with_transparency [Graphviz] | |
coloring [Coloring.Mark] |
|
coloring [Coloring.Make] |
|
compare [Cliquetree.CliqueTree.CliqueTreeE] | |
compare [Cliquetree.CliqueTree.CliqueTreeV] | |
compare [Cliquetree.CliqueTree.CliqueV] | |
compare [Prim.G.E] | |
compare [Flow.FLOW] | |
compare [Util.DataV] | |
compare [Sig_pack.S.E] | |
compare [Sig_pack.S.V] | |
compare [Sig.WEIGHT] | Weights must be ordered. |
compare [Sig.EDGE] | |
compare [Sig.COMPARABLE] | |
compare [Sig.ORDERED_TYPE] | |
complement [Oper.S] |
|
complement [Sig_pack.S] |
|
components [Components.Undirected] | |
components_array [Components.Undirected] | |
components_list [Components.Undirected] | |
compute_all [Dominator.Make_graph] | Computes all dominance functions. |
compute_dom_frontier [Dominator.S] | Computes the dominance frontier. |
compute_dom_graph [Dominator.Make_graph] | |
compute_idom [Dominator.S] | Computes the dominator tree, using the Lengauer-Tarjan algorithm. |
contract [Contraction.Make] |
|
copy [Builder.S] | |
copy [Sig_pack.S] |
|
copy [Sig.I] |
|
create [Cliquetree.CliqueTree.CliqueTreeE] | |
create [Cliquetree.CliqueTree.CliqueTreeV] | |
create [Cliquetree.CliqueTree.CliqueV] | |
create [Dominator.I] | |
create [Path.G.E] | |
create [Path.Check] |
|
create [Util.DataV] | |
create [Sig_pack.S.PathCheck] | |
create [Sig_pack.S.E] |
|
create [Sig_pack.S.V] | |
create [Sig_pack.S] | Return an empty graph. |
create [Sig.I] |
|
create [Sig.EDGE] |
|
create [Sig.VERTEX] | |
D | |
data [Cliquetree.CliqueTree.CliqueTreeV] | |
data [Util.DataV] | |
de_bruijn [Classic.S] |
|
de_bruijn [Sig_pack.S.Classic] |
|
default [Cliquetree.CliqueTree.CliqueTreeE] | |
default [Sig.ORDERED_TYPE_DFT] | |
default_edge_attributes [Graphviz.GraphWithDotAttrs] | Edge attributes |
default_vertex_attributes [Graphviz.GraphWithDotAttrs] | Vertex attributes |
dfs [Traverse.Mark] |
|
dfs [Sig_pack.S.Marking] | |
direction [Fixpoint.Analysis] | the direction of the analysis |
display_with_gv [Sig_pack.S] | Displays the given graph using the external tools "dot" and "gv" and returns when gv's window is closed |
divisors [Classic.S] |
|
divisors [Sig_pack.S.Classic] |
|
dom_to_sdom [Dominator.S] | |
dominators_to_dom [Dominator.S] | Given a function from a node to it's dominators, returns a function
|
dominators_to_dom_tree [Dominator.S] | Computes a dominator tree (function from x to a list of nodes immediately dominated by x) for the given CFG and dominator function. |
dominators_to_idoms [Dominator.S] | Given a function from a node to it's dominators, returns a function
|
dominators_to_sdom [Dominator.S] | Given a function from a node to it's dominators, returns a function
|
dominators_to_sdominators [Dominator.S] | Given a a function from a node to it's dominators, returns a function from a node to it's strict dominators. |
dot_output [Sig_pack.S] | DOT output in a file |
dst [Graphml.G.E] | |
dst [Fixpoint.G.E] | |
dst [Gml.G.E] | |
dst [Prim.G.E] | |
dst [Flow.G_FORD_FULKERSON.E] | |
dst [Kruskal.G.E] | |
dst [Path.G.E] | |
dst [Sig_pack.S.E] | |
dst [Sig.EDGE] | Edge destination. |
E | |
edge_attributes [Graphviz.GraphWithDotAttrs] | |
empty [Contraction.G] | |
empty [Strat.STRAT] | |
empty [Gmap.E_DST] | |
empty [Gmap.V_DST] | |
empty [Builder.S] | |
empty [Sig.P] | The empty graph. |
equal [ChaoticIteration.Data] | Equality test for data. |
equal [Fixpoint.Analysis] | predicate to determine the fixpoint |
equal [Cliquetree.CliqueTree.CliqueTreeV] | |
equal [Cliquetree.CliqueTree.CliqueV] | |
equal [Gml.G.V] | |
equal [Util.DataV] | |
equal [Sig_pack.S.V] | |
equal [Sig.COMPARABLE] | |
equal [Sig.HASHABLE] | |
F | |
filter_map [Gmap.Edge] |
|
filter_map [Gmap.Vertex] |
|
find [Kruskal.UNIONFIND] | |
find_all_edges [Sig_pack.S] | |
find_all_edges [Sig.G] |
|
find_edge [Sig_pack.S] | |
find_edge [Sig.G] |
|
find_negative_cycle [Path.BellmanFord] |
|
find_negative_cycle_from [Path.BellmanFord] |
|
find_vertex [Sig_pack.S] |
|
flow [Flow.FLOW] | |
fold [Topological.Make_stable] | |
fold [Topological.Make] |
|
fold [Traverse.Bfs] | |
fold [Traverse.Dfs] | The function is applied each time a node is reached for the first time, before idoterating over its successors. |
fold [Delaunay.Triangulation] | |
fold [Sig_pack.S.Topological] | |
fold [Sig_pack.S.Dfs] | |
fold_component [Traverse.Bfs] | |
fold_component [Traverse.Dfs] | Idem, but limited to a single root vertex. |
fold_component [Sig_pack.S.Dfs] | |
fold_edges [Sig_pack.S] | |
fold_edges [Sig.G] | Fold on all edges of a graph. |
fold_edges_e [Contraction.G] | |
fold_edges_e [Gmap.E_SRC] | |
fold_edges_e [Flow.G_GOLDBERG_TARJAN] | |
fold_edges_e [Path.G] | |
fold_edges_e [Sig_pack.S] | |
fold_edges_e [Sig.G] | Fold on all edges of a graph. |
fold_left [WeakTopological] | Folding over the elements of a weak topological ordering. |
fold_pred [Sig_pack.S] | |
fold_pred [Sig.G] | |
fold_pred_e [ChaoticIteration.G] | |
fold_pred_e [Flow.G_GOLDBERG_TARJAN] | |
fold_pred_e [Sig_pack.S] | |
fold_pred_e [Sig.G] | |
fold_stable [Sig_pack.S.Topological] | |
fold_succ [Strat.G] | |
fold_succ [Minsep.G] | |
fold_succ [Coloring.GM] | |
fold_succ [Coloring.G] | |
fold_succ [Traverse.G] | |
fold_succ [Sig_pack.S] | |
fold_succ [Sig.G] | |
fold_succ_e [Flow.G_GOLDBERG_TARJAN] | |
fold_succ_e [Sig_pack.S] | |
fold_succ_e [Sig.G] | |
fold_vertex [Clique.G] | |
fold_vertex [Contraction.G] | |
fold_vertex [Leaderlist.G] | |
fold_vertex [Fixpoint.G] | |
fold_vertex [Strat.G] | |
fold_vertex [Minsep.G] | |
fold_vertex [Gmap.V_SRC] | |
fold_vertex [Dominator.G] | |
fold_vertex [Kruskal.G] | |
fold_vertex [Coloring.GM] | |
fold_vertex [Coloring.G] | |
fold_vertex [Traverse.G] | It is enough to fold over all the roots (vertices without predecessor) of the graph, even if folding over the other vertices is correct. |
fold_vertex [Path.G] | |
fold_vertex [Sig_pack.S] | |
fold_vertex [Sig.G] | Fold on all vertices of a graph. |
ford_fulkerson [Sig_pack.S] | Ford Fulkerson maximum flow algorithm |
fprint_graph [Graphviz.Neato] |
|
fprint_graph [Graphviz.Dot] |
|
full [Classic.S] |
|
full [Sig_pack.S.Classic] |
|
G | |
game [Strat.Algo] |
|
get [Coloring.GM.Mark] | |
get [Traverse.GM.Mark] | |
get [Traverse.Bfs] | |
get [Traverse.Dfs] | |
get [Sig_pack.S.Mark] | |
get [Sig.MARK] | Mark value (in O(1)). |
get_initial [Strat.PLAYER] | |
get_subgraph [Graphviz.GraphWithDotAttrs] | The box (if exists) which the vertex belongs to. |
gnp [Rand.S] | random graph using the G(n,p) model. |
gnp [Sig_pack.S.Rand] |
|
gnp_labeled [Rand.S] |
|
gnp_labeled [Sig_pack.S.Rand] |
|
goldberg_tarjan [Sig_pack.S] | Goldberg-Tarjan maximum flow algorithm |
graph [Rand.Planar.S] |
|
graph [Rand.S] |
|
graph [Sig_pack.S.Rand] |
|
graph_attributes [Graphviz.GraphWithDotAttrs] | Graph, vertex and edge attributes. |
H | |
handle_error [Graphviz.Neato] | |
has_cycle [Traverse.Mark] |
|
has_cycle [Traverse.Dfs] |
|
has_cycle [Sig_pack.S.Marking] | |
has_cycle [Sig_pack.S.Dfs] | |
hash [Cliquetree.CliqueTree.CliqueTreeV] | |
hash [Cliquetree.CliqueTree.CliqueV] | |
hash [Gml.G.V] | |
hash [Util.DataV] | |
hash [Sig_pack.S.V] | |
hash [Sig.COMPARABLE] | |
hash [Sig.HASHABLE] | |
I | |
idom_to_dom [Dominator.S] | |
idom_to_dom_tree [Dominator.S] | Computes a dominator tree (function from x to a list of nodes immediately dominated by x) for the given CFG and idom function. |
idom_to_dominators [Dominator.S] | |
idom_to_idoms [Dominator.S] | |
in_circle [Delaunay.CCC] | The relation |
in_degree [Sig_pack.S] |
|
in_degree [Sig.G] |
|
init [Kruskal.UNIONFIND] | |
intersect [Oper.S] |
|
intersect [Sig_pack.S] |
|
is_chordal [Cliquetree.CliqueTree] |
|
is_directed [Graphml.G] | |
is_directed [Coloring.GM] | |
is_directed [Coloring.G] | |
is_directed [Traverse.G] | |
is_directed [Sig_pack.S] | is this an implementation of directed graphs? |
is_directed [Sig.G] | Is this an implementation of directed graphs? |
is_empty [Sig_pack.S] | |
is_empty [Sig.G] | |
is_final [Strat.PLAYER] | |
iter [Topological.Make_stable] | |
iter [Topological.Make] |
|
iter [Traverse.Bfs] | |
iter [Traverse.Dfs] |
|
iter [Delaunay.Triangulation] |
|
iter [Sig_pack.S.Topological] | |
iter [Sig_pack.S.Bfs] | |
iter [Sig_pack.S.Dfs] |
|
iter_component [Traverse.Bfs] | |
iter_component [Traverse.Dfs] | |
iter_component [Sig_pack.S.Bfs] | |
iter_component [Sig_pack.S.Dfs] | |
iter_edges [Components.U] | |
iter_edges [Sig_pack.S] | |
iter_edges [Sig.G] | Iter on all edges of a graph. |
iter_edges_e [Graphml.G] | |
iter_edges_e [Gml.G] | |
iter_edges_e [Prim.G] | |
iter_edges_e [Kruskal.G] | |
iter_edges_e [Sig_pack.S] | |
iter_edges_e [Sig.G] | Iter on all edges of a graph. |
iter_pred [Sig_pack.S] | |
iter_pred [Sig.G] | |
iter_pred_e [Flow.G_FORD_FULKERSON] | |
iter_pred_e [Sig_pack.S] | |
iter_pred_e [Sig.G] | |
iter_stable [Sig_pack.S.Topological] | |
iter_succ [WeakTopological.G] | |
iter_succ [Minsep.G] | |
iter_succ [Dominator.G] | |
iter_succ [Topological.G] | |
iter_succ [Coloring.GM] | |
iter_succ [Coloring.G] | |
iter_succ [Traverse.GM] | |
iter_succ [Traverse.G] | |
iter_succ [Path.G] | |
iter_succ [Components.G] | |
iter_succ [Sig_pack.S] | |
iter_succ [Sig.G] | |
iter_succ_e [Prim.G] | |
iter_succ_e [Flow.G_FORD_FULKERSON] | |
iter_succ_e [Path.G] | |
iter_succ_e [Sig_pack.S] | |
iter_succ_e [Sig.G] | |
iter_triangles [Delaunay.Triangulation] | |
iter_vertex [WeakTopological.G] | |
iter_vertex [Graphml.G] | |
iter_vertex [Minsep.G] | |
iter_vertex [Gml.G] | |
iter_vertex [Dominator.G] | |
iter_vertex [Prim.G] | |
iter_vertex [Topological.G] | |
iter_vertex [Coloring.GM] | |
iter_vertex [Coloring.G] | |
iter_vertex [Traverse.GM] | |
iter_vertex [Traverse.G] | It is enough to iter over all the roots (vertices without predecessor) of the graph, even if iterating over the other vertices is correct. |
iter_vertex [Path.G] | |
iter_vertex [Components.U] | |
iter_vertex [Components.G] | |
iter_vertex [Sig_pack.S] | |
iter_vertex [Sig.G] | Iter on all vertices of a graph. |
J | |
join [ChaoticIteration.Data] | Operation to join data when several paths meet. |
join [Fixpoint.Analysis] | operation how to join data when paths meet |
L | |
label [Cliquetree.CliqueTree.CliqueTreeV] | |
label [Cliquetree.CliqueTree.CliqueV] | |
label [Gml.G.E] | |
label [Gml.G.V] | |
label [Prim.G.E] | |
label [Flow.G_FORD_FULKERSON.E] | |
label [Kruskal.G.E] | |
label [Path.G.E] | |
label [Util.DataV] | |
label [Sig_pack.S.E] | |
label [Sig_pack.S.V] | |
label [Sig.EDGE] | Get the label of an edge. |
label [Sig.VERTEX] | |
labeled [Rand.S] |
|
labeled [Sig_pack.S.Rand] |
|
leader_lists [Leaderlist.Make] |
|
list_from_vertex [Oper.Neighbourhood] | Neighbourhood of a vertex as a list. |
list_from_vertices [Oper.Neighbourhood] | Neighbourhood of a list of vertices as a list. |
list_of_allminsep [Minsep.MINSEP] | Less efficient that |
M | |
make [Imperative.Matrix.S] | Creation. |
map [Gmap.Edge] |
|
map [Gmap.Vertex] |
|
map_vertex [Sig_pack.S] | map iterator on vertex |
map_vertex [Sig.G] | Map on all vertices of a graph. |
max_capacity [Flow.FLOW] | |
maxflow [Flow.Ford_Fulkerson] |
|
maxflow [Flow.Goldberg_Tarjan] |
|
maximalcliques [Clique.Bron_Kerbosch] |
|
maxwidth [Cliquetree.CliqueTree] |
|
mcs_clique [Cliquetree.CliqueTree] |
|
mcsm [Mcs_m.MaximalCardinalitySearch.I] |
|
mcsm [Mcs_m.MaximalCardinalitySearch.P] |
|
md [Md.I] |
|
md [Md.P] |
|
mem_edge [Sig_pack.S] | |
mem_edge [Sig.G] | |
mem_edge_e [Sig_pack.S] | |
mem_edge_e [Sig.G] | |
mem_vertex [Strat.G] | |
mem_vertex [Sig_pack.S] | |
mem_vertex [Sig.G] | |
merge_edges_e [Merge.I] | |
merge_edges_e [Merge.S] | If no element of |
merge_edges_with_label [Merge.I] | |
merge_edges_with_label [Merge.S] | The graph |
merge_ends [Merge.I] | |
merge_ends [Merge.S] | A vertex |
merge_isolabelled_edges [Merge.I] | |
merge_isolabelled_edges [Merge.S] | The graph |
merge_scc [Merge.I] | |
merge_scc [Merge.S] | The vertex of every strongly connected component are identified. |
merge_starts [Merge.I] | |
merge_starts [Merge.S] | A vertex |
merge_vertex [Merge.I] | |
merge_vertex [Merge.S] | If no element of |
min_capacity [Flow.FLOWMIN] | |
min_cutset [Mincut.Make] | Find a minimal cutset. |
mirror [Oper.S] |
|
mirror [Sig_pack.S] |
|
N | |
nb_edges [Flow.G_GOLDBERG_TARJAN] | |
nb_edges [Sig_pack.S] | |
nb_edges [Sig.G] | |
nb_vertex [Dominator.G] | |
nb_vertex [Flow.G_GOLDBERG_TARJAN] | |
nb_vertex [Coloring.GM] | |
nb_vertex [Coloring.G] | |
nb_vertex [Path.G] | |
nb_vertex [Sig_pack.S] | |
nb_vertex [Sig.G] | |
next [Strat.STRAT] | |
O | |
out_degree [Coloring.GM] | |
out_degree [Coloring.G] | |
out_degree [Sig_pack.S] |
|
out_degree [Sig.G] |
|
output_graph [Graphviz.Neato] |
|
output_graph [Graphviz.Dot] |
|
P | |
parse [Dot.Parse] | Parses a dot file |
parse [Gml.Parse] | |
parse_bounding_box_and_clusters [Dot.Parse] | Parses a dot file and returns the graph, its bounding box and a hash table from clusters to dot attributes |
parse_dot_ast [Dot] | |
parse_dot_file [Sig_pack.S] | |
parse_gml_file [Sig_pack.S] | |
postfix [Traverse.Dfs] | applies only a postfix function. |
postfix [Sig_pack.S.Dfs] | applies only a postfix function |
postfix_component [Traverse.Dfs] | |
postfix_component [Sig_pack.S.Dfs] | |
pred [Leaderlist.G] | |
pred [Fixpoint.G] | |
pred [Dominator.G] | |
pred [Sig_pack.S] |
|
pred [Sig.G] |
|
pred_e [Fixpoint.G] | |
pred_e [Sig_pack.S] |
|
pred_e [Sig.G] |
|
prefix [Traverse.Dfs] | applies only a prefix function; note that this function is more
efficient than |
prefix [Sig_pack.S.Dfs] | applies only a prefix function |
prefix_component [Traverse.Dfs] | |
prefix_component [Sig_pack.S.Dfs] | |
print [Graphml.Print] |
|
print [Gml.Print] | |
print_gml [Sig_pack.S] | |
print_gml_file [Sig_pack.S] | |
R | |
random_few_edges [Rand.S] | |
random_many_edges [Rand.S] | |
recurse [ChaoticIteration.Make] |
|
recursive_scc [WeakTopological.Make] |
|
remove_edge [Builder.S] | |
remove_edge [Sig_pack.S] |
|
remove_edge [Sig.I] |
|
remove_edge [Sig.P] |
|
remove_edge_e [Builder.S] | |
remove_edge_e [Sig_pack.S] |
|
remove_edge_e [Sig.I] |
|
remove_edge_e [Sig.P] |
|
remove_vertex [Builder.S] | |
remove_vertex [Sig_pack.S] |
|
remove_vertex [Sig.I] |
|
remove_vertex [Sig.P] |
|
replace_by_transitive_reduction [Oper.S] |
|
replace_by_transitive_reduction [Sig_pack.S] |
|
S | |
scc [Components.Make] |
|
scc [Sig_pack.S.Components] | strongly connected components |
scc_array [Components.Make] |
|
scc_array [Sig_pack.S.Components] | |
scc_list [Components.Make] |
|
scc_list [Sig_pack.S.Components] | |
set [Coloring.GM.Mark] | |
set [Traverse.GM.Mark] | |
set [Sig_pack.S.Mark] | |
set [Sig.MARK] | Set the mark of the given vertex. |
set_command [Graphviz.Neato] | Several functions provided by this module run the external program neato. |
set_data [Util.DataV] | |
set_from_vertex [Oper.Neighbourhood] | Neighbourhood of a vertex as a set. |
set_from_vertices [Oper.Neighbourhood] | Neighbourhood of a list of vertices as a set. |
set_of_allminsep [Minsep.MINSEP] | Less efficient that |
shortest_path [Path.Dijkstra] |
|
shortest_path [Sig_pack.S] | Dijkstra's shortest path algorithm. |
spanningtree [Prim.Make] | |
spanningtree [Kruskal.Generic] | |
spanningtree [Kruskal.Make] | |
spanningtree [Sig_pack.S] | Kruskal algorithm |
spanningtree_from [Prim.Make] | |
src [ChaoticIteration.G.E] | |
src [Graphml.G.E] | |
src [Fixpoint.G.E] | |
src [Gml.G.E] | |
src [Prim.G.E] | |
src [Flow.G_FORD_FULKERSON.E] | |
src [Kruskal.G.E] | |
src [Path.G.E] | |
src [Sig_pack.S.E] | |
src [Sig.EDGE] | Edge origin. |
start [Traverse.Bfs] | |
start [Traverse.Dfs] | |
step [Traverse.Bfs] | |
step [Traverse.Dfs] | |
strategy [Strat.Algo] |
|
strategyA [Strat.Algo] |
|
sub [Flow.FLOW] | |
sub [Path.WJ] | Subtraction of weights. |
succ [Clique.G] | |
succ [Mincut.G] | |
succ [Leaderlist.G] | |
succ [Fixpoint.G] | |
succ [Strat.G] | |
succ [Minsep.G] | |
succ [Dominator.G] | |
succ [Sig_pack.S] |
|
succ [Sig.G] |
|
succ_e [Fixpoint.G] | |
succ_e [Sig_pack.S] |
|
succ_e [Sig.G] |
|
T | |
transitive_closure [Oper.S] |
|
transitive_closure [Sig_pack.S] |
|
transitive_reduction [Oper.S] |
|
transitive_reduction [Sig_pack.S] |
|
triangulate [Md.I] |
|
triangulate [Md.P] |
|
triangulate [Mcs_m.MaximalCardinalitySearch.I] |
|
triangulate [Mcs_m.MaximalCardinalitySearch.P] |
|
triangulate [Delaunay.Triangulation] |
|
turn [Strat.PLAYER] | |
U | |
union [Kruskal.UNIONFIND] | |
union [Oper.S] |
|
union [Sig_pack.S] |
|
V | |
vertex [Cliquetree.CliqueTree.CliqueV] | |
vertex_attributes [Graphviz.GraphWithDotAttrs] | |
vertex_name [Graphviz.GraphWithDotAttrs] | |
vertex_only [Classic.S] |
|
vertex_only [Sig_pack.S.Classic] |
|
vertices [Cliquetree.CliqueTree.CliqueTreeE] | Vertices in the clique tree edge (intersection of the two clique extremities). |
W | |
weight [Sig.WEIGHT] | Get the weight of an edge. |
widening [ChaoticIteration.Data] | The widening operator. |
Z | |
zero [Flow.FLOW] | |
zero [Sig.WEIGHT] | Neutral element for |