data_structures
graph_vertices.c
Go to the documentation of this file.
1 /* ************************************************************************** */
3 /* */
4 /* ::: :::::::: */
5 /* graph_vertices.c :+: :+: :+: */
6 /* +:+ +:+ +:+ */
7 /* By: unite <marvin@42.fr> +#+ +:+ +#+ */
8 /* +#+#+#+#+#+ +#+ */
9 /* Created: 2020/07/22 08:55:31 by unite #+# #+# */
10 /* Updated: 2020/07/22 15:57:44 by unite ### ########.fr */
11 /* */
12 /* ************************************************************************** */
13 
14 #include "graph.h"
15 
17 {
18  return (rbt_keys(graph->adj));
19 }
rbt_keys
t_queue * rbt_keys(const t_rbt *rbt)
Returns a queue with all the keys in the tree, sorted in the ascending order.
Definition: rbt_keys.c:26
graph_vertices
t_queue * graph_vertices(const t_graph *graph)
Returns the queue with all the vertices in this graph.
Definition: graph_vertices.c:16
s_graph::adj
t_rbt * adj
The set of arrays, where each arrays represents the adjacency of a given vertex.
Definition: graph.h:43
s_graph
A graph implemented using a set of arrays.
Definition: graph.h:39
s_list
Doubly-linked list of generic items.
Definition: list.h:54
graph.h