Question

Topological Sort of Disconnected Graphs

I know how to sort a graph when every node is connected, but how do I sort a graph when not every node is connected by an edge?

Answer 1

Here's an example of what I mean.

Answer 2

Nvm I got it. But I got a follow-up question.

Answer 3

https://stackoverflow.com/questions/36712146/if-topological-sort-uses-dfs-how-can-it-succeed-on-disconnected-graphs

Answer 4

Yah that helps a lot