Thread: Help me about the Breadth-First-Search??

  1. #1
    Registered User
    Join Date
    Oct 2004

    Question Help me about the Breadth-First-Search??

    I dont know how to input the start-information of the tree like this:
    A-> B -> C - > D
    A-> E -> F
    B-> G
    C-> G -> H -> I
    D-> K
    Find the way from A to I by BFS
    What data structure i wish to use?? And how to declare it.
    Can you give me an example or a shortcut code?
    Thanks alot

  2. #2
    and the hat of int overfl Salem's Avatar
    Join Date
    Aug 2001
    The edge of the known universe
    If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
    If at first you don't succeed, try writing your phone number on the exam paper.

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Shortest Path Maze Solver (Breadth Search Help)
    By Raskalnikov in forum C Programming
    Replies: 5
    Last Post: 04-07-2009, 07:41 PM
  2. Using Breadth First Search
    By neandrake in forum C++ Programming
    Replies: 4
    Last Post: 05-06-2005, 05:13 PM
  3. Binary Search Trees Part III
    By Prelude in forum A Brief History of
    Replies: 16
    Last Post: 10-02-2004, 03:00 PM
  4. Request for comments
    By Prelude in forum A Brief History of
    Replies: 15
    Last Post: 01-02-2004, 10:33 AM