query: Non-shortest path traces
positive_passages.docid: 20885
positive_passages.text: Purpose of "wave shaped" PCB traces
negative_passages.docid: 50935
negative_passages.text: Total number paths between two nodes in a complete graph
negative_passages.docid: 45733
negative_passages.text: How to calculate the shortest path between two points in a grid
negative_passages.docid: 65552
negative_passages.text: Vertex descendants subgraph
negative_passages.docid: 150786
negative_passages.text: Directed Graph Processing in Java
negative_passages.docid: 85104
negative_passages.text: Counting train stops using combinatorics
negative_passages.docid: 13468
negative_passages.text: When does open and connected imply path-connected?
negative_passages.docid: 89016
negative_passages.text: Google Maps Route Generation with Waypoints
negative_passages.docid: 130574
negative_passages.text: Distance metric for (infinite) lines in 3D
negative_passages.docid: 101033
negative_passages.text: Algorithm for procedureral 2D map with connected paths
negative_passages.docid: 125939
negative_passages.text: Find the shortest path in a graph which visits certain nodes
negative_passages.docid: 103456
negative_passages.text: Non-perpendicular hyperplane decision trees
negative_passages.docid: 88172
negative_passages.text: A* Pathfinding Finding One of Many Goals
negative_passages.docid: 37166
negative_passages.text: Cartographic techniques for symbolizing routing data
negative_passages.docid: 93986
negative_passages.text: Connectivity, Path Connectivity and Differentiability
negative_passages.docid: 53897
negative_passages.text: Finding all shortest paths between two vertices
negative_passages.docid: 148338
negative_passages.text: Getting relative links between two paths