Algorithm (no code) for Dijkstra (a Graph Algorithm)

[deepansha-singh]

Important:

Before you start your work on this issue, make sure you go through the README.md and Contribution Guidelines.md

File structure:

1. Create the Graph Algorithms directory.
2. Create the Dijkstra directory in the Heap Sort directory.
3. Create the file Algorithm.md.

Here's how the final structure should look like:

• Graph Algorithms
  • Dijkstra
    • Algorithm.md

Please follow the same naming conventions as mentioned in this comment.

Before you create a pull request, if you observe that the required folders have already been created, then please refrain from creating a new one, make some changes in your forked repository so that it matches with the current one and there are no conflicts.

Note that all PRs are being checked for plagiarism, please refrain from indulging in any crooked means, we trust you!

We thank you for your contribution and time and we hope that you enjoy contributing to open source.

[adithyaakrishna]

Can I take this up? 👀

[deepansha-singh]

Assigned to @adithyaakrishna No more contributors are needed at the moment.

[adithyaakrishna]

@deepansha-singh I needed some clarification, should I just create a empty file? Also according to the folder structure, it says

• Graph Algorithms > Heap Sort > Dijkstra > Algorithm.md

This is the correct one right?

[Taneesha-creates]

Hello @adithyaakrishna, apologies for the delay, as well as the issue with the description.

To answer your question, no, that is not the correct file path. Here is the revised file path:

• Graph Algorithms
  • Dijkstra - Algorithm.md - C++ - Java

The Algorithm.md file should be directly in the Dijkstra directory. All these directories exist currently, and none need to be created. Just create the markdown file.

Thank you for your patience, have a good day!