COIN-OR::LEMON - Graph Library

Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/nauty_reader.h

    r359 r352  
    3939  /// general, connected, biconnected, triangle-free, 4-cycle-free,
    4040  /// bipartite and graphs with given edge number and degree
    41   /// constraints). This function reads a \e nauty \e graph6 \e format
     41  /// constraints). This function reads a \e nauty \e graph \e format
    4242  /// line from the given stream and builds it in the given graph.
    4343  ///
     
    4949  /// int num = 0;
    5050  /// SmartGraph graph;
    51   /// while (readNautyGraph(graph, std::cin)) {
     51  /// while (readNauty(graph, std::cin)) {
    5252  ///   PlanarityChecking<SmartGraph> pc(graph);
    5353  ///   if (pc.run()) ++num;
     
    6262  ///\endcode
    6363  template <typename Graph>
    64   std::istream& readNautyGraph(Graph& graph, std::istream& is = std::cin) {
     64  std::istream& readNauty(Graph& graph, std::istream& is = std::cin) {
    6565    graph.clear();
    6666
Note: See TracChangeset for help on using the changeset viewer.