RhodeCode

  IntNodeMap<Digraph>::type IntNodeMap;					\

  typedef typename ::lemon::_graph_utils_bits::				\

  DoubleNodeMap<Digraph>::type DoubleNodeMap;				\

  typedef typename ::lemon::_graph_utils_bits::				\

  BoolArcMap<Digraph>::type BoolArcMap;					\

  typedef typename ::lemon::_graph_utils_bits::				\

  IntArcMap<Digraph>::type IntArcMap;					\

  typedef typename ::lemon::_graph_utils_bits::				\

  DoubleArcMap<Digraph>::type DoubleArcMap

  ///Creates convenience typedefs for the graph types and iterators

  ///This \c \#define creates the same convenience typedefs as defined

  ///by \ref DIGRAPH_TYPEDEFS(Graph) and six more, namely it creates

  ///\c Edge, \c EdgeIt, \c IncEdgeIt, \c BoolEdgeMap, \c IntEdgeMap,

  ///\c DoubleEdgeMap.

#define GRAPH_TYPEDEFS(Graph)						\

  DIGRAPH_TYPEDEFS(Graph);						\

  typedef typename ::lemon::_graph_utils_bits::				\

  Edge<Graph>::type Edge;						\

  typedef typename ::lemon::_graph_utils_bits::				\

  EdgeIt<Graph>::type EdgeIt;						\

  typedef typename ::lemon::_graph_utils_bits::				\

  typedef typename ::lemon::_graph_utils_bits::				\

  BoolEdgeMap<Graph>::type BoolEdgeMap;					\

  typedef typename ::lemon::_graph_utils_bits::				\

  IntEdgeMap<Graph>::type IntEdgeMap;					\

  typedef typename ::lemon::_graph_utils_bits::				\

  DoubleEdgeMap<Graph>::type DoubleEdgeMap

  /// \brief Function to count the items in the graph.

  ///

  /// This function counts the items (nodes, arcs etc) in the graph.

  /// The complexity of the function is O(n) because

  /// it iterates on all of the items.

  template <typename Graph, typename Item>

  inline int countItems(const Graph& g) {

    typedef typename ItemSetTraits<Graph, Item>::ItemIt ItemIt;

    int num = 0;

    for (ItemIt it(g); it != INVALID; ++it) {

      ++num;

    }

    return num;

  }

  // Node counting: