Changeset 980:0f1044b7a3af in lemon-0.x for src/lemon/smart_graph.h
- Timestamp:
- 11/11/04 10:31:55 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1368
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/lemon/smart_graph.h
r977 r980 28 28 #include <lemon/clearable_graph_extender.h> 29 29 #include <lemon/extendable_graph_extender.h> 30 #include <lemon/idmappable_graph_extender.h>31 30 #include <lemon/iterable_graph_extender.h> 32 31 #include <lemon/alteration_observer_registry.h> … … 92 91 /// Maximum node ID. 93 92 ///\sa id(Node) 94 int max NodeId() const { return nodes.size()-1; }93 int maxId(Node = INVALID) const { return nodes.size()-1; } 95 94 /// Maximum edge ID. 96 95 97 96 /// Maximum edge ID. 98 97 ///\sa id(Edge) 99 int max EdgeId() const { return edges.size()-1; }98 int maxId(Edge = INVALID) const { return edges.size()-1; } 100 99 101 100 Node tail(Edge e) const { return edges[e.n].tail; } … … 222 221 typedef AlterableGraphExtender<SmartGraphBase> AlterableSmartGraphBase; 223 222 typedef IterableGraphExtender<AlterableSmartGraphBase> IterableSmartGraphBase; 224 typedef IdMappableGraphExtender<IterableSmartGraphBase> IdMappableSmartGraphBase; 225 typedef DefaultMappableGraphExtender<IdMappableSmartGraphBase> MappableSmartGraphBase; 223 typedef DefaultMappableGraphExtender<IterableSmartGraphBase> MappableSmartGraphBase; 226 224 typedef ExtendableGraphExtender<MappableSmartGraphBase> ExtendableSmartGraphBase; 227 225 typedef ClearableGraphExtender<ExtendableSmartGraphBase> ClearableSmartGraphBase; … … 240 238 /// 241 239 ///\author Alpar Juttner 242 class SmartGraph : public ClearableSmartGraphBase {240 class SmartGraph : public ClearableSmartGraphBase { 243 241 public: 244 242 /// Finds an edge between two nodes.
Note: See TracChangeset
for help on using the changeset viewer.