Scribd Logo
Upload

Welcome to Scribd!

  • 9 views

    Untitled

    Uploaded by

    Suraj Chauhan
    This document provides an implementation of depth-first search (DFS) using a recursive function to traverse an unweighted graph. The DFS function takes a visited set, graph dictionary, and starting node as arguments. It prints the current node, adds it to visited, and recursively calls DFS on unvisited neighbors before returning. The code includes a sample graph and calls DFS on it, printing the nodes in depth-first order.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Untitled

    Uploaded by

    Suraj Chauhan
    9 views1 page
    This document provides an implementation of depth-first search (DFS) using a recursive function to traverse an unweighted graph. The DFS function takes a visited set, graph dictionary, and starting node as arguments. It prints the current node, adds it to visited, and recursively calls DFS on unvisited neighbors before returning. The code includes a sample graph and calls DFS on it, printing the nodes in depth-first order.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides an implementation of depth-first search (DFS) using a recursive function to traverse an unweighted graph. The DFS function takes a visited set, graph dictionary, and starting node as arguments. It prints the current node, adds it to visited, and recursively calls DFS on unvisited neighbors before returning. The code includes a sample graph and calls DFS on it, printing the nodes in depth-first order.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    9 views1 page

    Untitled

    Uploaded by

    Suraj Chauhan
    This document provides an implementation of depth-first search (DFS) using a recursive function to traverse an unweighted graph. The DFS function takes a visited set, graph dictionary, and starting node as arguments. It prints the current node, adds it to visited, and recursively calls DFS on unvisited neighbors before returning. The code includes a sample graph and calls DFS on it, printing the nodes in depth-first order.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    # Write a program for DFS algorithm using uninformed search method

    visited = set()

    def dfs(visited, graph, node):

    if node not in visited:

    print(node, end = " ")

    visited.add(node)

    for neighbour in graph[node]:

    dfs(visited, graph, neighbour)

    graph2 = {

    '0' : ['1','9'],

    '1' : ['2'],

    '2' : ['0','3'],

    '9' : ['3'],

    '3' : ['3']

    print("\nFollowing is the depth-first search for dfs graph 2:")

    dfs(visited, graph2, '0')

    ##########################Output#######################

    # Following is the depth-first search for dfs graph 2:

    #01239

    You might also like