spot::int_unionfind Class Reference

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 optimizations (IPC, LR, PC, MS). More...

#include <spot/mc/unionfind.hh>

Collaboration diagram for spot::int_unionfind:

Public Member Functions
	int_unionfind ()
	Default constructor. More...
void	makeset (int e)
	Create a new singleton set containing element e. More...
bool	unite (int e1, int e2)
	Unite the sets containing e1 and e2; return true if they were different. More...
void	markdead (int e)
	Mark element e as dead. More...
bool	sameset (int e1, int e2)
	Check if elements are in the same set. More...
bool	isdead (int e)
	Check if element is marked as dead. More...

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 optimizations (IPC, LR, PC, MS).

Constructor & Destructor Documentation

int_unionfind()

spot::int_unionfind::int_unionfind

(

)

Default constructor.

Member Function Documentation

isdead()

bool spot::int_unionfind::isdead

(

int

e

)

Check if element is marked as dead.

makeset()

void spot::int_unionfind::makeset

(

int

e

)

Create a new singleton set containing element e.

markdead()

void spot::int_unionfind::markdead

(

int

e

)

Mark element e as dead.

sameset()

bool spot::int_unionfind::sameset	(	int	e1,
		int	e2
	)

Check if elements are in the same set.

unite()

bool spot::int_unionfind::unite	(	int	e1,
		int	e2
	)

Unite the sets containing e1 and e2; return true if they were different.

---

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

• spot/mc/unionfind.hh