lemon/graph_utils.h
changeset 2535 716024e7c080
parent 2510 bb523a4758f7
child 2539 c25f62a6452d
equal deleted inserted replaced
68:4314a52392e3 69:402536c11b44
   929   ///\code
   929   ///\code
   930   /// copyGraph(trg, src).nodeRef(nr).edgeCrossRef(ecr).run();
   930   /// copyGraph(trg, src).nodeRef(nr).edgeCrossRef(ecr).run();
   931   ///\endcode
   931   ///\endcode
   932   /// 
   932   /// 
   933   /// After the copy the \c nr map will contain the mapping from the
   933   /// After the copy the \c nr map will contain the mapping from the
   934   /// from graph's nodes to the to graph's nodes and the \c ecr will
   934   /// nodes of the \c from graph to the nodes of the \c to graph and
   935   /// contain the mapping from the to graph's edges to the from's
   935   /// \c ecr will contain the mapping from the edges of the \c to graph
   936   /// edges.
   936   /// to the edges of the \c from graph.
   937   ///
   937   ///
   938   /// \see GraphCopy 
   938   /// \see GraphCopy 
   939   template <typename To, typename From>
   939   template <typename To, typename From>
   940   GraphCopy<To, From> copyGraph(To& to, const From& from) {
   940   GraphCopy<To, From> copyGraph(To& to, const From& from) {
   941     return GraphCopy<To, From>(to, from);
   941     return GraphCopy<To, From>(to, from);
  1186   ///\code
  1186   ///\code
  1187   /// copyUGraph(trg, src).nodeRef(nr).edgeCrossRef(ecr).run();
  1187   /// copyUGraph(trg, src).nodeRef(nr).edgeCrossRef(ecr).run();
  1188   ///\endcode
  1188   ///\endcode
  1189   /// 
  1189   /// 
  1190   /// After the copy the \c nr map will contain the mapping from the
  1190   /// After the copy the \c nr map will contain the mapping from the
  1191   /// from graph's nodes to the to graph's nodes and the \c ecr will
  1191   /// nodes of the \c from graph to the nodes of the \c to graph and
  1192   /// contain the mapping from the to graph's edges to the from's
  1192   /// \c ecr will contain the mapping from the edges of the \c to graph
  1193   /// edges.
  1193   /// to the edges of the \c from graph.
  1194   ///
  1194   ///
  1195   /// \see UGraphCopy 
  1195   /// \see UGraphCopy 
  1196   template <typename To, typename From>
  1196   template <typename To, typename From>
  1197   UGraphCopy<To, From> 
  1197   UGraphCopy<To, From> 
  1198   copyUGraph(To& to, const From& from) {
  1198   copyUGraph(To& to, const From& from) {
  1551   ///\code
  1551   ///\code
  1552   /// copyBpUGraph(trg, src).aNodeRef(anr).edgeCrossRef(ecr).run();
  1552   /// copyBpUGraph(trg, src).aNodeRef(anr).edgeCrossRef(ecr).run();
  1553   ///\endcode
  1553   ///\endcode
  1554   /// 
  1554   /// 
  1555   /// After the copy the \c nr map will contain the mapping from the
  1555   /// After the copy the \c nr map will contain the mapping from the
  1556   /// from graph's nodes to the to graph's nodes and the \c ecr will
  1556   /// nodes of the \c from graph to the nodes of the \c to graph and
  1557   /// contain the mapping from the to graph's edges to the from's
  1557   /// \c ecr will contain the mapping from the edges of the \c to graph
  1558   /// edges.
  1558   /// to the edges of the \c from graph.
  1559   ///
  1559   ///
  1560   /// \see BpUGraphCopy
  1560   /// \see BpUGraphCopy
  1561   template <typename To, typename From>
  1561   template <typename To, typename From>
  1562   BpUGraphCopy<To, From> 
  1562   BpUGraphCopy<To, From> 
  1563   copyBpUGraph(To& to, const From& from) {
  1563   copyBpUGraph(To& to, const From& from) {