# HG changeset patch
# User Balazs Dezso <deba@inf.elte.hu>
# Date 1217230170 7200
# Node ID ad6b8c47bd56c03d587feab33d875a72b2adfd6f
# Parent 28239207a8a3ab9d5d248f1b36acc18e6779c502
Erase in the documentation of list graphs
diff r 28239207a8a3 r ad6b8c47bd56 lemon/list_graph.h
a

b


362  362  Arc addArc(const Node& s, const Node& t) { 
363  363  return Parent::addArc(s, t); 
364  364  } 
 365  
 366  ///\brief Erase a node from the digraph. 
 367  /// 
 368  ///Erase a node from the digraph. 
 369  /// 
 370  void erase(const Node& n) { Parent::erase(n); } 
 371  
 372  ///\brief Erase an arc from the digraph. 
 373  /// 
 374  ///Erase an arc from the digraph. 
 375  /// 
 376  void erase(const Arc& a) { Parent::erase(a); } 
365  377  
366  378  /// Node validity check 
367  379  
… 
… 

1207  1219  Edge addEdge(const Node& s, const Node& t) { 
1208  1220  return Parent::addEdge(s, t); 
1209  1221  } 
 1222  
 1223  /// \brief Erase a node from the graph. 
 1224  /// 
 1225  /// Erase a node from the graph. 
 1226  /// 
 1227  void erase(const Node& n) { Parent::erase(n); } 
 1228  
 1229  /// \brief Erase an edge from the graph. 
 1230  /// 
 1231  /// Erase an edge from the graph. 
 1232  /// 
 1233  void erase(const Edge& e) { Parent::erase(e); } 
1210  1234  /// Node validity check 
1211  1235  
1212  1236  /// This function gives back true if the given node is valid, 