A | |
add [PSQueue] | |
add [IntSet] | add x s returns a set containing all elements of s , plus
x .
|
add [IntMap] | add m i x returns a map containing the same bindings as m ,
plus a binding of i to x .
|
add_vertex [Graph] | add_vertex g i returns g with a new degree-0 vertex i .
|
all_covered [ECC] | |
B | |
branching_edge [ECC] | |
C | |
choose [IntSet] |
Return one element of the given set, or raise
Not_found if the set
is empty.
|
choose_edge [Graph] | |
clear_subgraph [Graph] | |
complement [Graph] | |
complete_subgraph [Graph] | |
connect [Graph] | connect g v w returns g with vertices v and w
connected.
|
contains [IntSet] | contains s i returns true if i is element of s (O(log n)).
|
cover [ECC] | |
D | |
deg [Graph] | deg g i returns the number of neighbors of i in g .
|
delete_vertex [Graph] | delete_vertex g i returns g with vertex i deleted.
|
disconnect [Graph] | disconnect g v w returns g with vertices v and w
disconnected.
|
do_intersect [IntSet] |
True if the two sets have a nonempty intersection.
|
dump [IntSet] | |
dump [IntMap] | |
dump [Graph] | dump g is the same as output stderr g .
|
dump_list [Util] | |
E | |
ecc_heuristic [KSW] | |
empty [PSQueue] | |
empty [IntSet] |
The empty set.
|
empty [IntMap] |
The empty map.
|
empty [Graph] |
Returns the empty graph.
|
equal [IntSet] | equal s1 s2 is true when s1 and s2 contain the same elements.
|
F | |
find [IntSet] | find p s returns i when p returns true for some element of
s , or raises Not_found if p returns false for all elements
of s .
|
find [IntMap] | find p m returns (i, x) when p returns true for some
binding (i, x) in m , or raises Not_found if p returns
false for all elements of m .
|
find_opt [IntSet] | find_opt p s returns Some i when p returns Some i for some
element of s , or None if p returns None for all elements of
s .
|
fold [PSQueue] | |
fold [IntSet] | |
fold [IntMap] | fold f m a computes (f iN xN ... (f i1 x1 a)...) , where i1
... In are the keys of all bindings in m (in increasing
order), and x1 ... xN are the associated data.
|
fold_edges [Graph] | |
fold_intersection [IntSet] | |
fold_n [Util] | |
fold_neighbors [Graph] | |
fold_subgraph_edges [Graph] | |
fold_vertices [Graph] | |
for_all [IntSet] | |
for_all [IntMap] | for_all p m checks whether all bindings of m satisfy the
predicate p .
|
G | |
g [ECC] | |
get [PSQueue] | |
get [IntMap] | get m i returns the current binding of i in m , or raises
Not_found if no such binding exists.
|
get_default [IntMap] | get_default m i x returns the current binding of i in m , or
x if no such binding exists.
|
H | |
has_key [IntMap] | has_key m i returns true if there is a mapping (i, x) in m
(O(log n)).
|
has_vertex [Graph] | has_vertex g i is true if vertex i is present in graph
g .
|
I | |
int64_incr [Util] | |
intersection [IntSet] |
Set intersection.
|
intersection_size [IntSet] |
Number of elements in the intersection.
|
is_clique [Graph] | |
is_clique_cover [ECC] | |
is_connected [Graph] | is_connected g i j returns true if there is an edge between
i and j in g .
|
is_deg0 [Graph] | is_deg0 g i returns true if i has no neighbors in g .
|
is_empty [PSQueue] | |
is_empty [IntSet] |
Test whether the set is empty (O(1)).
|
is_empty [IntMap] | |
is_subset [IntSet] | subset s1 s2 tests whether the set s1 is a subset of the set s2 .
|
iter [IntSet] | |
iter [IntMap] | |
iter_edges [Graph] | iter_edges f g calls f u v for each edge (u, v) in g .
|
K | |
k [ECC] | |
k_used_up [ECC] | |
L | |
list_find_opt [Util] | |
M | |
make [ECC] | |
make1 [ECC] | |
make_clique [Graph] | |
map [IntMap] | map f m returns a map with same domain as m , where the
associated value x of all bindings of m has been replaced by the
result of the application of f to a .
|
max_key [IntMap] | |
minus [IntSet] |
Set difference.
|
N | |
neighbors [Graph] | neighbors g i returns the set of neighbors of i in
g .
|
new_vertex [Graph] | new_vertex g returns the smallest positive i such that i is not a vertex
in g .
|
num_edges [Graph] |
Returns the number of edges in the graph.
|
num_edges_in_subgraph [Graph] | |
num_vertices [Graph] |
Returns the number of vertices in the graph.
|
O | |
of_graph6 [Graph] | |
of_list [IntSet] |
Returns a set containing all elements of the list.
|
output [IntSet] | |
output [IntMap] | |
output [Graph] | output c g prints a debug representation of g to channel c .
|
output_int [Util] | |
output_list [Util] | |
P | |
partition [IntSet] | partition p s returns a pair of sets (s1, s2) , where s1 is
the set of all the elements of s that satisfy the predicate p ,
and s2 is the set of all the elements of s that do not satisfy
p .
|
pop [PSQueue] | |
pop [IntSet] | |
print [IntSet] | |
print [IntMap] | |
print [Graph] | print g is the same as output stdout g .
|
print_list [Util] | |
R | |
reduce [ECC] | |
reduce_rule1 [ECC] | |
reduce_rule2 [ECC] | |
reduce_rule3 [ECC] | |
reduce_rule4 [ECC] | |
remove [PSQueue] | |
remove [IntSet] | remove x s returns a set containing all elements of s except
x .
|
remove [IntMap] | remove m i returns a map containing the same bindings as m ,
except for i which is unbound in the returned map.
|
restore [ECC] | |
rule1_counter [ECC] | |
rule2_counter [ECC] | |
rule3_counter [ECC] | |
rule4_counter [ECC] | |
S | |
set_max_k [ECC] | |
singleton [IntSet] |
Returns a one-element set.
|
size [IntSet] |
Returns the number of elements of a set (O(1)).
|
size [IntMap] |
Returns the number of elements of a set (O(1)).
|
split [IntSet] | split x s returns a triple (l, present, r) , where
l is the set of elements of s that are strictly less than x ;
r is the set of elements of s that are strictly greater than x ;
present is false if s contains no element equal to x , or
true if s contains an element equal to x .
|
subgraph [Graph] | |
sweep [Sweep] | |
T | |
timer [Util] | |
top [PSQueue] | |
U | |
union [IntSet] |
Set union.
|
update [IntMap] | |
use_rule1 [ECC] | |
use_rule2 [ECC] | |
use_rule3 [ECC] | |
use_rule4 [ECC] | |
V | |
verbose [Util] | |
vertices [Graph] |
Returns the set of vertices.
|