Scribd Logo
Upload

Welcome to Scribd!

  • 29 views

    Dsapractice Durgesh

    Uploaded by

    Durgesh Vishwakarma
    The document discusses the adjacency list representation of graphs in Python. It defines an AdjNode class to represent each node of the graph and a Graph class to represent the overall graph as a list of its adjacency lists. The Graph class initializes the graph as a list based on the number of vertices, adds edges between nodes by linking their adjacency lists, and prints the graph by traversing each adjacency list. It includes a sample driver code that creates a graph with 5 vertices and prints its adjacency list representation.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Dsapractice Durgesh

    Uploaded by

    Durgesh Vishwakarma
    29 views3 pages
    The document discusses the adjacency list representation of graphs in Python. It defines an AdjNode class to represent each node of the graph and a Graph class to represent the overall graph as a list of its adjacency lists. The Graph class initializes the graph as a list based on the number of vertices, adds edges between nodes by linking their adjacency lists, and prints the graph by traversing each adjacency list. It includes a sample driver code that creates a graph with 5 vertices and prints its adjacency list representation.

    Original Title

    dsaPractice-durgesh

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses the adjacency list representation of graphs in Python. It defines an AdjNode class to represent each node of the graph and a Graph class to represent the overall graph as a list of its adjacency lists. The Graph class initializes the graph as a list based on the number of vertices, adds edges between nodes by linking their adjacency lists, and prints the graph by traversing each adjacency list. It includes a sample driver code that creates a graph with 5 vertices and prints its adjacency list representation.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    29 views3 pages

    Dsapractice Durgesh

    Uploaded by

    Durgesh Vishwakarma
    The document discusses the adjacency list representation of graphs in Python. It defines an AdjNode class to represent each node of the graph and a Graph class to represent the overall graph as a list of its adjacency lists. The Graph class initializes the graph as a list based on the number of vertices, adds edges between nodes by linking their adjacency lists, and prints the graph by traversing each adjacency list. It includes a sample driver code that creates a graph with 5 vertices and prints its adjacency list representation.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 3

    Date- 3/7/2021

    Topic Graph

    Representation of graph-

    1. Adjacency list

    """

    A Python program to demonstrate the adjacency

    list representation of the graph

    """

    # A class to represent the adjacency list of the node

    class AdjNode:

    def __init__(self, data):


    self.vertex = data

    self.next = None

    # A class to represent a graph. A graph

    # is the list of the adjacency lists.

    # Size of the array will be the no. of the

    # vertices "V"

    class Graph:

    def __init__(self, vertices):

    self.V = vertices

    self.graph = [None] * self.V

    # Function to add an edge in an undirected graph

    def add_edge(self, src, dest):

    # Adding the node to the source node

    node = AdjNode(dest)

    node.next = self.graph[src]

    self.graph[src] = node

    # Adding the source node to the destination as

    # it is the undirected graph

    node = AdjNode(src)

    node.next = self.graph[dest]

    self.graph[dest] = node

    # Function to print the graph

    def print_graph(self):
    for i in range(self.V):

    print("Adjacency list of vertex {}\n head".format(i), end="")

    temp = self.graph[i]

    while temp:

    print(" -> {}".format(temp.vertex), end="")

    temp = temp.next

    print(" \n")

    # Driver program to the above graph class

    if __name__ == "__main__":

    V=5

    graph = Graph(V)

    graph.add_edge(0, 1)

    graph.add_edge(0, 4)

    graph.add_edge(1, 2)

    graph.add_edge(1, 3)

    graph.add_edge(1, 4)

    graph.add_edge(2, 3)

    graph.add_edge(3, 4)

    graph.print_graph()

    # This code is contributed by Kanav Malhotra

    You might also like