src/include/skeletons/graph.h
changeset 533 04eb0d9022c8
parent 503 769f31e9f7b0
equal deleted inserted replaced
6:88071c15d3f4 7:4100629a6210
    85 
    85 
    86       /// Initialize the iterator to be invalid
    86       /// Initialize the iterator to be invalid
    87       /// \sa Invalid for more details.
    87       /// \sa Invalid for more details.
    88       NodeIt(Invalid) {}
    88       NodeIt(Invalid) {}
    89       /// Sets the iterator to the first node of \c G.
    89       /// Sets the iterator to the first node of \c G.
    90       NodeIt(const GraphSkeleton &G) {}
    90       NodeIt(const GraphSkeleton &) {}
    91       /// @warning The default constructor sets the iterator
    91       /// @warning The default constructor sets the iterator
    92       /// to an undefined value.
    92       /// to an undefined value.
    93       NodeIt(const NodeIt &n) : Node(n) {}
    93       NodeIt(const NodeIt &n) : Node(n) {}
    94     };
    94     };
    95     
    95     
   132     
   132     
   133       /// This constructor set the iterator to the first outgoing edge of
   133       /// This constructor set the iterator to the first outgoing edge of
   134       /// node
   134       /// node
   135       ///@param n the node
   135       ///@param n the node
   136       ///@param G the graph
   136       ///@param G the graph
   137       OutEdgeIt(const GraphSkeleton & G, Node n) {}
   137       OutEdgeIt(const GraphSkeleton &, Node) {}
   138     };
   138     };
   139 
   139 
   140     /// This iterator goes trough the incoming edges of a node.
   140     /// This iterator goes trough the incoming edges of a node.
   141 
   141 
   142     /// This iterator goes trough the \e incoming edges of a certain node
   142     /// This iterator goes trough the \e incoming edges of a certain node
   283     {
   283     {
   284     public:
   284     public:
   285       typedef T ValueType;
   285       typedef T ValueType;
   286       typedef Node KeyType;
   286       typedef Node KeyType;
   287 
   287 
   288       NodeMap(const GraphSkeleton &G) {}
   288       NodeMap(const GraphSkeleton &) {}
   289       NodeMap(const GraphSkeleton &G, T t) {}
   289       NodeMap(const GraphSkeleton &, T) {}
   290 
   290 
   291       template<typename TT> NodeMap(const NodeMap<TT> &m) {}
   291       template<typename TT> NodeMap(const NodeMap<TT> &) {}
   292 
   292 
   293       /// Sets the value of a node.
   293       /// Sets the value of a node.
   294 
   294 
   295       /// Sets the value associated with node \c i to the value \c t.
   295       /// Sets the value associated with node \c i to the value \c t.
   296       ///
   296       ///
   321     {
   321     {
   322     public:
   322     public:
   323       typedef T ValueType;
   323       typedef T ValueType;
   324       typedef Edge KeyType;
   324       typedef Edge KeyType;
   325 
   325 
   326       EdgeMap(const GraphSkeleton &G) {}
   326       EdgeMap(const GraphSkeleton &) {}
   327       EdgeMap(const GraphSkeleton &G, T t) {}
   327       EdgeMap(const GraphSkeleton &, T ) {}
   328     
   328     
   329       ///\todo It can copy between different types.
   329       ///\todo It can copy between different types.
   330       ///
   330       ///
   331       template<typename TT> EdgeMap(const EdgeMap<TT> &m) {}
   331       template<typename TT> EdgeMap(const EdgeMap<TT> &) {}
   332 
   332 
   333       void set(Edge, T) {}
   333       void set(Edge, T) {}
   334       //T get(Edge) const {return *(T*)0;}
   334       //T get(Edge) const {return *(T*)0;}
   335       T &operator[](Edge) {return *(T*)0;}
   335       T &operator[](Edge) {return *(T*)0;}
   336       const T &operator[](Edge) const {return *(T*)0;}
   336       const T &operator[](Edge) const {return *(T*)0;}