lemon/list_graph.h
changeset 558 e7017ec2d5cd
parent 440 88ed40ad0d4f
child 574 7a28e215f715
equal deleted inserted replaced
16:9a2303cd0a8c 17:bb9c4927a068
   349     ListDigraph() {}
   349     ListDigraph() {}
   350 
   350 
   351     ///Add a new node to the digraph.
   351     ///Add a new node to the digraph.
   352 
   352 
   353     ///Add a new node to the digraph.
   353     ///Add a new node to the digraph.
   354     ///\return the new node.
   354     ///\return The new node.
   355     Node addNode() { return Parent::addNode(); }
   355     Node addNode() { return Parent::addNode(); }
   356 
   356 
   357     ///Add a new arc to the digraph.
   357     ///Add a new arc to the digraph.
   358 
   358 
   359     ///Add a new arc to the digraph with source node \c s
   359     ///Add a new arc to the digraph with source node \c s
   360     ///and target node \c t.
   360     ///and target node \c t.
   361     ///\return the new arc.
   361     ///\return The new arc.
   362     Arc addArc(const Node& s, const Node& t) {
   362     Arc addArc(const Node& s, const Node& t) {
   363       return Parent::addArc(s, t);
   363       return Parent::addArc(s, t);
   364     }
   364     }
   365 
   365 
   366     ///\brief Erase a node from the digraph.
   366     ///\brief Erase a node from the digraph.
  1206     typedef Parent::OutArcIt IncEdgeIt;
  1206     typedef Parent::OutArcIt IncEdgeIt;
  1207 
  1207 
  1208     /// \brief Add a new node to the graph.
  1208     /// \brief Add a new node to the graph.
  1209     ///
  1209     ///
  1210     /// Add a new node to the graph.
  1210     /// Add a new node to the graph.
  1211     /// \return the new node.
  1211     /// \return The new node.
  1212     Node addNode() { return Parent::addNode(); }
  1212     Node addNode() { return Parent::addNode(); }
  1213 
  1213 
  1214     /// \brief Add a new edge to the graph.
  1214     /// \brief Add a new edge to the graph.
  1215     ///
  1215     ///
  1216     /// Add a new edge to the graph with source node \c s
  1216     /// Add a new edge to the graph with source node \c s
  1217     /// and target node \c t.
  1217     /// and target node \c t.
  1218     /// \return the new edge.
  1218     /// \return The new edge.
  1219     Edge addEdge(const Node& s, const Node& t) {
  1219     Edge addEdge(const Node& s, const Node& t) {
  1220       return Parent::addEdge(s, t);
  1220       return Parent::addEdge(s, t);
  1221     }
  1221     }
  1222 
  1222 
  1223     /// \brief Erase a node from the graph.
  1223     /// \brief Erase a node from the graph.