Here is a Python code to represent the graph using linked list:

```python
class Node:
def __init__(self, value):
self.vertex = value
self.next = None

class Graph:
def __init__(self, vertices):
self.V = vertices
self.graph = [None] * self.V

def add_edge(self, src, dest):
node = Node(dest)
node.next = self.graph[src]
self.graph[src] = node

node = Node(src)
node.next = self.graph[dest]
self.graph[dest] = node

def print_graph(self):
for i in range(self.V):
print("Vertex " + str(i) + ":", end="")
temp = self.graph[i]
while temp:
print(" - {}".format(temp.vertex), end="")
temp = temp.next
print("
")

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 first defines a Node class for the linked list, and then a Graph class that uses this Node class to create a graph. The Graph class has methods to add an edge and to print the graph. The main function creates a graph with 5 vertices and adds edges between them as per the given input. Finally, it prints the

Question

Here is a Python code to represent the graph using linked list:

```python
class Node:
    def __init__(self, value):
        self.vertex = value
        self.next = None

class Graph:
    def __init__(self, vertices):
        self.V = vertices
        self.graph = [None] * self.V

def add_edge(self, src, dest):
        node = Node(dest)
        node.next = self.graph[src]
        self.graph[src] = node

node = Node(src)
        node.next = self.graph[dest]
        self.graph[dest] = node

def print_graph(self):
        for i in range(self.V):
            print("Vertex " + str(i) + ":", end="")
            temp = self.graph[i]
            while temp:
                print(" -> {}".format(temp.vertex), end="")
                temp = temp.next
            print(" 
")

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 first defines a Node class for the linked list, and then a Graph class that uses this Node class to create a graph. The Graph class has methods to add an edge and to print the graph. The main function creates a graph with 5 vertices and adds edges between them as per the given input. Finally, it prints the

Knowee AI · Accepted Answer

Here is a Python code to represent the graph using linked list:

```python
class Node:
    def __init__(self, value):
        self.vertex = value
        self.next = None

class Graph:
    def __init__(self, vertices):
        self.V = vertices
        self.graph = [None] * self.V

def add_edge(self, src, dest):
        node = Node(dest)
        node.next = self.graph[src]
        self.graph[src] = node

node = Node(src)
        node.next = self.graph[dest]
        self.graph[dest] = node

def print_graph(self):
        for i in range(self.V):
            print("Vertex " + str(i) + ":", end="")
            temp = self.graph[i]
            while temp:
                print(" -> {}".format(temp.vertex), end="")
                temp = temp.next
            print(" 
")

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 first defines a Node class for the linked list, and then a Graph class that uses this Node class to create a graph. The Graph class has methods to add an edge and to print the graph. The main function creates a graph with 5 vertices and adds edges between them as per the given input. Finally, it prints the

Question

Solution

Similar Questions

Upgrade your grade with Knowee