Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Java Programming: Implementing Graph Databases and Shortest Path Algorithms, Transcriptions of Mathematics

Mathematics

A java programming project focused on working with graph databases and implementing dijkstra's algorithm to find the shortest path between nodes in a weighted graph. The project involves proposing java code to create a graph in neo4j, a popular graph database management system, and then applying dijkstra's algorithm to find the shortest path between nodes in the graph. Three key questions that can be answered by studying this project, and it is likely to be useful for university students, particularly those studying computer science, data structures, and algorithms. The document could be used as study notes, lecture notes, or even as a basis for an assignment or university essay.

Typology: Transcriptions

2020/2021

Uploaded on 12/03/2023

mohamed-ferri
mohamed-ferri 🇲🇦

3 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
JAVA PROGRAMMING
Mr Ziyati
Septembre 2023
JAVA PROJECT
Based on this Graph database.
Questions
1. Propose a Java code to create this Graph in Neo4j
2. Try to apply (Dijkstra’s algorithm) for finding the shortest path between nodes (Blue
one) in a weighted graph , with Java language.
3. Presentation must be done to describe the solution and code must be send to
([email protected])
1

Partial preview of the text

Download Java Programming: Implementing Graph Databases and Shortest Path Algorithms and more Transcriptions Mathematics in PDF only on Docsity!

JAVA PROGRAMMING

Mr Ziyati Septembre 2023

JAVA PROJECT

Based on this Graph database.

Questions

  1. Propose a Java code to create this Graph in Neo4j
  2. Try to apply (Dijkstra’s algorithm) for finding the shortest path between nodes (Blue one) in a weighted graph , with Java language.
  3. Presentation must be done to describe the solution and code must be send to ([email protected])

1