I noticed that there is a topological sort method that gives a topological sorting of the vertices of a DAG, but this seems to only return 1 arrangement. I was wondering if there was a method that returns all possible arrangements or a way to use the previously mentioned method to find all possible arrangements.
igraph does not have an algorithm to generate all topological sorts, and off-hand I can’t recommend one either. If you research this topic and possible algorithms, feel free to open a feature request for igraph’s C core, filling out all sections, and including any extra information that can help us implement it.