lean_graph.h File Reference

#include <__expected/unexpected.h>
#include <algorithm>
#include <functional>
#include <limits>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <unordered_map>
#include <unordered_set>

Go to the source code of this file.

Classes
class	lean_graph::Counter< Aspect, CounterType, H >
	INFO: A counter class. More...
class	lean_graph::EdgeIte< CounterType, Cost >
class	lean_graph::DiGraph< NodeType, Cost, CounterType, H >
class	lean_graph::DAG< NodeType, Cost, CounterType, H >
class	lean_graph::UniGraph< NodeType, Cost, CounterType, H >
class	lean_graph::Connectivity< CounterType, H >
	INFO: Connectivity is just glorified union find, this is from DPV book. More...

Namespaces
namespace	lean_graph

Concepts
concept	lean_graph::Hashable

Typedefs
template<class NodeType, class CounterType>
using	lean_graph::DefaultHashMap = std::unordered_map<NodeType, CounterType>
template<class CounterType, class Cost>
using	lean_graph::CounterEdge = std::tuple<CounterType, CounterType, Cost>
template<class CounterType>
using	lean_graph::CounterBlankEdge = std::tuple<CounterType, CounterType>
template<class CounterType, class Cost>
using	lean_graph::CounterHalfEdge = std::tuple<CounterType, Cost>
template<class CounterType, class Cost>
using	lean_graph::Edge = std::tuple<CounterType, CounterType, Cost>

Enumerations
enum class	lean_graph::node_error { lean_graph::not_exist , lean_graph::duplicate , lean_graph::general_error }
enum class	lean_graph::edge_error { lean_graph::not_exist , lean_graph::duplicate , lean_graph::general_error }
enum	lean_graph::VisitOrder { lean_graph::pre , lean_graph::post }