Sequoia
Loading...
Searching...
No Matches
Classes | Typedefs | Enumerations | Variables
GraphTraversalDetails.hpp File Reference

Meta-programming urilities and underlying function for graph traversals. More...

#include "sequoia/Maths/Graph/GraphTraits.hpp"
#include "sequoia/Maths/Graph/GraphDetails.hpp"
#include "sequoia/Core/Concurrency/ConcurrencyModels.hpp"
#include <vector>

Go to the source code of this file.

Classes

struct  sequoia::maths::null_func_obj
 
struct  sequoia::maths::traversal_constant< F >
 
class  sequoia::maths::traversal_conditions_base
 
class  sequoia::maths::traversal_conditions< FindDisconnected >
 
class  sequoia::maths::traversal_conditions< disconnected_discovery_mode::off >
 
class  sequoia::maths::results_accumulator< ConcurrencyModel >
 
class  sequoia::maths::results_accumulator< concurrency::serial< void > >
 
class  sequoia::maths::results_accumulator< concurrency::serial< R > >
 
struct  sequoia::maths::graph_impl::iterator_getter< F >
 
struct  sequoia::maths::graph_impl::iterator_getter< traversal_flavour::pseudo_depth_first >
 
struct  sequoia::maths::graph_impl::traversal_traits< G, F, QArgs >
 
class  sequoia::maths::graph_impl::node_comparer< G, Compare >
 
class  sequoia::maths::graph_impl::loop_processor< G, GraphFlavour >
 
class  sequoia::maths::graph_impl::loop_processor< G, GraphFlavour >
 
class  sequoia::maths::graph_impl::loop_processor< G, graph_flavour::undirected >
 
class  sequoia::maths::graph_impl::traversal_helper< G >
 

Typedefs

using sequoia::maths::breadth_first_search_type = traversal_constant< traversal_flavour::breadth_first >
 
using sequoia::maths::depth_first_search_type = traversal_constant< traversal_flavour::depth_first >
 
using sequoia::maths::pseudo_depth_first_search_type = traversal_constant< traversal_flavour::pseudo_depth_first >
 
using sequoia::maths::priority_first_search_type = traversal_constant< traversal_flavour::priority >
 
using sequoia::maths::find_disconnected_t = traversal_conditions< disconnected_discovery_mode::on >
 
using sequoia::maths::ignore_disconnected_t = traversal_conditions< disconnected_discovery_mode::off >
 

Enumerations

enum class  disconnected_discovery_mode { on , off }
 
enum class  traversal_flavour { breadth_first , depth_first , pseudo_depth_first , priority }
 

Variables

constexpr breadth_first_search_type sequoia::maths::breadth_first {}
 
constexpr depth_first_search_type sequoia::maths::depth_first {}
 
constexpr pseudo_depth_first_search_type sequoia::maths::pseudo_depth_first {}
 
constexpr priority_first_search_type sequoia::maths::priority_first {}
 

Detailed Description

Meta-programming urilities and underlying function for graph traversals.