63 return s <<
"(" <<
foo.f1 <<
"," <<
foo.f2 <<
"," <<
foo.f3 <<
")";
67template <
template <
typename>
class C>
76 c.emplace(4,
"adios", -1.0);
79 c.emplace(i, str, 2.5);
81 c.for_each([] (
auto foo) { cout <<
foo; });
Arc * emplace_arc(Node *src, Node *tgt, Args &&... args)
Insert a new arc in the graph by constructing its associated data in-place with the given args.
Node * emplace_node(Args &&... args)
Insert a new node in the graph by constructing it in-place with the given args.
Singly linked list implementations with head-tail access.
Main namespace for Aleph-w library functions.
Divide_Conquer_DP_Result< Cost > divide_and_conquer_partition_dp(const size_t groups, const size_t n, Transition_Cost_Fn transition_cost, const Cost inf=dp_optimization_detail::default_inf< Cost >())
Optimize partition DP using divide-and-conquer optimization.
Arc of a flow network implemented with adjacency lists.
Arc type for maximum flow minimum cost networks.
Capacitated flow network with costs associated to arcs.
Arc * emplace_arc(Node *src_node, Node *tgt_node, const Flow_Type &cap, const Flow_Type &__cost, Args &&... args)
Create and insert an arc with arc info using perfect forwarding.
virtual Arc * insert_arc(Node *src_node, Node *tgt_node, const Flow_Type &cap, const Flow_Type &__cost)
Create and insert an arc in a flow network with costs.
Flow network implemented with adjacency lists.
Node * emplace_node(Args &&... args)
Construct a node in-place and insert it into the network.
Arc * insert_arc(Node *src_node, Node *tgt_node, const Flow_Type &cap, const Flow_Type &flow, const typename Arc::Arc_Type &arc_info=Arc_Type())
Insert a capacitated arc with an initial flow.
Arc * emplace_arc(Node *src_node, Node *tgt_node, const Flow_Type &cap, const Flow_Type &flow, Args &&... args)
Construct arc info in-place and insert the arc.
Foo(int __f1, const string &__f2, float __f3)
friend ostream & operator<<(ostream &s, const Foo &foo)
Foo(int __f1, const string &__f2)
Array-based graph implementation.
Array-based dynamic binary heap.
Lazy and scalable dynamic array implementation.
Dynamic binary heap with node-based storage.
Dynamic doubly linked list implementation.
Dynamic set implementations based on hash tables.
Dynamic set implementations based on balanced binary search trees.
Generic graph and digraph implementations.
Network flow graph structures.
Maximum flow minimum cost network algorithms.
Simple graph implementation with adjacency lists.