Comparative Study of Complexities of Breadth- First Search and Depth-First Search Algorithms using Software Complexity Measures

  • Akanmu T. A., Olabiyisi S. O., Omidiora E. O. , Oyeleye C. A. M
  • O O
  • A O
 et al. 
  • 2


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


In this study, two different software complexity measures were applied to breadth-first search and depth-first search algorithms. The intention is to study what kind of new information about the algorithm the complexity measures (Halstead’s volume and Cylomatic number) are able to give and to study which software complexity measure is the most useful one in algorithm comparison. The results clearly show that with respect to Program Volume, breadth-first search algorithm is best implemented in Pascal language while depth-first search is best implemented in C language. The values of Program Difficulty and Program Effort indicate that both the algorithms are best implemented in Pascal language. Cyclomatic number is the same for both algorithms when programmed in Visual BASIC (i.e. 6).

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Mabayoje M.a. and Babatunde a. O. Akanmu T. A., Olabiyisi S. O., Omidiora E. O. , Oyeleye C. A.

  • Omidiora E O

  • Oyeleye C A

  • Mabayoje M A

  • Babatunde a O

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free