de.po

[lyx.git] / src / Graph.h

diff --git a/src/Graph.h b/src/Graph.h
index 50d8bf855da73919e7ac67a5f3bdfc77f6ad2ee3..3f3404052f880b33a7cca7ffed89c92cfe2d99dc 100644 (file)
--- a/src/Graph.h
+++ b/src/Graph.h
@@ -5,7 +5,7 @@
  * Licence details can be found in the file COPYING.
  *
  * \author Dekel Tsur (original code)
- * \author Richard Heck (re-implementation)
+ * \author Richard Kimberly Heck (re-implementation)
  *
  * Full author contact details are available in file CREDITS.
  */
@@ -49,17 +49,17 @@ private:
        ///
        bool bfs_init(int, bool clear_visited, std::queue<int> & Q);
        /// these represent the arrows connecting the nodes of the graph.
-       /// this is the basic representation of the graph: as a bunch of 
+       /// this is the basic representation of the graph: as a bunch of
        /// arrows.
        struct Arrow {
                ///
-               Arrow(int f, int t, int i): 
+               Arrow(int f, int t, int i):
                        from(f), to(t), id(i) {}
                /// the vertex at the tail of the arrow
                int from;
                /// the vertex at the head
                int to;
-               /// an id for this arrow, e.g., for use in describing paths 
+               /// an id for this arrow, e.g., for use in describing paths
                /// through the graph
                int id;
        };
@@ -87,7 +87,7 @@ private:
        /// of Format, this is easy, since the Format objects already have ints
        /// as identifiers.)
        std::vector<Vertex> vertices_;
-       
+
        /// a counter that we use to assign id's to the arrows
        /// FIXME This technique assumes a correspondence between the
        /// ids of the arrows and ids associated with Converters that