## Question about finding strongly-connected vertices of an unusually-drawn graph

For question 3a, here ( https://www.docdroid.net/vosFyfl/251-final.pdf#page=4 ), I get that the "sticks" that are higher up, as in sticking out of the page, are like nodes on a graph that have directed edges pointing to the "sticks" below, as in into the page.

If I look at the answer from the solutions PDF ( https://www.docdroid.net/zYB4Vht/251...ons.pdf#page=4 ), it makes sense to me, but how would I do this systematically? For example, if it were drawn as a regular graph, one could use Kosaraju's algorithm ( https://www.youtube.com/watch?v=5wFyZJ8yH9Q ), but the question suggests not drawing the graph. Is it expecting that the question be answered merely by eyeballing things? What should one do in order to properly answer this question?

Any input would be GREATLY appreciated!