Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.Learn Graph Class Implementation | What is BFS
Breadth First Search

bookGraph Class Implementation

In this course, we’ll use Graph implementation as class:


              
1234567891011121314

            
class Graph:
  def __init__(self, vertices):
    # init graph with its vertices
    self.graph = {v : [] for v in vertices}
   
  def addEdge(self, u, v):
    self.graph[u].append(v)
   
  def __str__(self):
    out = ""
    for vertex in self.graph:
      out += vertex + ":"+self.graph[vertex]
    return out
copy

This works for oriented graph. Main methods are implemented, and you’ll add some methods according to the next tasks.

Everything was clear?

How can we improve it?

Thanks for your feedback!

SectionΒ 1. ChapterΒ 2
single

single

Ask AI

expand

Ask AI

ChatGPT

Ask anything or try one of the suggested questions to begin our chat

Suggested prompts:

Summarize this chapter

Explain the code in file

Explain why file doesn't solve the task

close

Awesome!

Completion rate improved to 7.69

bookGraph Class Implementation

Swipe to show menu

In this course, we’ll use Graph implementation as class:


              
1234567891011121314

            
class Graph:
  def __init__(self, vertices):
    # init graph with its vertices
    self.graph = {v : [] for v in vertices}
   
  def addEdge(self, u, v):
    self.graph[u].append(v)
   
  def __str__(self):
    out = ""
    for vertex in self.graph:
      out += vertex + ":"+self.graph[vertex]
    return out
copy

This works for oriented graph. Main methods are implemented, and you’ll add some methods according to the next tasks.

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

close

Awesome!

Completion rate improved to 7.69
SectionΒ 1. ChapterΒ 2
single

single

some-alt