Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightRegarding implementation of Depth First Search using stacks, what is t...

Regarding implementation of Depth First Search using stacks, what is t...

  • Q. Regarding implementation of Depth First Search using stacks, what is the maximum distance between two nodes present in the stack? (considering each edge length 1)
  • filter_dramaExplanation
    Answer is : A
    None.

Discussion

    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1. Complete the given snippet of code for the adjacency list representation of a weighted directed graph.
  • filter_dramaExplanation
    Answer is : C
    None.
  • 2. Time Complexity of DFS is? (V
  • filter_dramaExplanation
    Answer is : A
    None.
  • 3. A connected graph T without any cycles is called ........
  • filter_dramaExplanation
    Answer is : A
    None.
  • 4. Which of the following properties does a simple graph not hold?
  • filter_dramaExplanation
    Answer is : A
    None.
  • 5. For the adjacency matrix of a directed graph the row sum is the _________ degree and the column sum is the ________ degree.
  • filter_dramaExplanation
    Answer is : B
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points