projects/GraphConvolutionalBranchandBound/graph_8h_source.html

#ifndef BRANCHANDBOUND_1TREE_GRAPH_H

#define BRANCHANDBOUND_1TREE_GRAPH_H

#include "./doubly_linked_list//linked_list.h"

#include "./doubly_linked_list/list_iterator.h"

#include "./doubly_linked_list/list_functions.h"

#include "../problem_settings.h"


typedef enum GraphKind{

    WEIGHTED_GRAPH,

    UNWEIGHTED_GRAPH

} GraphKind;


typedef struct Node {

    double x;

    double y;

    unsigned short positionInGraph;

    unsigned short num_neighbours;

    unsigned short neighbours [MAX_VERTEX_NUM - 1];

}Node;


typedef struct Edge {

    unsigned short src;

    unsigned short dest;

    unsigned short symbol;

    double weight;

    double prob;

    unsigned short positionInGraph;

}Edge;


typedef struct Graph {

    GraphKind kind;

    double cost;

    unsigned short num_nodes;

    unsigned short num_edges;

    bool orderedEdges;

    Node nodes [MAX_VERTEX_NUM];

    Edge edges [MAX_EDGES_NUM];

    Edge edges_matrix [MAX_VERTEX_NUM] [MAX_VERTEX_NUM];

}Graph;


void create_graph(Graph* graph, List *  nodes, List *  edges, GraphKind kind);


void create_euclidean_graph(Graph * graph, List * nodes);


void print_graph(const Graph * graph);


#endif //BRANCHANDBOUND_1TREE_GRAPH_H

create_graph
void create_graph(Graph *graph, List *nodes, List *edges, GraphKind kind)
Create a new instance of a Graph with all the needed parameters.
Definition: graph.c:18

print_graph
void print_graph(const Graph *graph)
Print Nodes, Edges and other information of the Graph.
Definition: graph.c:101

GraphKind
GraphKind
Enum to specify the kind of the Graph.
Definition: graph.h:23

WEIGHTED_GRAPH
@ WEIGHTED_GRAPH
The Graph is weighted.
Definition: graph.h:24

UNWEIGHTED_GRAPH
@ UNWEIGHTED_GRAPH
The Graph is unweighted.
Definition: graph.h:25

create_euclidean_graph
void create_euclidean_graph(Graph *graph, List *nodes)
Create a new instance of an euclidean graphs only the Nodes are necessary.
Definition: graph.c:71

linked_list.h

list_functions.h
The declaration of the functions to manipulate the List.

list_iterator.h
The declaration of the functions to manipulate the ListIterator.

MAX_EDGES_NUM
#define MAX_EDGES_NUM
The maximum number of edges in the Graph.
Definition: problem_settings.h:49

Edge
Structure of an Edge.
Definition: graph.h:40

Edge::dest
unsigned short dest
ID of the destination vertex.
Definition: graph.h:42

Edge::src
unsigned short src
ID of the source vertex.
Definition: graph.h:41

Edge::prob
double prob
Probability of the Edge to be in an optimal tour.
Definition: graph.h:45

Edge::weight
double weight
Weight of the Edge, 1 if the data_structures is not weighted.
Definition: graph.h:44

Edge::symbol
unsigned short symbol
Symbol of the Edge, i.e. its unique ID.
Definition: graph.h:43

Edge::positionInGraph
unsigned short positionInGraph
Position of the Edge in the list of Edges of the Graph.
Definition: graph.h:46

Graph
Structure of a Graph.
Definition: graph.h:51

Graph::edges_matrix
Edge edges_matrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM]
Adjacency matrix of the Graph.
Definition: graph.h:59

Graph::num_edges
unsigned short num_edges
Number of Edges in the Graph.
Definition: graph.h:55

Graph::orderedEdges
bool orderedEdges
True if the Edges are ordered by weight, false otherwise.
Definition: graph.h:56

Graph::edges
Edge edges[MAX_EDGES_NUM]
Array of Edges.
Definition: graph.h:58

Graph::kind
GraphKind kind
Type of the Graph.
Definition: graph.h:52

Graph::nodes
Node nodes[MAX_VERTEX_NUM]
Array of Nodes.
Definition: graph.h:57

Graph::cost
double cost
Sum of the weights of the Edges in the Graph.
Definition: graph.h:53

Graph::num_nodes
unsigned short num_nodes
Number of Nodes in the Graph.
Definition: graph.h:54

List
The double linked list.
Definition: linked_list.h:35

Node
Structure of a Node.
Definition: graph.h:30

Node::x
double x
x coordinate of the Node.
Definition: graph.h:31

Node::y
double y
y coordinate of the Node.
Definition: graph.h:32

Node::num_neighbours
unsigned short num_neighbours
Number of neighbours of the Node.
Definition: graph.h:34

Node::positionInGraph
unsigned short positionInGraph
Position of the Node in the list of Nodes of the Graph, i.e. its unique ID.
Definition: graph.h:33

Node::neighbours
unsigned short neighbours[MAX_VERTEX_NUM - 1]
Array of IDs of the Node's neighbors.
Definition: graph.h:35