Minimum Spanning Tree, or MST, and also a 1-Tree.
More...
#include <mst.h>
|
bool | isValid |
| True if the MST has the correct number of Edges, false otherwise.
|
|
double | cost |
| The total cost of the MST, i.e. the sum of the weights of the Edges.
|
|
double | prob |
| The probability of the MST, i.e. the average of the probabilities of its Edges.
|
|
unsigned short | num_nodes |
| The number of Nodes in the MST.
|
|
unsigned short | num_edges |
| The number of Edges in the MST.
|
|
Node | nodes [MAX_VERTEX_NUM] |
| The set of Nodes in the MST.
|
|
Edge | edges [MAX_VERTEX_NUM] |
| The set of Edges in the MST, these are |V| because the MST can be a 1-Tree.
|
|
short | edges_matrix [MAX_VERTEX_NUM][MAX_VERTEX_NUM] |
| -1 if there is no Edge between the two Nodes, otherwise the index of the Edge in the MST.
|
|
Minimum Spanning Tree, or MST, and also a 1-Tree.
Definition at line 28 of file mst.h.
◆ cost
The total cost of the MST, i.e. the sum of the weights of the Edges.
Definition at line 30 of file mst.h.
◆ edges
Edge MST::edges[MAX_VERTEX_NUM] |
The set of Edges in the MST, these are |V| because the MST can be a 1-Tree.
Definition at line 35 of file mst.h.
◆ edges_matrix
short MST::edges_matrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM] |
-1 if there is no Edge between the two Nodes, otherwise the index of the Edge in the MST.
Definition at line 36 of file mst.h.
◆ isValid
True if the MST has the correct number of Edges, false otherwise.
Definition at line 29 of file mst.h.
◆ nodes
Node MST::nodes[MAX_VERTEX_NUM] |
The set of Nodes in the MST.
Definition at line 34 of file mst.h.
◆ num_edges
unsigned short MST::num_edges |
The number of Edges in the MST.
Definition at line 33 of file mst.h.
◆ num_nodes
unsigned short MST::num_nodes |
The number of Nodes in the MST.
Definition at line 32 of file mst.h.
◆ prob
The probability of the MST, i.e. the average of the probabilities of its Edges.
Definition at line 31 of file mst.h.