GHS
Leader Election Based on GHS Minimum Spanning Tree
|
int agent_t
problems for GhsState
Definition: agent.h:51
@ MST
We have added this edge as an MST link.
Definition: edge.h:86
@ MST_PARENT
We have added this edge as parent MST link.
Definition: edge.h:88
unsigned long metric_t
Definition: edge.h:63
status_t
A status enumeration, for the ghs edges.
Definition: edge.h:82
@ DELETED
We have decided not to further consider this edge, either it was "bad", or it is already part of our ...
Definition: edge.h:90
agent_t root
The root is the "from" side of the edge.
Definition: edge.h:106
bool is_valid(const agent_t a)
Definition: agent.cpp:43
Edge worst_edge()
Definition: edge.cpp:45
agent_t peer
The peer is the "to" side of the edge.
Definition: edge.h:104
@ UNKNOWN
We have not probed this edge for information yet, or have not recieved a reponse.
Definition: edge.h:84
status_t status
The status of this edge, starting with UNKNOWN.
Definition: edge.h:108
provides le::ghs::agent_t defintion
const agent_t NO_AGENT
Definition: agent.h:56
metric_t metric_val
By default, this edge has metric_val = WORST_METRIC.
Definition: edge.h:110
const metric_t METRIC_NOT_SET
Definition: edge.h:79
const metric_t WORST_METRIC
Definition: edge.h:74
A struct to hold all the communication edge information.
Definition: edge.h:98