RhodeCode

  /// amount of the nodes are written to \c supply (signed). The

  /// lower bounds, capacities and costs of the arcs are written to

  /// \c lower, \c capacity and \c cost.

  template <typename Digraph, typename LowerMap,

    typename CapacityMap, typename CostMap,

    typename SupplyMap>

                   Digraph &g,

                   LowerMap& lower,

                   CapacityMap& capacity,

                   CostMap& cost,

                   SupplyMap& supply )

  {

  ///   p max

  /// \endcode

  /// At the beginning \c g is cleared by \c g.clear(). The arc

  /// capacities are written to \c capacity and \c s and \c t are

  /// set to the source and the target nodes.

  template<typename Digraph, typename CapacityMap>

                  typename Digraph::Node &s, typename Digraph::Node &t) {

    g.clear();

    std::vector<typename Digraph::Node> nodes;

    typename Digraph::Arc e;

    std::string problem;

    char c, d;

  ///   p sp

  /// \endcode

  /// At the beginning \c g is cleared by \c g.clear(). The arc

  /// capacities are written to \c capacity and \c s is set to the

  /// source node.

  template<typename Digraph, typename CapacityMap>

                  typename Digraph::Node &s) {

  }

  /// DIMACS capacitated digraph reader function.

  ///

  /// This function reads an arc capacitated digraph instance from

  /// DIMACS format. At the beginning \c g is cleared by \c g.clear()

  /// and the arc capacities are written to \c capacity.

  template<typename Digraph, typename CapacityMap>

  }

  /// DIMACS plain digraph reader function.

  ///

  /// This function reads a digraph without any designated nodes and

  /// maps from DIMACS format, i.e. from DIMACS files having a line

  /// starting with

  /// \code

  ///   p mat

  /// \endcode

  /// At the beginning \c g is cleared by \c g.clear().

  template<typename Digraph>

    NullMap<typename Digraph::Arc, int> n;

  }

  /// DIMACS plain digraph writer function.

  ///

  /// This function writes a digraph without any designated nodes and

  /// maps into DIMACS format, i.e. into DIMACS file having a line

  /// starting with

  /// \code

  ///   p mat

  /// \endcode

  template<typename Digraph>

    typedef typename Digraph::NodeIt NodeIt;

    typedef typename Digraph::ArcIt ArcIt;

    os << "c matching problem" << std::endl;

    os << "p mat " << g.nodeNum() << " " << g.arcNum() << std::endl;

  ostream& os = (outputName.empty() ? cout : output);

  if (mincostflow) {

    Digraph digraph;

    DoubleArcMap lower(digraph), capacity(digraph), cost(digraph);

    DoubleNodeMap supply(digraph);

    DigraphWriter<Digraph>(digraph, os).

      nodeMap("supply", supply).

      arcMap("lower", lower).

      arcMap("capacity", capacity).

      arcMap("cost", cost).

      run();

  } else if (maxflow) {

    Digraph digraph;

    Node s, t;

    DoubleArcMap capacity(digraph);

    DigraphWriter<Digraph>(digraph, os).

      arcMap("capacity", capacity).

      node("source", s).

      node("target", t).

      run();

  } else if (shortestpath) {

    Digraph digraph;

    Node s;

    DoubleArcMap capacity(digraph);

    DigraphWriter<Digraph>(digraph, os).

      arcMap("capacity", capacity).

      node("source", s).

      run();

  } else if (capacitated) {

    Digraph digraph;

    DoubleArcMap capacity(digraph);

    DigraphWriter<Digraph>(digraph, os).

      arcMap("capacity", capacity).

      run();

  } else if (plain) {

    Digraph digraph;

    DigraphWriter<Digraph>(digraph, os).run();

  } else {

    cerr << "Invalid type error" << endl;

    return -1;

  }

  return 0;