Changeset 61:d718974f1290 in lemon1.0 for lemon/concepts/digraph.h
 Timestamp:
 01/25/08 13:39:52 (17 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/concepts/digraph.h
r57 r61 349 349 Node source(Arc) const { return INVALID; } 350 350 351 /// \brief Returns the ID of the node. 352 int id(Node) const { return 1; } 353 354 /// \brief Returns the ID of the arc. 355 int id(Arc) const { return 1; } 356 357 /// \brief Returns the node with the given ID. 358 /// 359 /// \pre The argument should be a valid node ID in the graph. 360 Node nodeFromId(int) const { return INVALID; } 361 362 /// \brief Returns the arc with the given ID. 363 /// 364 /// \pre The argument should be a valid arc ID in the graph. 365 Arc arcFromId(int) const { return INVALID; } 366 367 /// \brief Returns an upper bound on the node IDs. 368 int maxNodeId() const { return 1; } 369 370 /// \brief Returns an upper bound on the arc IDs. 371 int maxArcId() const { return 1; } 372 351 373 void first(Node&) const {} 352 374 void next(Node&) const {} … … 361 383 void firstOut(Arc&, const Node&) const {} 362 384 void nextOut(Arc&) const {} 385 386 // The second parameter is dummy. 387 Node fromId(int, Node) const { return INVALID; } 388 // The second parameter is dummy. 389 Arc fromId(int, Arc) const { return INVALID; } 390 391 // Dummy parameter. 392 int maxId(Node) const { return 1; } 393 // Dummy parameter. 394 int maxId(Arc) const { return 1; } 363 395 364 396 /// \brief The base node of the iterator. … … 440 472 void constraints() { 441 473 checkConcept<IterableDigraphComponent<>, Digraph>(); 474 checkConcept<IDableDigraphComponent<>, Digraph>(); 442 475 checkConcept<MappableDigraphComponent<>, Digraph>(); 443 476 }
Note: See TracChangeset
for help on using the changeset viewer.