int rbt_contains(const t_rbt *rbt, const void *key)
Does the tree contain the specified key?
void * array_get(const t_array *array, size_t index)
Returns the item at the specified position in this list.
size_t array_size(const t_array *array)
Returns the number of elements in this array.
int(* cmp)(const void *, const void *)
(optional) A function ponter used to compare members of this data type
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.
int graph_adjacent(const t_graph *graph, const void *v1, const void *v2)
Are two vertices in the graph adjacent to each other?
void * rbt_get(const t_rbt *rbt, const void *key)
Returns the value associated with a specified key.
void ds_exit_set(int err)
Set errno to the specified value, print the error message, and exit the process.