Describe how you would find the shortest path in a network using a Depth-First Search (DFS) or Breadth-First Search (BFS) approach.
