1 /* 2 * graph.h - helpful graph structure and setup/teardown methods 3 * 4 * Copyright (c) 2007-2018 Pacman Development Team <pacman-dev@archlinux.org> 5 * 6 * This program is free software; you can redistribute it and/or modify 7 * it under the terms of the GNU General Public License as published by 8 * the Free Software Foundation; either version 2 of the License, or 9 * (at your option) any later version. 10 * 11 * This program is distributed in the hope that it will be useful, 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 * GNU General Public License for more details. 15 * 16 * You should have received a copy of the GNU General Public License 17 * along with this program. If not, see <http://www.gnu.org/licenses/>. 18 */ 19 #ifndef ALPM_GRAPH_H 20 #define ALPM_GRAPH_H 21 22 #include <sys/types.h> /* off_t */ 23 24 #include "alpm_list.h" 25 26 enum __alpm_graph_vertex_state { 27 ALPM_GRAPH_STATE_UNPROCESSED, 28 ALPM_GRAPH_STATE_PROCESSING, 29 ALPM_GRAPH_STATE_PROCESSED 30 }; 31 32 typedef struct __alpm_graph_t { 33 void *data; 34 struct __alpm_graph_t *parent; /* where did we come from? */ 35 alpm_list_t *children; 36 alpm_list_t *iterator; /* used for DFS without recursion */ 37 off_t weight; /* weight of the node */ 38 enum __alpm_graph_vertex_state state; 39 } alpm_graph_t; 40 41 alpm_graph_t *_alpm_graph_new(void); 42 void _alpm_graph_free(void *data); 43 44 #endif /* ALPM_GRAPH_H */ 45