Mercuriallemon-1.3 / comparison
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | file | latest | revisions | annotate | diff | comparison | raw | help
lemon/lgf_reader.h
changeset 1079 5958cc5c0a98
parent 1030 4936be66d2f5
child 1092 dceba191c00d
equal deleted inserted replaced
52:f5dcfc2af6eb 53:d4e36a737e8b 
  1228 
  1228 
  1229   };
 
  1229   };
 
  1230 
  1230 
  1231   /// \ingroup lemon_io
 
  1231   /// \ingroup lemon_io
 
  1232   ///
 
  1232   ///
 
  1233   /// \brief Return a \ref DigraphReader class
 
  1233   /// \brief Return a \ref lemon::DigraphReader "DigraphReader" class
 
  1234   ///
 
  1234   ///
 
  1235   /// This function just returns a \ref DigraphReader class.
 
  1235   /// This function just returns a \ref lemon::DigraphReader
 
       
  1236   /// "DigraphReader" class.
 
  1236   ///
 
  1237   ///
 
  1237   /// With this function a digraph can be read from an
 
  1238   /// With this function a digraph can be read from an
 
  1238   /// \ref lgf-format "LGF" file or input stream with several maps and
 
  1239   /// \ref lgf-format "LGF" file or input stream with several maps and
 
  1239   /// attributes. For example, there is network flow problem on a
 
  1240   /// attributes. For example, there is network flow problem on a
 
  1240   /// digraph, i.e. a digraph with a \e capacity map on the arcs and
 
  1241   /// digraph, i.e. a digraph with a \e capacity map on the arcs and
 
  1250   ///  node("source", src).
 
  1251   ///  node("source", src).
 
  1251   ///  node("target", trg).
 
  1252   ///  node("target", trg).
 
  1252   ///  run();
 
  1253   ///  run();
 
  1253   ///\endcode
 
  1254   ///\endcode
 
  1254   ///
 
  1255   ///
 
  1255   /// For a complete documentation, please see the \ref DigraphReader
 
  1256   /// For a complete documentation, please see the
 
       
  1257   /// \ref lemon::DigraphReader "DigraphReader"
 
  1256   /// class documentation.
 
  1258   /// class documentation.
 
  1257   /// \warning Don't forget to put the \ref DigraphReader::run() "run()"
 
  1259   /// \warning Don't forget to put the \ref lemon::DigraphReader::run() "run()"
 
  1258   /// to the end of the parameter list.
 
  1260   /// to the end of the parameter list.
 
  1259   /// \relates DigraphReader
 
  1261   /// \relates DigraphReader
 
  1260   /// \sa digraphReader(TDGR& digraph, const std::string& fn)
 
  1262   /// \sa digraphReader(TDGR& digraph, const std::string& fn)
 
  1261   /// \sa digraphReader(TDGR& digraph, const char* fn)
 
  1263   /// \sa digraphReader(TDGR& digraph, const char* fn)
 
  1262   template <typename TDGR>
 
  1264   template <typename TDGR>
 
  2106 
  2108 
  2107   };
 
  2109   };
 
  2108 
  2110 
  2109   /// \ingroup lemon_io
 
  2111   /// \ingroup lemon_io
 
  2110   ///
 
  2112   ///
 
  2111   /// \brief Return a \ref GraphReader class
 
  2113   /// \brief Return a \ref lemon::GraphReader "GraphReader" class
 
  2112   ///
 
  2114   ///
 
  2113   /// This function just returns a \ref GraphReader class.
 
  2115   /// This function just returns a \ref lemon::GraphReader "GraphReader" class.
 
  2114   ///
 
  2116   ///
 
  2115   /// With this function a graph can be read from an
 
  2117   /// With this function a graph can be read from an
 
  2116   /// \ref lgf-format "LGF" file or input stream with several maps and
 
  2118   /// \ref lgf-format "LGF" file or input stream with several maps and
 
  2117   /// attributes. For example, there is weighted matching problem on a
 
  2119   /// attributes. For example, there is weighted matching problem on a
 
  2118   /// graph, i.e. a graph with a \e weight map on the edges. This
 
  2120   /// graph, i.e. a graph with a \e weight map on the edges. This
 
  2124   ///graphReader(graph, std::cin).
 
  2126   ///graphReader(graph, std::cin).
 
  2125   ///  edgeMap("weight", weight).
 
  2127   ///  edgeMap("weight", weight).
 
  2126   ///  run();
 
  2128   ///  run();
 
  2127   ///\endcode
 
  2129   ///\endcode
 
  2128   ///
 
  2130   ///
 
  2129   /// For a complete documentation, please see the \ref GraphReader
 
  2131   /// For a complete documentation, please see the
 
       
  2132   /// \ref lemon::GraphReader "GraphReader"
 
  2130   /// class documentation.
 
  2133   /// class documentation.
 
  2131   /// \warning Don't forget to put the \ref GraphReader::run() "run()"
 
  2134   /// \warning Don't forget to put the \ref lemon::GraphReader::run() "run()"
 
  2132   /// to the end of the parameter list.
 
  2135   /// to the end of the parameter list.
 
  2133   /// \relates GraphReader
 
  2136   /// \relates GraphReader
 
  2134   /// \sa graphReader(TGR& graph, const std::string& fn)
 
  2137   /// \sa graphReader(TGR& graph, const std::string& fn)
 
  2135   /// \sa graphReader(TGR& graph, const char* fn)
 
  2138   /// \sa graphReader(TGR& graph, const char* fn)
 
  2136   template <typename TGR>
 
  2139   template <typename TGR>
 
  3172 
  3175 
  3173   };
 
  3176   };
 
  3174 
  3177 
  3175   /// \ingroup lemon_io
 
  3178   /// \ingroup lemon_io
 
  3176   ///
 
  3179   ///
 
  3177   /// \brief Return a \ref BpGraphReader class
 
  3180   /// \brief Return a \ref lemon::BpGraphReader "BpGraphReader" class
 
  3178   ///
 
  3181   ///
 
  3179   /// This function just returns a \ref BpGraphReader class.
 
  3182   /// This function just returns a \ref lemon::BpGraphReader
 
       
  3183   /// "BpGraphReader" class.
 
  3180   ///
 
  3184   ///
 
  3181   /// With this function a graph can be read from an
 
  3185   /// With this function a graph can be read from an
 
  3182   /// \ref lgf-format "LGF" file or input stream with several maps and
 
  3186   /// \ref lgf-format "LGF" file or input stream with several maps and
 
  3183   /// attributes. For example, there is bipartite weighted matching problem
 
  3187   /// attributes. For example, there is bipartite weighted matching problem
 
  3184   /// on a graph, i.e. a graph with a \e weight map on the edges. This
 
  3188   /// on a graph, i.e. a graph with a \e weight map on the edges. This
 
  3190   ///bpGraphReader(graph, std::cin).
 
  3194   ///bpGraphReader(graph, std::cin).
 
  3191   ///  edgeMap("weight", weight).
 
  3195   ///  edgeMap("weight", weight).
 
  3192   ///  run();
 
  3196   ///  run();
 
  3193   ///\endcode
 
  3197   ///\endcode
 
  3194   ///
 
  3198   ///
 
  3195   /// For a complete documentation, please see the \ref BpGraphReader
 
  3199   /// For a complete documentation, please see the
 
       
  3200   /// \ref lemon::BpGraphReader "BpGraphReader"
 
  3196   /// class documentation.
 
  3201   /// class documentation.
 
  3197   /// \warning Don't forget to put the \ref BpGraphReader::run() "run()"
 
  3202   /// \warning Don't forget to put the \ref lemon::BpGraphReader::run() "run()"
 
  3198   /// to the end of the parameter list.
 
  3203   /// to the end of the parameter list.
 
  3199   /// \relates BpGraphReader
 
  3204   /// \relates BpGraphReader
 
  3200   /// \sa bpGraphReader(TBGR& graph, const std::string& fn)
 
  3205   /// \sa bpGraphReader(TBGR& graph, const std::string& fn)
 
  3201   /// \sa bpGraphReader(TBGR& graph, const char* fn)
 
  3206   /// \sa bpGraphReader(TBGR& graph, const char* fn)
 
  3202   template <typename TBGR>
 
  3207   template <typename TBGR>
lemon-1.3