r234:ad6b8c47bd56
Mon, 28 Jul 2008 09:29:30
[Not Reviewed]
0 comments (0 inline)
0
1
0
| ... | ... |
@@ -342,48 +342,60 @@ |
| 342 | 342 |
|
| 343 | 343 |
typedef ExtendedListDigraphBase Parent; |
| 344 | 344 |
|
| 345 | 345 |
/// Constructor |
| 346 | 346 |
|
| 347 | 347 |
/// Constructor. |
| 348 | 348 |
/// |
| 349 | 349 |
ListDigraph() {}
|
| 350 | 350 |
|
| 351 | 351 |
///Add a new node to the digraph. |
| 352 | 352 |
|
| 353 | 353 |
///Add a new node to the digraph. |
| 354 | 354 |
///\return the new node. |
| 355 | 355 |
Node addNode() { return Parent::addNode(); }
|
| 356 | 356 |
|
| 357 | 357 |
///Add a new arc to the digraph. |
| 358 | 358 |
|
| 359 | 359 |
///Add a new arc to the digraph with source node \c s |
| 360 | 360 |
///and target node \c t. |
| 361 | 361 |
///\return the new arc. |
| 362 | 362 |
Arc addArc(const Node& s, const Node& t) {
|
| 363 | 363 |
return Parent::addArc(s, t); |
| 364 | 364 |
} |
| 365 | 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); }
|
|
| 377 |
|
|
| 366 | 378 |
/// Node validity check |
| 367 | 379 |
|
| 368 | 380 |
/// This function gives back true if the given node is valid, |
| 369 | 381 |
/// ie. it is a real node of the graph. |
| 370 | 382 |
/// |
| 371 | 383 |
/// \warning A Node pointing to a removed item |
| 372 | 384 |
/// could become valid again later if new nodes are |
| 373 | 385 |
/// added to the graph. |
| 374 | 386 |
bool valid(Node n) const { return Parent::valid(n); }
|
| 375 | 387 |
|
| 376 | 388 |
/// Arc validity check |
| 377 | 389 |
|
| 378 | 390 |
/// This function gives back true if the given arc is valid, |
| 379 | 391 |
/// ie. it is a real arc of the graph. |
| 380 | 392 |
/// |
| 381 | 393 |
/// \warning An Arc pointing to a removed item |
| 382 | 394 |
/// could become valid again later if new nodes are |
| 383 | 395 |
/// added to the graph. |
| 384 | 396 |
bool valid(Arc a) const { return Parent::valid(a); }
|
| 385 | 397 |
|
| 386 | 398 |
/// Change the target of \c e to \c n |
| 387 | 399 |
|
| 388 | 400 |
/// Change the target of \c e to \c n |
| 389 | 401 |
/// |
| ... | ... |
@@ -1186,48 +1198,60 @@ |
| 1186 | 1198 |
/// Constructor |
| 1187 | 1199 |
|
| 1188 | 1200 |
/// Constructor. |
| 1189 | 1201 |
/// |
| 1190 | 1202 |
ListGraph() {}
|
| 1191 | 1203 |
|
| 1192 | 1204 |
typedef ExtendedListGraphBase Parent; |
| 1193 | 1205 |
|
| 1194 | 1206 |
typedef Parent::OutArcIt IncEdgeIt; |
| 1195 | 1207 |
|
| 1196 | 1208 |
/// \brief Add a new node to the graph. |
| 1197 | 1209 |
/// |
| 1198 | 1210 |
/// Add a new node to the graph. |
| 1199 | 1211 |
/// \return the new node. |
| 1200 | 1212 |
Node addNode() { return Parent::addNode(); }
|
| 1201 | 1213 |
|
| 1202 | 1214 |
/// \brief Add a new edge to the graph. |
| 1203 | 1215 |
/// |
| 1204 | 1216 |
/// Add a new edge to the graph with source node \c s |
| 1205 | 1217 |
/// and target node \c t. |
| 1206 | 1218 |
/// \return the new edge. |
| 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, |
| 1213 | 1237 |
/// ie. it is a real node of the graph. |
| 1214 | 1238 |
/// |
| 1215 | 1239 |
/// \warning A Node pointing to a removed item |
| 1216 | 1240 |
/// could become valid again later if new nodes are |
| 1217 | 1241 |
/// added to the graph. |
| 1218 | 1242 |
bool valid(Node n) const { return Parent::valid(n); }
|
| 1219 | 1243 |
/// Arc validity check |
| 1220 | 1244 |
|
| 1221 | 1245 |
/// This function gives back true if the given arc is valid, |
| 1222 | 1246 |
/// ie. it is a real arc of the graph. |
| 1223 | 1247 |
/// |
| 1224 | 1248 |
/// \warning An Arc pointing to a removed item |
| 1225 | 1249 |
/// could become valid again later if new edges are |
| 1226 | 1250 |
/// added to the graph. |
| 1227 | 1251 |
bool valid(Arc a) const { return Parent::valid(a); }
|
| 1228 | 1252 |
/// Edge validity check |
| 1229 | 1253 |
|
| 1230 | 1254 |
/// This function gives back true if the given edge is valid, |
| 1231 | 1255 |
/// ie. it is a real arc of the graph. |
| 1232 | 1256 |
/// |
| 1233 | 1257 |
/// \warning A Edge pointing to a removed item |
0 comments (0 inline)