What is Fulkerson algorithm? Find the maximal flow of the following network using Fulkerson algorithm [All steps should be clear with explantion]. 3. 2

Given N cities represented as vertices V₁, V2, un on an undirected graph (i.e., each edge can be traversed in both directions). The graph is fully-connected where the edge eij connecting any two vertices vį and vj is the straight-line distance between these two cities. We want to search for the shortest path from v₁ (the source) to VN (the destination). ... Assume that all edges have different values, and €₁,7 has the largest value among the edges. That is, the source and destination have the largest straight-line distance. Compare the lists of explored vertices when we run the uniform-cost search and the A* search for this problem. Hint: The straight-line distance is the shortest path between any two cities. If you do not know how to start, try to run the algorithms by hand on some small cases first; but remember to make sure your graphs satisfy the conditions in the question.

Write the PYTHON programming to solve with breadth-first search and build node-arcs with python code for the attached problem:

5.04-3. Bellman Ford Algorithm - a change in DV (1, part 3).  Consider the network below, and suppose that at t=0, the link between nodes g and h goes down. And so at t=0, nodes g and h recompute their DVs.  Following this recomputation, to which nodes will h send its new distance vector?  (Note: to answer this question, you’ll need to know some of the DV entries at g and h at t=0, but hopefully they’ll be obvious by inspection).