Changeset 503:769f31e9f7b0 in lemon0.x for src/include/skeletons/graph.h
 Timestamp:
 05/03/04 09:27:29 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@663
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/include/skeletons/graph.h
r463 r503 1 1 // * c++ * 2 #ifndef HUGO_ GRAPH_H3 #define HUGO_ GRAPH_H2 #ifndef HUGO_SKELETON_GRAPH_H 3 #define HUGO_SKELETON_GRAPH_H 4 4 5 5 ///\file … … 59 59 /// Two iterators are equal if and only if they point to the 60 60 /// same object or both are invalid. 61 bool operator==(Node n) const { return true; }61 bool operator==(Node) const { return true; } 62 62 63 63 /// \sa \ref operator==(Node n) 64 64 /// 65 bool operator!=(Node n) const { return true; }66 67 bool operator<(Node n) const { return true; }65 bool operator!=(Node) const { return true; } 66 67 bool operator<(Node) const { return true; } 68 68 }; 69 69 … … 91 91 /// @warning The default constructor sets the iterator 92 92 /// to an undefined value. 93 NodeIt(const NodeIt & ) {}93 NodeIt(const NodeIt &n) : Node(n) {} 94 94 }; 95 95 … … 105 105 /// Two iterators are equal if and only if they point to the 106 106 /// same object or both are invalid. 107 bool operator==(Edge n) const { return true; }108 bool operator!=(Edge n) const { return true; }109 bool operator<(Edge n) const { return true; }107 bool operator==(Edge) const { return true; } 108 bool operator!=(Edge) const { return true; } 109 bool operator<(Edge) const { return true; } 110 110 }; 111 111 … … 188 188 189 189 /// The first incoming edge. 190 InEdgeIt &first(InEdgeIt &i, Node n) const { return i;}190 InEdgeIt &first(InEdgeIt &i, Node) const { return i;} 191 191 /// The first outgoing edge. 192 OutEdgeIt &first(OutEdgeIt &i, Node n) const { return i;}192 OutEdgeIt &first(OutEdgeIt &i, Node) const { return i;} 193 193 // SymEdgeIt &first(SymEdgeIt &, Node) const { return i;} 194 194 /// The first edge of the Graph. … … 259 259 ///and head node \c head. 260 260 ///\return the new edge. 261 Edge addEdge(Node tail, Node head) { return INVALID;}261 Edge addEdge(Node, Node) { return INVALID;} 262 262 263 263 /// Resets the graph. … … 295 295 /// Sets the value associated with node \c i to the value \c t. 296 296 /// 297 void set(Node i, T t) {}298 // /Gets the value of a node.299 T get(Node i) const {return *(T*)0;} //FIXME: Is it necessary300 T &operator[](Node i) {return *(T*)0;}301 const T &operator[](Node i) const {return *(T*)0;}297 void set(Node, T) {} 298 // Gets the value of a node. 299 //T get(Node i) const {return *(T*)0;} //FIXME: Is it necessary? 300 T &operator[](Node) {return *(T*)0;} 301 const T &operator[](Node) const {return *(T*)0;} 302 302 303 303 /// Updates the map if the graph has been changed … … 327 327 EdgeMap(const GraphSkeleton &G, T t) {} 328 328 329 void set(Edge i, T t) {} 330 T get(Edge i) const {return *(T*)0;} 331 T &operator[](Edge i) {return *(T*)0;} 329 ///\todo It can copy between different types. 330 /// 331 template<typename TT> EdgeMap(const EdgeMap<TT> &m) {} 332 333 void set(Edge, T) {} 334 //T get(Edge) const {return *(T*)0;} 335 T &operator[](Edge) {return *(T*)0;} 336 const T &operator[](Edge) const {return *(T*)0;} 332 337 333 338 void update() {} … … 392 397 // } 393 398 394 #endif // HUGO_ GRAPH_H399 #endif // HUGO_SKELETON_GRAPH_H
Note: See TracChangeset
for help on using the changeset viewer.