Recall the algorithm for shortest paths in an unweighted graph. We provide it below, as given in the course notes.

Analyse this algorithm and provide: Its worst-case time complexity, Its auxiliary space complexity (excluding the input). Assume the graph G is stored as an adjacency matrix . Make no assumption on the edge density of the graph. Select one worst-case time complexity and one auxiliary space complexity from the list below. Two correct answers and zero incorrect answers are required to pass this question.

Question

Recall the algorithm for shortest paths in an unweighted graph. We provide it below, as given in the course notes.

Analyse this algorithm and provide: Its worst-case time complexity, Its auxiliary space complexity (excluding the input). Assume the graph   G  is stored as an  adjacency matrix . Make no assumption on the edge density of the graph. Select one worst-case time complexity and one auxiliary space complexity from the list below. Two correct answers and zero incorrect answers are required to pass this question.

Answer

The auxiliary space complexity is   	heta(|E|) .

Answer

The worst-case time complexity is   	heta(|V|^2) .

Answer

The auxiliary space complexity is   	heta(|E|^2) .

Answer

The auxiliary space complexity is   	heta(|V|+|E|) .

Answer

The worst-case time complexity is   	heta(|V| + |E|) .

Answer

The auxiliary space complexity is   	heta(|V|) .

Answer

The worst-case time complexity is   	heta(|V||E|) .

Answer

The worst-case time complexity is   	heta(|V|) .

Answer

The worst-case time complexity is   	heta(|V|^3) .

Answer

The auxiliary space complexity is   	heta(|V|^2+|E|) .

Answer

The worst-case time complexity is   	heta(|E|^2) .

Answer

The worst-case time complexity is   	heta(|E|^3) .

Answer

The worst-case time complexity is   	heta(|E|\log(|E|)) .

Answer

The worst-case time complexity is   	heta(|E|) .

Answer

The auxiliary space complexity is   	heta(|V|^2) .

Answer

The worst-case time complexity is   	heta(|V|\log(|V|)) .

Crowdly

Recall the algorithm for shortest paths in an unweighted graph. We provide it be...

Want instant access to all verified answers on learning.monash.edu?