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
linked_list.h
Go to the documentation of this file.
1
15#pragma once
16#include <stdlib.h>
17#include <stdio.h>
18#include <stddef.h>
19#include <string.h>
20#include <assert.h>
21#include <stdbool.h>
22#ifndef BRANCHANDBOUND1TREE_LINKED_LIST_H
23#define BRANCHANDBOUND1TREE_LINKED_LIST_H
24
25
27typedef struct DllElem {
28 void *value;
29 struct DllElem *next;
30 struct DllElem *prev;
32
33
35typedef struct {
38 size_t size;
39} List;
40
41
43typedef struct {
46 size_t index;
48
49
50#endif //BRANCHANDBOUND1TREE_LINKED_LIST_H
The double linked List element.
Definition: linked_list.h:27
void * value
The value of the element, void pointer to be able to store any type of data.
Definition: linked_list.h:28
struct DllElem * prev
The previous element in the List.
Definition: linked_list.h:30
struct DllElem * next
The next element in the List.
Definition: linked_list.h:29
The iterator for the List.
Definition: linked_list.h:43
DllElem * curr
The current DllElem (element) of the List.
Definition: linked_list.h:45
List * list
The List to iterate.
Definition: linked_list.h:44
size_t index
The current index of the element in the List.
Definition: linked_list.h:46
The double linked list.
Definition: linked_list.h:35
size_t size
The current size of the List.
Definition: linked_list.h:38
DllElem * head
The head of the list as a DllElem.
Definition: linked_list.h:36
DllElem * tail
The tail of the list as a DllElem.
Definition: linked_list.h:37