int rbt_contains(const t_rbt *rbt, const void *key)
Does the tree contain the specified key?
size_t v
The number of vertices.
t_rbt * adj
The set of arrays, where each arrays represents the adjacency of a given vertex.
A graph implemented using a set of arrays.
const t_type * type
The type of vertices in the graph.
void array_delete(t_array *array)
Deletes this array and free all its items and the associated data.
void graph_add_vertex(t_graph *graph, const void *v)
Adds a vertex to the graph.
void rbt_put(t_rbt *rbt, const void *key, const void *val)
Adds a new item to the tree or overwrites an existing one.
t_array * array_new(const t_type *type)
Initializes a new empty array.