lean_graph Namespace Reference

Classes
class	Connectivity
	INFO: Connectivity is just glorified union find, this is from DPV book. More...
class	Counter
	INFO: A counter class. More...
class	DAG
class	DiGraph
class	EdgeIte
class	UniGraph

Concepts
concept	Hashable

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

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

Typedef Documentation

CounterBlankEdge

template<class CounterType>

using lean_graph::CounterBlankEdge = std::tuple<CounterType, CounterType>

CounterEdge

template<class CounterType, class Cost>

using lean_graph::CounterEdge = std::tuple<CounterType, CounterType, Cost>

CounterHalfEdge

template<class CounterType, class Cost>

using lean_graph::CounterHalfEdge = std::tuple<CounterType, Cost>

DefaultHashMap

template<class NodeType, class CounterType>

using lean_graph::DefaultHashMap = std::unordered_map<NodeType, CounterType>

Edge

template<class CounterType, class Cost>

using lean_graph::Edge = std::tuple<CounterType, CounterType, Cost>

Enumeration Type Documentation

edge_error

enum class lean_graph::edge_error

strong

Enumerator
not_exist
duplicate
general_error

node_error

enum class lean_graph::node_error

strong

Enumerator
not_exist
duplicate
general_error

VisitOrder

enum lean_graph::VisitOrder

Enumerator
pre
post