Programming & Development
Math / Algorithms / Analytics
I need to generate all connected acyclic graphs with less than a certain number of nodes where no two generated graphs are equivalent, i.e. there is no bijection f where (x,y) is an edge in one graph iff (f(x),f(y)) is an edge in another.
That would mean that I would have a representation of graphs ... Show more