How to find all simple graphs of order n?
Hello all this is my first post, I am trying to write a program in python that will generate every single adjacency matrix(from graph theory) with a specific number of vertices and then test that adjacency matrix for various conditions. I have already figured out a way to this using many for loops but it's way too slow. I am only interested in graphs that are: connected, of order n, and simple. But I do need to be sure that my program has checked all graphs of that order. The example output for a graph of order 2 would be: just one graph- two vertices connected by a single edge or in list form [[0,1],[1,0]].