spot::enumerate_cycles::dfs_entry Struct Reference

DFS stack entry for the cycle enumeration algorithm. More...

#include <spot/twaalgos/cycles.hh>

Collaboration diagram for spot::enumerate_cycles::dfs_entry:

Public Member Functions
	dfs_entry (unsigned s) noexcept
	Construct a DFS entry for state s. More...

Public Attributes
unsigned	s
	State index. More...
unsigned	succ = 0U
	Current successor being explored. More...
bool	f = false

Detailed Description

DFS stack entry for the cycle enumeration algorithm.

Each entry contains a state, an iterator on the transitions leaving that state, and a Boolean f indicating whether this state as already contributed to a cycle (f is updated when backtracking, so it should not be used by cycle_found()).

Constructor & Destructor Documentation

dfs_entry()

spot::enumerate_cycles::dfs_entry::dfs_entry ( unsigned  s )

inlinenoexcept

Construct a DFS entry for state s.

Member Data Documentation

f

bool spot::enumerate_cycles::dfs_entry::f = false

Edge condition accumulated so far.

s

unsigned spot::enumerate_cycles::dfs_entry::s

State index.

succ

unsigned spot::enumerate_cycles::dfs_entry::succ = 0U

Current successor being explored.

---

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

• spot/twaalgos/cycles.hh