lemon/full_graph.h
changeset 970 d216e1c8b3fa
parent 787 c2230649a493
equal deleted inserted replaced
10:5db1e45132ff 11:8423c30e2325
     1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
     1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
     2  *
     2  *
     3  * This file is a part of LEMON, a generic C++ optimization library.
     3  * This file is a part of LEMON, a generic C++ optimization library.
     4  *
     4  *
     5  * Copyright (C) 2003-2009
     5  * Copyright (C) 2003-2010
     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     8  *
     8  *
     9  * Permission to use, modify and distribute this software is granted
     9  * Permission to use, modify and distribute this software is granted
    10  * provided that this copyright notice appears in all copies. For
    10  * provided that this copyright notice appears in all copies. For
   201       Parent::notifier(Arc()).build();
   201       Parent::notifier(Arc()).build();
   202     }
   202     }
   203 
   203 
   204     /// \brief Returns the node with the given index.
   204     /// \brief Returns the node with the given index.
   205     ///
   205     ///
   206     /// Returns the node with the given index. Since this structure is 
   206     /// Returns the node with the given index. Since this structure is
   207     /// completely static, the nodes can be indexed with integers from
   207     /// completely static, the nodes can be indexed with integers from
   208     /// the range <tt>[0..nodeNum()-1]</tt>.
   208     /// the range <tt>[0..nodeNum()-1]</tt>.
   209     /// The index of a node is the same as its ID.
   209     /// The index of a node is the same as its ID.
   210     /// \sa index()
   210     /// \sa index()
   211     Node operator()(int ix) const { return Parent::operator()(ix); }
   211     Node operator()(int ix) const { return Parent::operator()(ix); }
   212 
   212 
   213     /// \brief Returns the index of the given node.
   213     /// \brief Returns the index of the given node.
   214     ///
   214     ///
   215     /// Returns the index of the given node. Since this structure is 
   215     /// Returns the index of the given node. Since this structure is
   216     /// completely static, the nodes can be indexed with integers from
   216     /// completely static, the nodes can be indexed with integers from
   217     /// the range <tt>[0..nodeNum()-1]</tt>.
   217     /// the range <tt>[0..nodeNum()-1]</tt>.
   218     /// The index of a node is the same as its ID.
   218     /// The index of a node is the same as its ID.
   219     /// \sa operator()()
   219     /// \sa operator()()
   220     static int index(const Node& node) { return Parent::index(node); }
   220     static int index(const Node& node) { return Parent::index(node); }
   580       Parent::notifier(Arc()).build();
   580       Parent::notifier(Arc()).build();
   581     }
   581     }
   582 
   582 
   583     /// \brief Returns the node with the given index.
   583     /// \brief Returns the node with the given index.
   584     ///
   584     ///
   585     /// Returns the node with the given index. Since this structure is 
   585     /// Returns the node with the given index. Since this structure is
   586     /// completely static, the nodes can be indexed with integers from
   586     /// completely static, the nodes can be indexed with integers from
   587     /// the range <tt>[0..nodeNum()-1]</tt>.
   587     /// the range <tt>[0..nodeNum()-1]</tt>.
   588     /// The index of a node is the same as its ID.
   588     /// The index of a node is the same as its ID.
   589     /// \sa index()
   589     /// \sa index()
   590     Node operator()(int ix) const { return Parent::operator()(ix); }
   590     Node operator()(int ix) const { return Parent::operator()(ix); }
   591 
   591 
   592     /// \brief Returns the index of the given node.
   592     /// \brief Returns the index of the given node.
   593     ///
   593     ///
   594     /// Returns the index of the given node. Since this structure is 
   594     /// Returns the index of the given node. Since this structure is
   595     /// completely static, the nodes can be indexed with integers from
   595     /// completely static, the nodes can be indexed with integers from
   596     /// the range <tt>[0..nodeNum()-1]</tt>.
   596     /// the range <tt>[0..nodeNum()-1]</tt>.
   597     /// The index of a node is the same as its ID.
   597     /// The index of a node is the same as its ID.
   598     /// \sa operator()()
   598     /// \sa operator()()
   599     static int index(const Node& node) { return Parent::index(node); }
   599     static int index(const Node& node) { return Parent::index(node); }