Write a function ConnectedComponent (G,v) which takes as in- put a dictionary representing a graph G, and one of its vertices v, and returns a set of nodes representing the connected com- ponent of v, implementing the method given in the notes. Hint: Create and update lists called visitednodes repres- enting previously visited nodes, latestnodes representing the most recently visited nodes, and newnodes representing nodes neighbouring those in latestnodes and not included in either of the previous categories.

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter17: Linked Lists
Section: Chapter Questions
Problem 18PE
icon
Related questions
Question

use python code

Write a function ConnectedComponent (G,v) which takes as in-
put a dictionary representing a graph G, and one of its vertices
v, and returns a set of nodes representing the connected com-
ponent of v, implementing the method given in the notes.
Hint: Create and update lists called visitednodes repres-
enting previously visited nodes, latestnodes representing the
most recently visited nodes, and newnodes representing nodes
neighbouring those in latestnodes and not included in either
of the previous categories.
Transcribed Image Text:Write a function ConnectedComponent (G,v) which takes as in- put a dictionary representing a graph G, and one of its vertices v, and returns a set of nodes representing the connected com- ponent of v, implementing the method given in the notes. Hint: Create and update lists called visitednodes repres- enting previously visited nodes, latestnodes representing the most recently visited nodes, and newnodes representing nodes neighbouring those in latestnodes and not included in either of the previous categories.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning