Input : Adjacency-list representation of Directed acyclic graph (Boolean circuit). see Complexity theory by Arora and bark, page no- 104
Find : Adjacency matrix representation of DAG (Boolean circuit).
My attempt :
Let us assume that DAG has $n$ vertices.
First of all create a $n \times n $ table for adjacency matrix. As we have given the list representation, just go through the each list and enter 1 in the adjacency matrix $1$ corresponding to each edge. At the end make all untouched entries of matrix 0's.
My Question : I want to design an algorithm that uses only $O(\log n)$ space.