2022-10-16 17:02:13 +0200 | received badge | ● Notable Question (source) |
2020-04-03 11:58:36 +0200 | received badge | ● Popular Question (source) |
2016-11-25 18:19:23 +0200 | received badge | ● Nice Question (source) |
2016-11-25 12:06:50 +0200 | received badge | ● Student (source) |
2016-11-25 12:05:36 +0200 | asked a question | How to get all digraphs with loops I'm trying to count all of the directed graphs on n vertices which have fixed in/out degree, up to isomorphism. I would like to allow loops, though not multiple edges. I can't figure out how to tell the digraphs iterrator to include the ones with loops, though i see this is an option in the graphs iterator. I would appreciate suggestions to get around this/explanations why it is not an option. |