Scribd Logo
Upload

Welcome to Scribd!

  • 62 views

    BFS and FDS

    Uploaded by

    scribdsiv
    This document contains code for performing breadth-first search (BFS) and depth-first search (DFS) on a tree data structure. The BFS method uses a queue to iteratively dequeue nodes and enqueue their unvisited children. The DFS method uses a stack to recursively push nodes and pop their children. Both methods mark visited nodes, print nodes, and clear the visited property after traversal.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    BFS and FDS

    Uploaded by

    scribdsiv
    62 views1 page
    This document contains code for performing breadth-first search (BFS) and depth-first search (DFS) on a tree data structure. The BFS method uses a queue to iteratively dequeue nodes and enqueue their unvisited children. The DFS method uses a stack to recursively push nodes and pop their children. Both methods mark visited nodes, print nodes, and clear the visited property after traversal.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains code for performing breadth-first search (BFS) and depth-first search (DFS) on a tree data structure. The BFS method uses a queue to iteratively dequeue nodes and enqueue their unvisited children. The DFS method uses a stack to recursively push nodes and pop their children. Both methods mark visited nodes, print nodes, and clear the visited property after traversal.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    62 views1 page

    BFS and FDS

    Uploaded by

    scribdsiv
    This document contains code for performing breadth-first search (BFS) and depth-first search (DFS) on a tree data structure. The BFS method uses a queue to iteratively dequeue nodes and enqueue their unvisited children. The DFS method uses a stack to recursively push nodes and pop their children. Both methods mark visited nodes, print nodes, and clear the visited property after traversal.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 1

    public void bfs() { //BFS uses Queue data structure Queue q=new LinkedList(); q.add(this.rootNode); printNode(this.rootNode); rootNode.visited=true; while(!q.

    isEmpty()) { Node n=(Node)q.remove(); Node child=null; while((child=getUnvisitedChildNode(n))!=null) { child.visited=true; printNode(child); q.add(child); } } //Clear visited property of nodes clearNodes();

    public void dfs() { //DFS uses Stack data structure Stack s=new Stack(); s.push(this.rootNode); rootNode.visited=true; printNode(rootNode); while(!s.isEmpty()) { Node n=(Node)s.peek(); Node child=getUnvisitedChildNode(n); if(child!=null) { child.visited=true; printNode(child); s.push(child); } else { s.pop(); } } //Clear visited property of nodes clearNodes(); }

    You might also like