entt/graph_2fwd_8hpp_source.html

#ifndef ENTT_GRAPH_FWD_HPP

#define ENTT_GRAPH_FWD_HPP


#include "../core/fwd.hpp"

#include "../stl/concepts.hpp"

#include "../stl/cstddef.hpp"

#include "../stl/memory.hpp"


namespace entt {


struct directed_tag {};


struct undirected_tag: directed_tag {};


template<stl::derived_from<directed_tag>, typename = stl::allocator<stl::size_t>>

class adjacency_matrix;


template<typename = stl::allocator<id_type>>

class basic_flow;


using flow = basic_flow<>;


} // namespace entt


#endif

entt::adjacency_matrix
Basic implementation of a directed adjacency matrix.
Definition adjacency_matrix.hpp:88

entt::basic_flow
Utility class for creating task graphs.
Definition flow.hpp:29

entt
EnTT default namespace.
Definition dense_map.hpp:25

entt::flow
basic_flow<> flow
Alias declaration for the most common use case.
Definition fwd.hpp:24

entt::directed_tag
Undirected graph category tag.
Definition fwd.hpp:12

entt::undirected_tag
Directed graph category tag.
Definition fwd.hpp:15