sequoia::maths::graph_impl::traversal_helper< G > Class Template Reference

Public Types
using	edge_index_type = typename G::edge_index_type
using	const_edge_iterator = typename G::const_edge_iterator

Public Member Functions
template<traversal_flavour F, disconnected_discovery_mode FindDisconnected, class NBEF , class NAEF , class EFTF , class ESTF , class TaskProcessingModel , class... QArgs> requires (std::invocable<NBEF, edge_index_type> ) && (std::invocable<NAEF, edge_index_type> ) && (std::invocable<EFTF, const_edge_iterator>) && (std::invocable<ESTF, const_edge_iterator>)
constexpr auto	traverse (traversal_constant< F >, const G &graph, traversal_conditions< FindDisconnected > conditions, NBEF &&nodeBeforeEdgesFn, NAEF &&nodeAfterEdgesFn, EFTF &&edgeFirstTraversalFn, ESTF &&edgeSecondTraversalFn, TaskProcessingModel &&taskProcessingModel, QArgs &&... qargs)
template<disconnected_discovery_mode FindDisconnected, class NBEF , class NAEF , class ETUN , class TaskProcessingModel > requires (std::invocable<NBEF, edge_index_type>) && (std::invocable<NAEF, edge_index_type>) && (std::invocable<ETUN, typename G::const_edge_iterator>)
constexpr auto	traverse (depth_first_search_type, const G &graph, traversal_conditions< FindDisconnected > conditions, NBEF &&nodeBeforeEdgesFn, NAEF &&nodeAfterEdgesFn, ETUN &&edgeToUndiscoveredNodeFn, TaskProcessingModel &&taskProcessingModel)

---

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

• C:/Users/olive/sequoia/Source/sequoia/Maths/Graph/GraphTraversalDetails.hpp