Context Navigation

Changeset 2006:00d59f733817 in lemon-0.x

Timestamp:

03/15/06 10:44:17 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2621

Message:

Spellcheck

Files:

-                      r1996
+                      r2006
 operations, these together satisfy the everyday requirements.
 In the case of graph strutures, different operations are needed which do
 not alter the physical graph, but gives an other view. If some nodes or
+not alter the physical graph, but gives another view. If some nodes or
 edges have to be hidden or the reverse oriented graph have to be used, then
 this is the case. It also may happen that in a flow implemenation
 the residual graph can be accessed by an other algorithm, or a node-set
 is to be shrunk for an other algorithm.
+the residual graph can be accessed by another algorithm, or a node-set
+is to be shrunk for another algorithm.
 LEMON also provides a variety of graphs for these requirements called
 \ref graph_adaptors "graph adaptors". Adaptors cannot be used alone but only

r1999	r2006
45	45	/// edges. If we want to check on every indicing if the map contains
46	46	/// the current indicing key that cause a drawback in the performance
47		/// in the library. We use an other solution we notify all maps about
	47	/// in the library. We use another solution we notify all maps about
48	48	/// an alteration in the graph, which cause only drawback on the
49	49	/// alteration of the graph.

-                      r2002
+                      r2006
   /// \brief Class to copy a graph.
   ///
   /// Class to copy a graph to an other graph (duplicate a graph). The
+  /// Class to copy a graph to another graph (duplicate a graph). The
   /// simplest way of using it is through the \c copyGraph() function.
   template <typename Target, typename Source>
 …
   };
   /// \brief Copy a graph to an other graph.
   ///
   /// Copy a graph to an other graph.
+  /// \brief Copy a graph to another graph.
+  ///
+  /// Copy a graph to another graph.
   /// The usage of the function:
   ///
 …
   /// \brief Class to copy an undirected graph.
   ///
   /// Class to copy an undirected graph to an other graph (duplicate a graph).
+  /// Class to copy an undirected graph to another graph (duplicate a graph).
   /// The simplest way of using it is through the \c copyUGraph() function.
   template <typename Target, typename Source>
 …
   };
   /// \brief Copy a graph to an other graph.
   ///
   /// Copy a graph to an other graph.
+  /// \brief Copy a graph to another graph.
+  ///
+  /// Copy a graph to another graph.
   /// The usage of the function:
   ///

-                      r1990
+                      r2006
   /// \ingroup semi_adaptors
   ///
   /// \brief Graph which uses a subset of an other graph's nodes and edges.
+  /// \brief Graph which uses a subset of another graph's nodes and edges.
   ///
   /// Graph which uses a subset of an other graph's nodes and edges. This class
+  /// Graph which uses a subset of another graph's nodes and edges. This class
   /// is an alternative to the SubGraphAdaptor which is created for the
   /// same reason. The main difference between the two class that it
 …
   /// \ingroup semi_adaptors
   ///
   /// \brief Graph which uses a subset of an other graph's edges.
+  /// \brief Graph which uses a subset of another graph's edges.
   ///
   /// Graph which uses a subset of an other graph's edges. This class
+  /// Graph which uses a subset of another graph's edges. This class
   /// is an alternative to the EdgeSubGraphAdaptor which is created for the
   /// same reason. The main difference between the two class that it

r2004	r2006
430	430
431	431	/**
432		* \brief Moves the given element to an other component.
	432	* \brief Moves the given element to another component.
433	433	*
434	434	* This method moves the element \e a from its component

r1999	r2006
401	401	// }
402	402
403		///Increments a bounding box with an other bounding box
	403	///Increments a bounding box with another bounding box
404	404	BoundingBox& add(const BoundingBox &u){
405	405	if ( !u.empty() ){

r1956	r2006
79	79	doboz2.add(doboz1);
80	80	check(doboz2.inside(seged),
81		"It should be inside. Incremented a box with an ~~other~~.");
	81	"It should be inside. Incremented a box with another one.");
82	82	}

Note: See TracChangeset for help on using the changeset viewer.