Explain the importance of one of the algorithms listed below to computer science. Each of these algorithms is really important to computer science.

Research Report Description
For this research paper you are going to look at a graph algorithm. Your goal is to understand why the algorithm was needed and how it works. You do not need to understand the implementation level details. You must be able to complete the algorithm in a pencil and paper example. For example, you should be able to draw a graph and simulate the algorithm running with just scrap paper.
Explain the importance of one of the algorithms listed below to computer science. Each of these algorithms is really important to computer science. Your main goal is to explain how the algorithm works. Your secondary goal is to explain why is was invented and what it is for. Your paper should be about 40% history/context and 60% about how the algorithm works. Make sure to give the computational complexity of the algorithm at some point in your paper.
You should answer all the questions listed in the Grading Rubric Below at some point in your paper. Do Not explicity list and answer the questions. You may use section headings if you wish. They should be covered as part of an overall cohesive story about the algorithm.
Depending on the algorithm you select, some questions may have shorter or longer answers. You should focus on the areas that make the most sense for your algorithm. Just make sure you at least note the answer to each question at some point.
You must make up an original example and use it to show how your algorithm works. Make your own graphs and use them to explain steps of the algorithm’s execution. You can draw them on paper and take pictures or use a drawing program. A great program for making graphs is https://graphviz.org
You can write your paper in anything you wish. You must meet the following formatting requirements.
Formatting
The paper should be no longer than 12 pages, not including pictures, bibliography and title. Follow the MLA format described at the links below. There is no minimum length.
Submit as a PDF file. You can generate it with any program you like.
Use MLA Format:
MLA Format
General Format Shortcut
Citation Basics
Drexel Academic Honesty Guidelines
Note that there is only a maximum page limit. Your grading will be based on how well you explain the concepts. An amazing 2 page paper could do better than a very confusing 12 page paper.
Grading Rubric
Task Points
Title/Author 1 point
References 5 points
Style/Good Formatting/Section Titles 4 points
Introduction 5 points
What is the history of the algorithm?
Did a specific person develop it? 10 points
Explain the problem the algorithm solves.
Why was it needed? 10 points
Describe relationship between the graph structure and it’s applications.
What could a node/edge/etc represent? 10 points
Describe how the algorithm works.
Use a combination of psuedocode code or real code in addition to text.
Do not provide only text descriptions. 25 points
Work through and example. Use text and images to explain what is happening. 25 points
Conclusion 5 points
Algorithm List
Pick any one of the below algorithms to write about.
Edmonds-Karp Algorithm
Dinic’s Algorithm
Johnson’s Algorithm (for shortest paths)
Hierholzer’s Algorithm
Tarjan’s Algorithm
Kosaraju’s Algorithm
A* (AKA A-Star)

Last Completed Projects