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
Node Struct Reference

Structure of a Node. More...

#include <graph.h>

Public Attributes

double x
 x coordinate of the Node.
 
double y
 y coordinate of the Node.
 
unsigned short positionInGraph
 Position of the Node in the list of Nodes of the Graph, i.e. its unique ID.
 
unsigned short num_neighbours
 Number of neighbours of the Node.
 
unsigned short neighbours [MAX_VERTEX_NUM - 1]
 Array of IDs of the Node's neighbors.
 

Detailed Description

Structure of a Node.

Definition at line 30 of file graph.h.

Member Data Documentation

◆ neighbours

unsigned short Node::neighbours[MAX_VERTEX_NUM - 1]

Array of IDs of the Node's neighbors.

Definition at line 35 of file graph.h.

◆ num_neighbours

unsigned short Node::num_neighbours

Number of neighbours of the Node.

Definition at line 34 of file graph.h.

◆ positionInGraph

unsigned short Node::positionInGraph

Position of the Node in the list of Nodes of the Graph, i.e. its unique ID.

Definition at line 33 of file graph.h.

◆ x

double Node::x

x coordinate of the Node.

Definition at line 31 of file graph.h.

◆ y

double Node::y

y coordinate of the Node.

Definition at line 32 of file graph.h.