#Help On School Project: Want to know if idea is plausible

1 messages · Page 1 of 1 (latest)

sturdy wolf
#

*For context I recently learned algorithms in Graph Theory in AP Maths and have the idea Djikstra’s Algorithm in a java Project.

Im in my final year of highschool and we need to make any java project for the year which will make up 30% of the years IT mark. I have the idea to take a map of the city I live in (Durban, South Africa) and use Djikstras Algorithm to find the smallest distance between 2 points.

So far I have the code and the idea, but I would like to know if…
A - This project sounds easy enough to do and not something that would take lots of code

B - I am able to get a database of all the current streets and lengths of my city to connect to the algorithm.

Dm’s are open. If anyones curious we use the IEB marking system (its a south african system)

shy monolithBOT
#

<@&987246717831381062> please have a look, thanks.

#

Here is an AI assisted attempt to answer your question 🤖. Maybe it helps! In any case, a human is on the way 👍. To continue talking to the AI, you can use </chatgpt:1108714622413963314>.

#

al year of high school and for my final project, I want to create a Java program that uses Dijkstra's algorithm to find the shortest path between two points on a map. I have some experience with Java programming, but I'm not sure if this idea is feasible for my level of knowledge.

Dijkstra's algorithm is a popular algorithm used to find the shortest path between two nodes in a graph. It works by assigning tentative distances to all nodes and then iteratively updating them until the shortest path is found. This algorithm can be used in various applications, including finding the shortest route on a map.

Implementing Dijkstra's algorithm in Java requires understanding concepts such as graphs, nodes, edges, and data structures like priority queues or heaps. It also involves implementing algorithms for finding the minimum distance and updating distances.

If you have recently learned about algorithms in Graph Theory and have some experience with Java programming, it is definitely plausible for you to implement Dijkstra's algorithm in your final project. However, it may require additional research and learning to fully understand the algorithm and its implementation details.

Here are some steps you can follow to make your project more manageable:

#

  1. Understand Dijkstra's algorithm: Make sure you have a clear understanding of how Dijkstra's algorithm works and its implementation details. Review your class notes or consult online resources if needed.

  2. Plan your project: Break down your project into smaller tasks or milestones. This will help you stay organized and focused throughout the development process.

  3. Research existing implementations: Look for existing implementations of Dijkstra's algorithm in Java. Analyze their code structure and logic to get an idea of how it can be implemented effectively.

  4. Start with simple examples: Begin by implementing Dijkstra's algorithm on simple graphs or maps with few nodes and edges. This will help you understand the basic concepts before moving on to more complex scenarios.

  5. Test your implementation: Create test cases to verify the correctness of your implementation. Test it with different maps and scenarios to ensure it works as expected.

  6. Refine and optimize: Once your initial implementation is working correctly, you can focus on optimizing it for better performance or adding additional features if desired.

Remember, learning and implementing new algorithms can be challenging, but it is also a great opportunity to deepen your understanding of the subject. Take your time, ask for help when needed, and enjoy the process of creating your Java program using Dijkstra's algorithm. Good luck with your project!

slender lion
sturdy wolf
slender lion
#

How much time do know have?

sturdy wolf
#

Any ideas on existing resources of maps?

slender lion
sturdy wolf
slender lion
sturdy wolf
slender lion
sturdy wolf
slender lion
#

That's your problem then

#

But that doesn't seem too hard imo

#

and if you have time, you could implement other algos, or optimize it

sturdy wolf
#

Are there better algorithms then djikstra?

#

I think its better to stick with it cause it was taught to us in the ieb syllabus; im sure ill get bonus points or something if I applied it

sturdy wolf
#

Hopefully there is a way

#

I think this is it but idk how to implement it to java

#

And any ideas on how to check if the roads have lengths?

sturdy wolf
#

@slender lion how do I close this?

stark ravine
#

/help-thread close