how to convert adjacency list to adjacency matrix

def convert_to_matrix(graph):
    matrix = []
    for i in range(len(graph)): 
        for j in graph[i]:
            matrix[i][j] = 1
    return matrix
#the lst shows in a form of each index(each inner list) as a form of vertex,
#and each element in the inner list as the vertices that each vertex connected to.
lst = [[1,2,3,5,6],[0,3,6,7],[0,3],[0,1,2,4],[3,5,8],[0,4,8],[0,1],[1],[4,5]]

Here is what the above code is Doing:
1. Create an empty matrix.
2. Iterate over each vertex in the graph.
3. For each vertex, iterate over all the vertices it’s connected to.
4. If the vertex is connected to the current vertex, set the corresponding element in the matrix to 1.
5. Return the matrix.