Skip to content

Ranlot/shortest-paths-algos-neo4j

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

22 Commits
 
 
 
 
 
 
 
 

Repository files navigation

shortest-paths-algos-neo4j

Abstract

The purpose of this project is to provide a very basic introduction into the world of graph databases / analytics using the popular Neo4j as an example.

The main class of the project is Main.ShortestPath.java. We create a network of cities.

Web UI

You can load the content of the database created by the Main.ShortestPath::fillDB method to the Neo4j web server simply by pointing the database location to $ROOT_OF_REPOSITORY/$DB_PATH when starting the UI. (In our case $DB_PATH is connectedCitiesDB/).

It is then possible to get a basic visualization of the entire graph connecting all the cities together by executing the basic MATCH (n) RETURN n Cypher query.

About

First steps into graph algorithms using Neo4j

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages