29 août 20193 août 2020 Bastien Pasdeloup The complexity of an algorithm is a measure of the... maximum number of elementary operations that are needed for its execution, as a function of the size of the input. minimum number of elementary operations that are needed for its execution, as a function of the size of the input. average number of elementary operations that are needed for its execution, as a function of the size of the input. The big-O notation (or asymptotical behavior) lets us drop... constants and low-order terms because they are too difficult to calculate precisely. the mic. constants and low-order terms because they do not matter when the problem size becomes large enough. The complexity of the BFS algorithm is... O(|E|), where E is the set of edges of the graph. O(|V|), where V is the set of vertices of the graph. O(|V|.|E|), where V is the set of vertices, and E is the set of edges of the graph. Time is Up!
