Module $5-(2024$FA$-$CSCI$-3015-01)$ Data Structures & Algorithms

empire.edu$/$d$2$I$/$le$/$content$/1577999/$Home$?$itemldentifier$=$D$2$L$.$LE$.$Content.ContentObject.ModuleCO$-36878592$

M$5$ Written Assignment: Researching Graph Algorithms

B$.$ Assignment

These chapter exercises will reinforce DS & A concepts$/$skills$.$

Choose three $(3)$ of the following Graph Algorithms. Explain each of them you select in detail giving an example of where you might use them in practice.

Depth First Search

Breadth First Search

Depth First Traversal

Breadth First Traversal

Prim's Algorithm for Minimum Spanning Trees

Kruskal's Algorithm

Dijkstra's Algorithm

Include any sample code or examples as you see fit to explain your answers.

General Instructions for Written Assignments

Your written assignment needs to be $1-2$ pages in length, presented in a professional manner, include your name, course, the title of assignment, professor's name, date, task, and include a list of sources used. The Research and Library Tips page will help you properly cite sources using