Write a program to convert the given graph from matrix representation to linked list representation

Sure, here is a Python program that converts a graph from matrix representation to adjacency list representation:

# Define the function to convert matrix to adjacency list
def convert_matrix_to_adj_list(matrix):
    adj_list = {}

    # Iterate over the matrix
    for i in range(len(matrix)):
        adj_list[i] = []
        for j in range(len(matrix[i])):
            # If there is an edge
            if matrix[i][j] != 0:
                adj_list[i].append(j)

    return adj_list

# Define the graph in matrix representation
graph_matrix = [
    [0, 1, 0, 1],
    [1, 0, 1, 1],
    [0, 1, 0, 1],
    [1, 1, 1, 0]
]

# Convert the matrix to adjacency list
graph_adj_list = convert_matrix_to_adj_list(graph_matrix)

# Print the adjacency list
print(graph_adj_list)

In this program, we first define a function convert_matrix_to_adj_list that takes a matrix as input and returns an adjacency list. This function iterates over the matrix and for each non-zero entry in the matrix, it adds an edge in the adjacency list.

Then we define a graph in matrix representation and convert it to adjacency list using the function we defined. Finally, we print the adjacency list.