1.1 --- a/src/include/skeletons/graph.h Mon May 03 14:43:49 2004 +0000
1.2 +++ b/src/include/skeletons/graph.h Mon May 03 17:06:38 2004 +0000
1.3 @@ -87,7 +87,7 @@
1.4 /// \sa Invalid for more details.
1.5 NodeIt(Invalid) {}
1.6 /// Sets the iterator to the first node of \c G.
1.7 - NodeIt(const GraphSkeleton &G) {}
1.8 + NodeIt(const GraphSkeleton &) {}
1.9 /// @warning The default constructor sets the iterator
1.10 /// to an undefined value.
1.11 NodeIt(const NodeIt &n) : Node(n) {}
1.12 @@ -134,7 +134,7 @@
1.13 /// node
1.14 ///@param n the node
1.15 ///@param G the graph
1.16 - OutEdgeIt(const GraphSkeleton & G, Node n) {}
1.17 + OutEdgeIt(const GraphSkeleton &, Node) {}
1.18 };
1.19
1.20 /// This iterator goes trough the incoming edges of a node.
1.21 @@ -285,10 +285,10 @@
1.22 typedef T ValueType;
1.23 typedef Node KeyType;
1.24
1.25 - NodeMap(const GraphSkeleton &G) {}
1.26 - NodeMap(const GraphSkeleton &G, T t) {}
1.27 + NodeMap(const GraphSkeleton &) {}
1.28 + NodeMap(const GraphSkeleton &, T) {}
1.29
1.30 - template<typename TT> NodeMap(const NodeMap<TT> &m) {}
1.31 + template<typename TT> NodeMap(const NodeMap<TT> &) {}
1.32
1.33 /// Sets the value of a node.
1.34
1.35 @@ -323,12 +323,12 @@
1.36 typedef T ValueType;
1.37 typedef Edge KeyType;
1.38
1.39 - EdgeMap(const GraphSkeleton &G) {}
1.40 - EdgeMap(const GraphSkeleton &G, T t) {}
1.41 + EdgeMap(const GraphSkeleton &) {}
1.42 + EdgeMap(const GraphSkeleton &, T ) {}
1.43
1.44 ///\todo It can copy between different types.
1.45 ///
1.46 - template<typename TT> EdgeMap(const EdgeMap<TT> &m) {}
1.47 + template<typename TT> EdgeMap(const EdgeMap<TT> &) {}
1.48
1.49 void set(Edge, T) {}
1.50 //T get(Edge) const {return *(T*)0;}