RhodeCode

  /// The algorithm calculates an optimal fractional matching and a

  /// proof of the optimality. The solution of the dual problem can be

  /// used to check the result of the algorithm. The dual linear

  /// problem is the following.

  /// \f[ y_u + y_v \ge w_{uv} \quad \forall uv\in E\f]

  /// \f[y_u \ge 0 \quad \forall u \in V\f]

  /// \f[\min \sum_{u \in V}y_u \f]

  ///

  /// The algorithm can be executed with the run() function.

  /// After it the matching (the primal solution) and the dual solution

  /// can be obtained using the query functions.

  ///

  ///

  /// \tparam GR The undirected graph type the algorithm runs on.

  /// \tparam WM The type edge weight map. The default type is

  /// \ref concepts::Graph::EdgeMap "GR::EdgeMap<int>".

#ifdef DOXYGEN

  template <typename GR, typename WM>

#else

  template <typename GR,

            typename WM = typename GR::template EdgeMap<int> >

#endif

  class MaxWeightedFractionalMatching {

  public:

    typedef GR Graph;

    /// The type of the edge weight map

    typedef WM WeightMap;

    /// The value type of the edge weights

    typedef typename WeightMap::Value Value;

    /// The type of the matching map

    typedef typename Graph::template NodeMap<typename Graph::Arc>

    MatchingMap;

    /// \brief Scaling factor for primal solution

    ///

    /// \brief Scaling factor for dual solution

    ///

    /// Scaling factor for dual solution. It is equal to 4 or 1

    /// according to the value type.

    static const int dualScale =

      std::numeric_limits<Value>::is_integer ? 4 : 1;

  private:

    TEMPLATE_GRAPH_TYPEDEFS(Graph);

        }

      }

      return num;

    }

    /// \brief Return \c true if the given edge is in the matching.

    ///

    /// This function returns \c true if the given edge is in the

    /// found matching. The result is scaled by \ref primalScale

    /// "primal scale".

    ///

    /// \pre Either run() or start() must be called before using this function.

    }

    /// \brief Return the fractional matching arc (or edge) incident

    /// to the given node.

    ///

    /// This function returns one of the fractional matching arc (or

    /// edge) incident to the given node in the found matching or \c

    /// INVALID if the node is not covered by the matching or if the

    /// node is on an odd length cycle then it is the successor edge

    /// on the cycle.

    ///

    /// \pre Either run() or start() must be called before using this function.

  /// value edges and a set of odd length cycles with half value edges.

  ///

  /// The algorithm calculates an optimal fractional matching and a

  /// proof of the optimality. The solution of the dual problem can be

  /// used to check the result of the algorithm. The dual linear

  /// problem is the following.

  /// \f[ y_u + y_v \ge w_{uv} \quad \forall uv\in E\f]

  /// \f[\min \sum_{u \in V}y_u \f]

  ///

  /// The algorithm can be executed with the run() function.

  /// After it the matching (the primal solution) and the dual solution

  /// can be obtained using the query functions.

  ///

  /// \tparam GR The undirected graph type the algorithm runs on.

  /// \tparam WM The type edge weight map. The default type is

  /// \ref concepts::Graph::EdgeMap "GR::EdgeMap<int>".

#ifdef DOXYGEN

  template <typename GR, typename WM>

#else

  template <typename GR,

            typename WM = typename GR::template EdgeMap<int> >

#endif

  class MaxWeightedPerfectFractionalMatching {

  public:

    typedef GR Graph;

    /// The type of the edge weight map

    typedef WM WeightMap;

    /// The value type of the edge weights

    typedef typename WeightMap::Value Value;

    /// The type of the matching map

    typedef typename Graph::template NodeMap<typename Graph::Arc>

    MatchingMap;

    /// \brief Scaling factor for primal solution

    ///

    /// \brief Scaling factor for dual solution

    ///

    /// Scaling factor for dual solution. It is equal to 4 or 1

    /// according to the value type.

    static const int dualScale =

      std::numeric_limits<Value>::is_integer ? 4 : 1;

  private:

    TEMPLATE_GRAPH_TYPEDEFS(Graph);

        }

      }

      return num;

    }

    /// \brief Return \c true if the given edge is in the matching.

    ///

    /// This function returns \c true if the given edge is in the

    /// found matching. The result is scaled by \ref primalScale

    /// "primal scale".

    ///

    /// \pre Either run() or start() must be called before using this function.

    }

    /// \brief Return the fractional matching arc (or edge) incident

    /// to the given node.

    ///

    /// This function returns one of the fractional matching arc (or

    /// edge) incident to the given node in the found matching or \c

    /// INVALID if the node is not covered by the matching or if the

    /// node is on an odd length cycle then it is the successor edge

    /// on the cycle.

    ///

    /// \pre Either run() or start() must be called before using this function.

        ++indeg;

      }

    }

    if (mfm.matching(n) != INVALID) {

      check(indeg == 1, "Invalid matching");

      ++pv;

    } else {

      check(indeg == 0, "Invalid matching");

    }

  }

  check(pv == mfm.matchingSize(), "Wrong matching size");

  SmartGraph::NodeMap<bool> processed(graph, false);

  for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {

    if (processed[n]) continue;

    processed[n] = true;

    if (mfm.matching(n) == INVALID) continue;

    int num = 1;

    Node v = graph.target(mfm.matching(n));

    while (v != n) {

      processed[v] = true;

      ++num;

      v = graph.target(mfm.matching(v));

    }

                             bool perfect, bool allow_loops = true) {

  if (perfect) {

    for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {

      int indeg = 0;

      for (InArcIt a(graph, n); a != INVALID; ++a) {

        if (mfm.matching(graph.source(a)) == a) {

          ++indeg;

        }

      }

      check(mfm.matching(n) != INVALID, "Invalid matching");

      check(indeg == 1, "Invalid matching");

    }

  } else {

    int anum = 0, bnum = 0;

    SmartGraph::NodeMap<bool> neighbours(graph, false);

    for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {

      if (!mfm.barrier(n)) continue;

      ++anum;

      for (SmartGraph::InArcIt a(graph, n); a != INVALID; ++a) {

        Node u = graph.source(a);

        if (!allow_loops && u == n) continue;

        if (!neighbours[u]) {

          neighbours[u] = true;

          ++bnum;

    check(indeg <= 1, "Invalid matching");

    if (mwfm.matching(n) != INVALID) {

      check(mwfm.nodeValue(n) >= 0, "Invalid node value");

      check(indeg == 1, "Invalid matching");

      pv += weight[mwfm.matching(n)];

      SmartGraph::Node o = graph.target(mwfm.matching(n));

    } else {

      check(mwfm.nodeValue(n) == 0, "Invalid matching");

      check(indeg == 0, "Invalid matching");

    }

  }

  int dv = 0;

  for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {

    dv += mwfm.nodeValue(n);

  }

  check(pv * mwfm.dualScale == dv * 2, "Wrong duality");

  SmartGraph::NodeMap<bool> processed(graph, false);

  for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {

    if (processed[n]) continue;

    processed[n] = true;

    if (mwfm.matching(n) == INVALID) continue;

    int indeg = 0;

    for (InArcIt a(graph, n); a != INVALID; ++a) {

      if (mwpfm.matching(graph.source(a)) == a) {

        ++indeg;

      }

    }

    check(mwpfm.matching(n) != INVALID, "Invalid perfect matching");

    check(indeg == 1, "Invalid perfect matching");

    pv += weight[mwpfm.matching(n)];

    SmartGraph::Node o = graph.target(mwpfm.matching(n));

  }

  int dv = 0;

  for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {

    dv += mwpfm.nodeValue(n);

  }

  check(pv * mwpfm.dualScale == dv * 2, "Wrong duality");

  SmartGraph::NodeMap<bool> processed(graph, false);

  for (SmartGraph::NodeIt n(graph); n != INVALID; ++n) {

    if (processed[n]) continue;

    processed[n] = true;

    if (mwpfm.matching(n) == INVALID) continue;