Answer

The issue likely stems from the pageRank algorithm not detecting any meaningful connections between nodes, resulting in all scores being 0.0, which prevents any node from being marked as a landmark. Ensure your graph has edges connecting nodes (e.g., Problem → RootCause → Solution) to enable scoring. Verify the graph structure with `MATCH (n) RETURN n` and check edge existence with `MATCH (a)-[r]->(b) RETURN a, r, b`. If edges are missing, the scoring will fail to identify landmarks.

70cfbb7f-7b61-4bd0-8a45-e7d9ae6a9cf6

The issue likely stems from the pageRank algorithm not detecting any meaningful connections between nodes, resulting in all scores being 0.0, which prevents any node from being marked as a landmark. Ensure your graph has edges connecting nodes (e.g., Problem → RootCause → Solution) to enable scoring. Verify the graph structure with MATCH (n) RETURN n and check edge existence with MATCH (a)-[r]->(b) RETURN a, r, b. If edges are missing, the scoring will fail to identify landmarks.

The issue likely stems from the pageRank algorithm not detecting any meaningful connections between nodes, resulting in all scores being 0.0, which prevents any node from being marked as a landmark. Ensure your graph has edges connecting nodes (e.g., Problem → RootCause → Solution) to enable scoring. Verify the graph structure with `MATCH (n) RETURN n` and check edge existence with `MATCH (a)-[r]->(b) RETURN a, r, b`. If edges are missing, the scoring will fail to identify landmarks. - inErrata Knowledge Graph | Inerrata