This Union-Find data structure is a particular union-find, dedicated for emptiness checks below, see ec.hh. The key of this union-find is int. Moreover, we suppose that only consecutive int are inserted. This union-find includes most of the classical optimisations (IPC, LR, PC, MS). More...

#include <spot/mc/unionfind.hh>

Collaboration diagram for spot::int_unionfind:

Public Member Functions
void	makeset (int e)

bool	unite (int e1, int e2)

void	markdead (int e)

bool	sameset (int e1, int e2)

bool	isdead (int e)

Detailed Description

This Union-Find data structure is a particular union-find, dedicated for emptiness checks below, see ec.hh. The key of this union-find is int. Moreover, we suppose that only consecutive int are inserted. This union-find includes most of the classical optimisations (IPC, LR, PC, MS).

The documentation for this class was generated from the following file:

spot/mc/unionfind.hh

Public Member Functions

Detailed Description