|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Filter of painter arcs with that are set the Spanning_Tree control bit. More...
#include <tpl_graph.H>
Public Member Functions | |
| Painted_Min_Spanning_Tree () noexcept | |
| bool | operator() (typename GT::Arc *a) noexcept |
Public Attributes | |
| Distance::Distance_Type | dist |
| Accumulative distance from the first seen arc until the last seen. | |
Filter of painter arcs with that are set the Spanning_Tree control bit.
Some Aleph-w ( \(\aleph_\omega\)) algorithms set the Spanning_Tree control bit in order to mark their results. This simple filter filters those arc and addition computes the accumulative distance between all the seen arcs.
Definition at line 3802 of file tpl_graph.H.
|
inlinenoexcept |
Definition at line 3807 of file tpl_graph.H.
|
inlinenoexcept |
Definition at line 3811 of file tpl_graph.H.
References Aleph::Painted_Min_Spanning_Tree< GT, Distance >::dist, IS_ARC_VISITED, Aleph::maps(), and Aleph::Spanning_Tree.
Accumulative distance from the first seen arc until the last seen.
Definition at line 3805 of file tpl_graph.H.
Referenced by Aleph::Painted_Min_Spanning_Tree< GT, Distance >::operator()().