Cypher for determining distance between points using shortest path

100%

Cypher for determining distance between points using shortest path

✓ Published0🌍 Public

Last edited Aug 14, 2014

Created on Aug 14, 2014

This example demonstrates how to calculate the distance between two points in a graph using Cypher's shortest path algorithm. The query first matches two nodes by their IDs, then applies `shortestpath` to find the minimal path between them. Using the `reduce` function, it iterates over the relationships in that path, summing the `distance` property of each relationship to return the total distance in meters. The visualization relies on the Neo4j graph database and its Cypher query language, with the underlying graph structure and relationship properties providing the data for the calculation.

AI-generated description

Similar vizzes

Loading thumbnail…

Gist adbe358483e7e878175e

This example visualizes a network of places connected by paths, with each link representing a reciprocal route and its distance. The visualization shows the graph structure using a force-directed layout, where nodes are positioned based on their connections. The code loads relational data from a CSV file using Cypher’s `LOAD CSV`, then merges bidirectional `Path` relationships between `Place` nodes. The rendering relies on the Neo4j graph model and likely uses D3.js’s `forceSimulation` to compute node positions and link distances, though the snippet focuses on data ingestion via Cypher rather than the display layer. The graph reveals clusters of tightly interconnected locations based on the distance metadata.

CCliffordAnderson

65% match

Loading thumbnail…

Cypher for Spatial

This example demonstrates the spatial capabilities of Neo4j’s Cypher query language by finding the nearest city to a given point in Germany. It shows how to combine geographic coordinates with graph traversal to return a ranked list of nearby cities, ordered by distance. The visualization uses `spatial.closest` from the Neo4j Spatial library, with a query that computes distances via the `distance()` function in kilometers. The accompanying data files include a GeoJSON point for the starting location and an exported CSV of city names with distances, while the code references adding a layer and populating it with cities from a Gist. The result is a straightforward map-based proximity search, rendered as a tabular list rather than a graphical map.

CCliffordAnderson

65% match

Loading thumbnail…

Cypher head and tail

The example visualizes the tail of a Cypher shortest path query, showing only the nodes and relationships that follow the final match in the path. It uses the Neo4j Cypher query language to match two named nodes, "Martha" and "Ted," compute the shortest path between them with `shortestPath`, and then return only the `tail(n)`—the nodes after the first—via the `tail` function. The rendering likely relies on a graph visualization library such as d3.forceSimulation to position nodes, while the query itself filters the displayed subset. The data source is a gist by CliffordAnderson, and the visualization emphasizes the truncated result set rather than the full path.

CCliffordAnderson

63% match

Loading thumbnail…

A Cypher examples to unwind and collect

This example demonstrates two Cypher queries that find the shortest path between two named nodes, “Daniel” and “Jerry,” in a Neo4j graph and then process the resulting path’s nodes. The first query, `unwind.cypher`, uses `nodes(s)` to extract the path’s vertices, `unwind` to iterate over them, and returns each node’s `name` property as a column. The second query, `collect.cypher`, chains `unwind` into `collect` to aggregate all names into a single list, then `head(m)` retrieves the first element. Both queries rely on Neo4j’s `shortestPath` function to compute the route.

CCliffordAnderson

63% match

Loading thumbnail…

Data wrangling for ArcGIS to Cypher

This example shows how raw tabular GIS data is wrangled into a node-and-edge format suitable for importing into a graph database like Neo4j via Cypher. It extracts distinct pairs of connected points from an ArcGIS feature table by computing start and stop coordinates from X/Y fields and their offsets, then filters out self-loops where start equals stop. The code uses the XQuery language with the `fn:distinct-values`, `fn:data`, and `string-join` functions to build a comma-separated list of connected node IDs and edge lengths. It explicitly demonstrates the data-cleaning step—removing duplicate or invalid connections—before the result is ready for Cypher’s `LOAD CSV` or `MERGE` commands.

CCliffordAnderson

61% match

Loading thumbnail…

Neovis.js Simple Example

This example visualizes the shortest path between two Berlin subway stations in a Neo4j graph database. It renders a force-directed network graph using Neovis.js, built on vis.js, showing station nodes sized by PageRank and colored by community, with line relationships thickened by weight. A Cypher query defines the path, and users can submit new queries or stabilize the layout. The code uses NeoVis.default, viz.render(), renderWithCypher(), and stabilize() to interact with the bolt:// server.

CCliffordAnderson

60% match

Loading thumbnail…

Test Network

The visualization displays a test network of paths between points, with lines representing connections and distances. The data originates from a CSV file with columns for start and end points, distances, path types, and metadata. The XQuery script fetches, parses, and deduplicates the records before rendering. This example highlights how network connectivity and edge attributes (e.g., distance, path type) can be mapped to visual encodings to explore spatial relationships and potential routing constraints.

CCliffordAnderson

56% match

Loading thumbnail…

Relations between map points

This visualization maps relationships between points, with edges colored to encode the distance between connected nodes. It uses a force-directed layout to arrange points, with line thickness and opacity revealing path lengths. The rendering combines D3’s `forceSimulation` for node positioning, Canvas `getImageData` for pixel-level styling, and `transition.attrTween` for smooth link animations. Data from a gist (rels.csv) supplies node coordinates and pairwise distances.

CCliffordAnderson

56% match