Fix path search: lower BFS bound to 1 so adjacent nodes return a path

Memgraph's BFS returns only the single shortest path, so a lower bound
of 2 made the query return nothing whenever the two nodes were directly
connected (it found the 1-hop shortest path, saw it was below the floor,
and gave up instead of searching for a longer alternative). Lowering the
bound to 1 restores the pre-Memgraph-migration behavior of returning the
shortest path whenever one of length <= 10 exists.

Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com>

Author: JDRomano2

web/packages/api/models/paths.js

@@ -16,10 +16,13 @@ const findPathByIds = function findPathByIds(session, fromId, toId) {
     });
   }
 
-  // Memgraph supports algo.shortestPath via openCypher's MATCH with shortest;
-  // here we use a length-bounded variable-length pattern and ORDER BY length(p).
+  // Memgraph's BFS returns the single shortest path between the anchored
+  // endpoints. The lower bound must be 1: a floor of 2 makes BFS return
+  // nothing whenever the two nodes are directly connected (it finds the
+  // 1-hop shortest path, sees it is below the floor, and gives up rather
+  // than searching for a longer alternative).
   const query = [
-    'MATCH p = (n)-[*BFS 2..10]-(m)',
+    'MATCH p = (n)-[*BFS 1..10]-(m)',
     'WHERE id(n) = $from AND id(m) = $to',
     'RETURN p',
     'ORDER BY size(relationships(p)) ASC',