## DEV Community

Bernice Waweru

Posted on • Updated on

# Graphs in Python

Graphs are data structures represented using nodes and edges.

Nodes are the data while the edges are the connections between nodes.

Neighbor nodes are nodes accessible through an edge.

Edges in directed graphs follow a given direction.

In undirected graphs, the edges between nodes are bidirectional.

Adjacency lists are useful in representing graphs in code.
The lists are similar to dictionaries with a key-value pair where the key is a node and the values are the neighbor nodes.

The image below demonstrates how we can represent an adjacency list as a graph.

• Note that every node appears in the adjacency list including those without neighbor nodes.

Given edges, we can create an adjacency list as follows.

Every pair in the edges list represents a connection between nodes, therefore in the adjacency list we include both elements as keys with each other as values.

We update the adjacency list based on the edges provided.
We can use the function below to create an adjacency list given edges in an undirected graph.

``````def createGraph(edges):
graph = {}
for edge in edges:
x,y = edge
if x not in graph:
graph[x] = []
if y not in graph:
graph[y] = []
graph[x].append(y)
graph[y].append(x)

return graph

edges = [['i','j'],['k','i'],['m','k'],['k','l'],['o','n']]

print(createGraph(edges))
``````

In this post we will go through two main concepts that are central to solving graph interview questions.

## Depth-First Traversal

In this approach we follow a node as far as we can before moving to the other neighbor. We explore the nodes following the edges as far as possible before changing directions.

We can achieve depth-first traversal using iteration or recursion.
It uses the stack data structure which follows the Last In First Out(LIFO) principle

### Iterative approach to print all nodes.

``````def depthFirst(graph,source):
stack = [source]
while stack:
current = stack.pop()
print(current)
for neighbor in graph[current]:
stack.append(neighbor)

graph = {
'a' : ['c','b'],
'b': ['d'],
'c': [ 'e'],
'd': ['f'],
'e': [],
'f': []
}

print(depthFirst(graph,'a'))
``````

We remove from the end and append to the end thus last in is first out.

### Recursion

``````def depthFirst(graph,source):
print(source)
for neighbor in graph[source]:
depthFirst(graph, neighbor)

graph = {
'a' : ['c','b'],
'b': ['d'],
'c': [ 'e'],
'd': ['f'],
'e': [],
'f': []
}

print(depthFirst(graph,'a'))
``````

In this approach we explore all the immediate neighbors of a given node and keep following this process.

Breadth-first traversal explores all the sides evenly without following one direction entirely. It can be achieved through iteration.
It uses the queue data structure which follows the First In First Out(FIFO) principle.

``````def breadthFirst(graph,source):
queue = [source]
while queue:
current = queue.pop(0)
print(current)
for neighbor in graph[current]:
queue.append(neighbor)

graph = {
'a': ['c', 'b'],
'b': ['d'],
'c': ['e'],
'd': ['f'],
'e': [],
'f': []
}