This iterator class lists the nodes of the found clique. Before using it, you must allocate a GrossoLocatelliPullanMc instance and call its run() method.
The following example prints out the IDs of the nodes in the found clique.
GrossoLocatelliPullanMc<Graph> mc(g); mc.run(); for (GrossoLocatelliPullanMc<Graph>::CliqueNodeIt n(mc); n != INVALID; ++n) { std::cout << g.id(n) << std::endl; }
#include <lemon/grosso_locatelli_pullan_mc.h>
Public Member Functions | |
| CliqueNodeIt (const GrossoLocatelliPullanMc &mc) | |
| Constructor. | |
| operator Node () const | |
Conversion to Node. | |
| CliqueNodeIt & | operator++ () |
| Next node. | |
| GR::Node | operator++ (int) |
| Postfix incrementation. | |
| CliqueNodeIt | ( | const GrossoLocatelliPullanMc & | mc | ) | [inline] |
Constructor.
| mc | The algorithm instance. |
| GR::Node operator++ | ( | int | ) | [inline] |
Postfix incrementation.
Node, not a CliqueNodeIt as one may expect.
1.7.6.1