GHS
Leader Election Based on GHS Minimum Spanning Tree
ghs_printer.h
Go to the documentation of this file.
1 
39 #ifndef ghs_printer_hpp
40 #define ghs_printer_hpp
41 
42 #include "ghs/ghs.h"
43 #include <string>
44 #include <iostream>
45 
49 template <std::size_t N, std::size_t A>
50 std::string dump_edges(const le::ghs::GhsState<N,A>&) ;
51 
55 template <std::size_t N, std::size_t A>
56 std::ostream& operator << ( std::ostream&, const le::ghs::GhsState<N,A>&);
57 
58 #include "ghs/ghs_printer_impl.hpp"
59 
60 #endif
dump_edges
std::string dump_edges(const le::ghs::GhsState< N, A > &)
Will dump edges in a readable format.
ghs.h
The main GhsState object
operator<<
std::ostream & operator<<(std::ostream &, const le::ghs::GhsState< N, A > &)
Will dump the whole object in a readable format.
ghs_printer_impl.hpp
the implementation of ghs_printer.h Just include ghs_printer.h
le::ghs::GhsState
The main state machine for the GHS algorithm
Definition: ghs.h:82
Generated by   doxygen 1.8.17