change comment loc

src/binder/bind/bind_graph_pattern.cpp

@@ -27,10 +27,10 @@ Binder::bindGraphPattern(const std::vector<std::unique_ptr<PatternElement>>& gra
     return std::make_pair(std::move(queryGraphCollection), std::move(propertyCollection));
 }
 
+// For undirected pattern (A)-[R]-(B), we need to match R in both FWD and BWD direction.
+// Since computation always starts from one node, we need to rewrite the node table names to be
+// the union of both node table names, i.e. (A|B)-[R]-(A|B)
 void static rewriteNodeTableNameForUndirectedRel(const PatternElement& patternElement) {
-    // For undirected pattern (A)-[R]-(B), we need to match R in both FWD and BWD direction.
-    // Since computation always starts from one node, we need to rewrite the node table names to be
-    // the union of both node table names, i.e. (A|B)-[R]-(A|B)
     auto leftNode = patternElement.getFirstNodePattern();
     for (auto i = 0u; i < patternElement.getNumPatternElementChains(); ++i) {
         auto patternElementChain = patternElement.getPatternElementChain(i);