Describe the challenges you may face while completing the activities about Adjac


Describe
the challenges you may face while completing the activities about
Adjacency lists, Adjacency matrices, breadth-first search, depth-first
search, directed graphs, weighted graph and Dijkstra’s shortest path.
How do
recalling the definitions and concepts related to data structures
and algorithms help you complete the above activities?
How
will your understanding of these concepts and terms assist you in
your future courses and career?


Leave a Reply