equal
deleted
inserted
replaced
628 calculateIn(t); |
628 calculateIn(t); |
629 } |
629 } |
630 |
630 |
631 /// @} |
631 /// @} |
632 |
632 |
633 /// \name Query Functions The result of the %HaoOrlin algorithm |
633 /// \name Query Functions |
|
634 /// The result of the %HaoOrlin algorithm |
634 /// can be obtained using these functions. |
635 /// can be obtained using these functions. |
635 /// \n |
636 /// \n |
636 /// Before the use of these functions, either \ref run(), \ref |
637 /// Before using these functions, either \ref run(), \ref |
637 /// calculateOut() or \ref calculateIn() must be called. |
638 /// calculateOut() or \ref calculateIn() must be called. |
638 |
639 |
639 /// @{ |
640 /// @{ |
640 |
641 |
641 /// \brief Returns the value of the minimum value cut. |
642 /// \brief Returns the value of the minimum value cut. |
649 /// \brief Returns a minimum cut. |
650 /// \brief Returns a minimum cut. |
650 /// |
651 /// |
651 /// Sets \c nodeMap to the characteristic vector of a minimum |
652 /// Sets \c nodeMap to the characteristic vector of a minimum |
652 /// value cut: it will give a nonempty set \f$ X\subsetneq V \f$ |
653 /// value cut: it will give a nonempty set \f$ X\subsetneq V \f$ |
653 /// with minimal out-degree (i.e. \c nodeMap will be true exactly |
654 /// with minimal out-degree (i.e. \c nodeMap will be true exactly |
654 /// for the nodes of \f$ X \f$. \pre nodeMap should be a |
655 /// for the nodes of \f$ X \f$). \pre nodeMap should be a |
655 /// bool-valued node-map. |
656 /// bool-valued node-map. |
656 template <typename NodeMap> |
657 template <typename NodeMap> |
657 Value minCut(NodeMap& nodeMap) const { |
658 Value minCut(NodeMap& nodeMap) const { |
658 for (NodeIt it(*_graph); it != INVALID; ++it) { |
659 for (NodeIt it(*_graph); it != INVALID; ++it) { |
659 nodeMap.set(it, (*_min_cut_map)[it]); |
660 nodeMap.set(it, (*_min_cut_map)[it]); |