Use Adjacency Matrix instead of Adjacency List.

[surajx]

The graph is directed, Since we are using an Adj List, we have to loop through all proofLine objects to find the inward dependencies. If we use an Adj Matrix to store the graph, with constant time look-up the inward dependent proofLines can be found, thus avoiding many unwanted validations.