3.5 Breadth First Seasrch (BFS)


  • Time and Space complexity

  • Branching factor b

  • Depth d

  • If solution is a level d nodes expanded will be:
    	1 + b + b2 + b3 + ... + bd
    
  • For b=10, 1000 nodes/sec, and 100 bytes/node

    Depth

    Nodes

    Time

    Memory

    0

    1

    1 millisecond

    100 bytes

    2

    111

    1 second

    11 kilobytes

    4

    11,111

    11 seconds

    1 megabyte

    6

    106

    18 minutes

    111 megabytes

    8

    108

    31 hours

    11 gigabytes

    10

    1010

    128 days

    1 terabyte

    12

    1012

    35 years

    111 terabytes

    14

    1014

    3500 years

    11,111 terabytes


[MAIN PAGE] [PREVIOUS PAGE] [NEXT PAGE]
RMiT Copyright © 1999. Department of Computer Science, RMIT University.
Last Modified: 20th June, 1999.