ViableEdge Struct Reference

Predicate: gives info on whether an edge is worth keeping. Namely, the edge is either not a self-edge (the vertex is not connected to itself) and if it is, the edge is not trivial (i.e. simulating this self-transition takes more than 0 simulation steps) More...

#include <graphTools.h>

Public Member Functions
	ViableEdge (TransitionSystem *_g)
bool	operator() (const edgeDescriptor &e) const

Detailed Description

Predicate: gives info on whether an edge is worth keeping. Namely, the edge is either not a self-edge (the vertex is not connected to itself) and if it is, the edge is not trivial (i.e. simulating this self-transition takes more than 0 simulation steps)

---

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

• src/graphTools.h