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_iterator.h
Go to the documentation of this file.
1
15#ifndef BRANCHANDBOUND1TREE_LIST_ITERATOR_H
16#define BRANCHANDBOUND1TREE_LIST_ITERATOR_H
17#include "linked_list.h"
18
25
26
33
34
41
42
47void list_iterator_next(ListIterator *iterator);
48
49
56
57
63
64
65#endif //BRANCHANDBOUND1TREE_LIST_ITERATOR_H
void list_iterator_next(ListIterator *iterator)
Used to move the ListIterator to the next value of the object.
Definition: list_iterator.c:40
void * get_current_list_iterator_element(ListIterator *iterator)
Method used to get the current DllElem of an ListIterator.
Definition: list_iterator.c:30
void * list_iterator_get_next(ListIterator *iterator)
Method that retrieves the current DllElem of an ListIterator and moves the pointer to the next object...
Definition: list_iterator.c:56
bool is_list_iterator_valid(ListIterator *iterator)
Used to check if the ListIterator is valid.
Definition: list_iterator.c:35
ListIterator * create_list_iterator(List *list)
Used for the creation of a new ListIterator.
Definition: list_iterator.c:18
void delete_list_iterator(ListIterator *iterator)
Delete the ListIterator given.
Definition: list_iterator.c:51
The iterator for the List.
Definition: linked_list.h:43
The double linked list.
Definition: linked_list.h:35