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

Structure of an Edge. More...

#include <graph.h>

Public Attributes

unsigned short src
 ID of the source vertex.
 
unsigned short dest
 ID of the destination vertex.
 
unsigned short symbol
 Symbol of the Edge, i.e. its unique ID.
 
double weight
 Weight of the Edge, 1 if the data_structures is not weighted.
 
double prob
 Probability of the Edge to be in an optimal tour.
 
unsigned short positionInGraph
 Position of the Edge in the list of Edges of the Graph.
 

Detailed Description

Structure of an Edge.

Definition at line 40 of file graph.h.

Member Data Documentation

◆ dest

unsigned short Edge::dest

ID of the destination vertex.

Definition at line 42 of file graph.h.

◆ positionInGraph

unsigned short Edge::positionInGraph

Position of the Edge in the list of Edges of the Graph.

Definition at line 46 of file graph.h.

◆ prob

double Edge::prob

Probability of the Edge to be in an optimal tour.

Definition at line 45 of file graph.h.

◆ src

unsigned short Edge::src

ID of the source vertex.

Definition at line 41 of file graph.h.

◆ symbol

unsigned short Edge::symbol

Symbol of the Edge, i.e. its unique ID.

Definition at line 43 of file graph.h.

◆ weight

double Edge::weight

Weight of the Edge, 1 if the data_structures is not weighted.

Definition at line 44 of file graph.h.