#include <GraphAlgorithmHelpers.h>
template<typename VertexID, typename Base = DoNothingGraphVisitor<VertexID>, typename EdgeSet = std::set<std::pair<VertexID, VertexID>>>
struct IgnoreEdgeSetVisitor< VertexID, Base, EdgeSet >
Definition at line 164 of file GraphAlgorithmHelpers.h.
◆ IgnoreEdgeSetVisitor()
template<typename VertexID , typename Base = DoNothingGraphVisitor<VertexID>, typename EdgeSet = std::set<std::pair<VertexID, VertexID>>>
template<typename ARG1 = EdgeSet, typename... Args>
◆ shouldIgnoreEdge()
template<typename VertexID , typename Base = DoNothingGraphVisitor<VertexID>, typename EdgeSet = std::set<std::pair<VertexID, VertexID>>>
bool IgnoreEdgeSetVisitor< VertexID, Base, EdgeSet >::shouldIgnoreEdge |
( |
const VertexID & |
v1, |
|
|
const VertexID & |
v2 |
|
) |
| |
|
inline |
◆ edges_to_ignore
template<typename VertexID , typename Base = DoNothingGraphVisitor<VertexID>, typename EdgeSet = std::set<std::pair<VertexID, VertexID>>>
The documentation for this struct was generated from the following file: