Structure of a Graph. More...

#include <graph.h>

Public Attributes
GraphKind	kind
	Type of the Graph.

double	cost
	Sum of the weights of the Edges in the Graph.

unsigned short	num_nodes
	Number of Nodes in the Graph.

unsigned short	num_edges
	Number of Edges in the Graph.

bool	orderedEdges
	True if the Edges are ordered by weight, false otherwise.

Node	nodes [MAX_VERTEX_NUM]
	Array of Nodes.

Edge	edges [MAX_EDGES_NUM]
	Array of Edges.

Edge	edges_matrix [MAX_VERTEX_NUM][MAX_VERTEX_NUM]
	Adjacency matrix of the Graph.

Detailed Description

Structure of a Graph.

Definition at line 51 of file graph.h.

Member Data Documentation

◆ cost

double Graph::cost

Sum of the weights of the Edges in the Graph.

Definition at line 53 of file graph.h.

◆ edges

Edge Graph::edges[MAX_EDGES_NUM]

Array of Edges.

Definition at line 58 of file graph.h.

◆ edges_matrix

Edge Graph::edges_matrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM]

Adjacency matrix of the Graph.

Definition at line 59 of file graph.h.

◆ kind

GraphKind Graph::kind

Type of the Graph.

Definition at line 52 of file graph.h.

◆ nodes

Node Graph::nodes[MAX_VERTEX_NUM]

Array of Nodes.

Definition at line 57 of file graph.h.

◆ num_edges

unsigned short Graph::num_edges

Number of Edges in the Graph.

Definition at line 55 of file graph.h.

◆ num_nodes

unsigned short Graph::num_nodes

Number of Nodes in the Graph.

Definition at line 54 of file graph.h.

◆ orderedEdges

bool Graph::orderedEdges

True if the Edges are ordered by weight, false otherwise.

Definition at line 56 of file graph.h.

Public Attributes