equal
deleted
inserted
replaced
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 |
184 /// |
184 /// |
185 ///\brief A smart directed graph class. |
185 ///\brief A smart directed graph class. |
186 /// |
186 /// |
187 ///\ref SmartDigraph is a simple and fast digraph implementation. |
187 ///\ref SmartDigraph is a simple and fast digraph implementation. |
188 ///It is also quite memory efficient but at the price |
188 ///It is also quite memory efficient but at the price |
189 ///that it does not support node and arc deletion |
189 ///that it does not support node and arc deletion |
190 ///(except for the Snapshot feature). |
190 ///(except for the Snapshot feature). |
191 /// |
191 /// |
192 ///This type fully conforms to the \ref concepts::Digraph "Digraph concept" |
192 ///This type fully conforms to the \ref concepts::Digraph "Digraph concept" |
193 ///and it also provides some additional functionalities. |
193 ///and it also provides some additional functionalities. |
194 ///Most of its member functions and nested classes are documented |
194 ///Most of its member functions and nested classes are documented |
333 /// |
333 /// |
334 ///The newly added nodes and arcs can be removed using the |
334 ///The newly added nodes and arcs can be removed using the |
335 ///restore() function. This is the only way for deleting nodes and/or |
335 ///restore() function. This is the only way for deleting nodes and/or |
336 ///arcs from a SmartDigraph structure. |
336 ///arcs from a SmartDigraph structure. |
337 /// |
337 /// |
338 ///\note After a state is restored, you cannot restore a later state, |
338 ///\note After a state is restored, you cannot restore a later state, |
339 ///i.e. you cannot add the removed nodes and arcs again using |
339 ///i.e. you cannot add the removed nodes and arcs again using |
340 ///another Snapshot instance. |
340 ///another Snapshot instance. |
341 /// |
341 /// |
342 ///\warning Node splitting cannot be restored. |
342 ///\warning Node splitting cannot be restored. |
343 ///\warning The validity of the snapshot is not stored due to |
343 ///\warning The validity of the snapshot is not stored due to |
612 /// |
612 /// |
613 /// \brief A smart undirected graph class. |
613 /// \brief A smart undirected graph class. |
614 /// |
614 /// |
615 /// \ref SmartGraph is a simple and fast graph implementation. |
615 /// \ref SmartGraph is a simple and fast graph implementation. |
616 /// It is also quite memory efficient but at the price |
616 /// It is also quite memory efficient but at the price |
617 /// that it does not support node and edge deletion |
617 /// that it does not support node and edge deletion |
618 /// (except for the Snapshot feature). |
618 /// (except for the Snapshot feature). |
619 /// |
619 /// |
620 /// This type fully conforms to the \ref concepts::Graph "Graph concept" |
620 /// This type fully conforms to the \ref concepts::Graph "Graph concept" |
621 /// and it also provides some additional functionalities. |
621 /// and it also provides some additional functionalities. |
622 /// Most of its member functions and nested classes are documented |
622 /// Most of its member functions and nested classes are documented |
759 /// |
759 /// |
760 ///The newly added nodes and edges can be removed using the |
760 ///The newly added nodes and edges can be removed using the |
761 ///restore() function. This is the only way for deleting nodes and/or |
761 ///restore() function. This is the only way for deleting nodes and/or |
762 ///edges from a SmartGraph structure. |
762 ///edges from a SmartGraph structure. |
763 /// |
763 /// |
764 ///\note After a state is restored, you cannot restore a later state, |
764 ///\note After a state is restored, you cannot restore a later state, |
765 ///i.e. you cannot add the removed nodes and edges again using |
765 ///i.e. you cannot add the removed nodes and edges again using |
766 ///another Snapshot instance. |
766 ///another Snapshot instance. |
767 /// |
767 /// |
768 ///\warning The validity of the snapshot is not stored due to |
768 ///\warning The validity of the snapshot is not stored due to |
769 ///performance reasons. If you do not use the snapshot correctly, |
769 ///performance reasons. If you do not use the snapshot correctly, |