What happens when the value of k is 0 in the Floyd Warshall Algorithm? Options 1 intermediate vertex 0 intermediate vertex N intermediate vertices N-1 intermediate vertices

What procedure is being followed in Floyd Warshall Algorithm?Marks : 1Negative Marks : 0Answer hereTop downBottom upBig bangSandwich

What procedure is being followed in Floyd Warshall Algorithm?

Floyd-Warshall algorithm utilizes __________ to solve the all-pairs shortest paths problem on a directed graph in __________ time.

Which of the following pseudocode correctly represents the initialization step of the Warshall algorithm for finding the transitive closure of a graph?Marks : 1Negative Marks : 0Answer hereProcedure WarshallInit(Graph G):  For each vertex v in G:    For each vertex u in G:      If u is adjacent to v:        Set distance[u][v] to 1      Else:        Set distance[u][v] to 0Procedure WarshallInit(Graph G):  For each vertex u in G:    For each vertex v in G:      If u is adjacent to v:        Set distance[u][v] to 1      Else:        Set distance[u][v] to infinityProcedure WarshallInit(Graph G):  For each vertex v in G:    For each vertex u in G:      If u is adjacent to v:        Set distance[v][u] to 0      Else:        Set distance[v][u] to 0Procedure WarshallInit(Graph G):  For each vertex u in G:    For each vertex v in G:      If u is adjacent to v:        Set distance[v][u] to 1      Else:        Set distance[v][u] to infinity

Consider a directed graph with six vertices. The initial adjacency matrix is given below. After applying the Warshall algorithm, how many entries in the resulting adjacency matrix will be '1'?Initial Adjacency Matrix:  | 1 2 3 4 5 6----------------1 | 0 1 0 1 0 02 | 0 0 1 0 0 03 | 0 0 0 0 1 14 | 0 0 0 0 0 05 | 0 0 0 1 0 06 | 0 0 0 0 0 0