algoorithms
ineed answer for 2 and 3Homework for graph algorithms (1) Do the Breadth-first Search for the following graph starting at source s. Step by step show FIFO queue Q (the vertices under processing), d[v) (the distance from each vertex v to s.) color[v] (color of each node [vD, and p[v] (the parent of each node v). s (Source (2) Do the Depth-first Search for the following graph. Step by step show: d[v] (first time stamp) v] (final
OR
OR