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
Public Attributes | List of all members
OrdTreeNode Struct Reference

A Heap-ordered Tree Node where the key of the parent is <= the key of its children. More...

#include <fibonacci_heap.h>

Public Attributes

unsigned short key
 The key of the Node.
 
double value
 The value of the Node.
 
struct OrdTreeNodeparent
 The parent of the Node.
 
struct OrdTreeNodeleft_sibling
 The left sibling of the Node.
 
struct OrdTreeNoderight_sibling
 The right sibling of the Node.
 
struct OrdTreeNodehead_child_list
 The head of the list of children of the Node.
 
struct OrdTreeNodetail_child_list
 The tail of the list of children of the Node.
 
unsigned short num_children
 The number of children of the Node.
 
bool marked
 True if the Node has lost a child, false otherwise.
 
bool is_root
 True if the Node is a root, false otherwise.
 

Detailed Description

A Heap-ordered Tree Node where the key of the parent is <= the key of its children.

Definition at line 26 of file fibonacci_heap.h.

Member Data Documentation

◆ head_child_list

struct OrdTreeNode* OrdTreeNode::head_child_list

The head of the list of children of the Node.

Definition at line 34 of file fibonacci_heap.h.

◆ is_root

bool OrdTreeNode::is_root

True if the Node is a root, false otherwise.

Definition at line 38 of file fibonacci_heap.h.

◆ key

unsigned short OrdTreeNode::key

The key of the Node.

Definition at line 27 of file fibonacci_heap.h.

◆ left_sibling

struct OrdTreeNode* OrdTreeNode::left_sibling

The left sibling of the Node.

Definition at line 31 of file fibonacci_heap.h.

◆ marked

bool OrdTreeNode::marked

True if the Node has lost a child, false otherwise.

Definition at line 37 of file fibonacci_heap.h.

◆ num_children

unsigned short OrdTreeNode::num_children

The number of children of the Node.

Definition at line 36 of file fibonacci_heap.h.

◆ parent

struct OrdTreeNode* OrdTreeNode::parent

The parent of the Node.

Definition at line 29 of file fibonacci_heap.h.

◆ right_sibling

struct OrdTreeNode* OrdTreeNode::right_sibling

The right sibling of the Node.

Definition at line 32 of file fibonacci_heap.h.

◆ tail_child_list

struct OrdTreeNode* OrdTreeNode::tail_child_list

The tail of the list of children of the Node.

Definition at line 35 of file fibonacci_heap.h.

◆ value

double OrdTreeNode::value

The value of the Node.

Definition at line 28 of file fibonacci_heap.h.