Graph Convolutional Branch and Bound v1.0.0
A TSP solver that combines a graph convolutional network with a 1-Tree branch-and-bound.
Loading...
Searching...
No Matches
list_functions.h
Go to the documentation of this file.
1
14#ifndef BRANCHANDBOUND1TREE_LIST_FUNCTIONS_H
15#define BRANCHANDBOUND1TREE_LIST_FUNCTIONS_H
16
17#include "linked_list.h"
18
19
24List *new_list(void);
25
26
32void del_list(List *list);
33
34
40bool is_list_empty(List *list);
41
42
48size_t get_list_size(List *list);
49
50
56void add_elem_list_bottom(List *list, void *element);
57
58
65void add_elem_list_index(List *array, void *element, size_t index);
66
67
73
74
80void delete_list_elem_index(List *list, size_t index);
81
82
89void *get_list_elem_index(List *list, size_t index);
90
91
92#endif //BRANCHANDBOUND1TREE_LIST_FUNCTIONS_H
void delete_list_elem_index(List *list, size_t index)
Deletes the DllElem at the indicated index of the List.
void delete_list_elem_bottom(List *list)
Deletes the DllElem at the bottom of the List.
void add_elem_list_index(List *array, void *element, size_t index)
Adds an DllElem at the index indicated of the List.
size_t get_list_size(List *list)
Gets the size of the List.
bool is_list_empty(List *list)
Check if the List is empty.
void add_elem_list_bottom(List *list, void *element)
Adds an DllElem to the bottom of the List.
void del_list(List *list)
Delete an instance of a List.
List * new_list(void)
Create a new instance of a List.
void * get_list_elem_index(List *list, size_t index)
Retrieves a pointer to an DllElem from the List.
The double linked list.
Definition: linked_list.h:35