RhodeCode

  /// general, connected, biconnected, triangle-free, 4-cycle-free,

  /// bipartite and graphs with given edge number and degree

  /// constraints). This function reads a \e nauty \e graph6 \e format

  /// line from the given stream and builds it in the given graph.

  ///

  /// The site of nauty package: http://cs.anu.edu.au/~bdm/nauty/

  ///

  /// For example, the number of all non-isomorphic planar graphs

  /// can be computed with the following code.

  ///\code

  /// int num = 0;

  /// SmartGraph graph;

  ///   PlanarityChecking<SmartGraph> pc(graph);

  ///   if (pc.run()) ++num;

  /// }

  /// std::cout << "Number of planar graphs: " << num << std::endl;

  ///\endcode

  ///

  /// The nauty files are quite huge, therefore instead of the direct

  /// file generation pipelining is recommended. For example,

  ///\code

  /// ./geng -c 10 | ./num_of_planar_graphs

  ///\endcode

  template <typename Graph>

    graph.clear();

    std::string line;

    if (getline(is, line)) {

      int index = 0;

      int n;

      if (line[index] == '>') {

        index += 10;

      }

        -e "s/\<DefProcessedMapToBeDefaultMap\>/SetStandardProcessedMap/g"\

        -e "s/\<copyGraph\>/graphCopy/g"\

        -e "s/\<copyDigraph\>/digraphCopy/g"\

        -e "s/\<IntegerMap\>/RangeMap/g"\

        -e "s/\<integerMap\>/rangeMap/g"\

        -e "s/\<\([sS]\)tdMap\>/\1parseMap/g"\

        -e "s/\<\([Ff]\)unctorMap\>/\1unctorToMap/g"\

        -e "s/\<\([Mm]\)apFunctor\>/\1apToFunctor/g"\

        -e "s/\<\([Ff]\)orkWriteMap\>/\1orkMap/g"\

        -e "s/\<StoreBoolMap\>/LoggerBoolMap/g"\

        -e "s/\<storeBoolMap\>/loggerBoolMap/g"\

        -e "s/\<BoundingBox\>/Box/g"\

    <$i > $TMP

    mv $TMP $i

done