Move comments

lib/Graph/include/Graph/Forest.hpp

@@ -78,15 +78,19 @@ class Forest : public Graph<NodeT, EdgeT>
 
         if (edgesToRoots.empty()) {
             if (edgesToLeafs.empty()) {
-                return NodeType::Orphan; // Both empty
+                // Both empty
+                return NodeType::Orphan;
             } else {
-                return NodeType::Root; // No connections down, has connections up
+                // No connections down, has connections up
+                return NodeType::Root;
             }
         } else {
             if (edgesToLeafs.empty()) {
-                return NodeType::EndLeaf; // Has connections down, no connections up
+                // Has connections down, no connections up
+                return NodeType::EndLeaf;
             } else {
-                return NodeType::MiddleLeaf; // Has both connections, up and down
+                // Has both connections, up and down
+                return NodeType::MiddleLeaf;
             }
         }
     }