The docstrings include educational information about each named “graphs.” and then hit the tab key to see which graphs are available. Representatives) in this database is available via tab completion. See theĪ list of all graphs and graph structures (other than isomorphism class Orderly generation of isomorphism class representatives. GraphGenerators #Ī class consisting of constructors for several common graphs, as well as
Keshav Kini (): added Shrikhande and Dyck graphsĭavid Coudert (): new RandomGNP generatorĭavid Coudert (): added chessboard graphs: Queen, King,īirk Eisermann (): new section ‘intersection graphs’,įunctions and methods # class _generators. Minh Van Nguyen (): added more named graphs
Harald Schilly and Yann Laigle-Chapuy (): added Fibonacci TreeĮd Scheinerman (): added Grotzsch graph and Mycielski graphsĮd Scheinerman (): added RandomTriangulation Michael Yurko (): added hyperstar, (n,k)-star, n-star, andĪnders Jonsson (): added generalized Petersen graphs
Circular disk graph free#
Robert Miller (): Isomorph free exhaustive generation Graphs with a given degree sequence, random directed graphs Robert Miller (-11): Platonic solids, random graphs,
Robert Miller (): Cube generation and plottingĮmily Kirkman (): more basic structures, docstringsĮmily Kirkman (): added more named graphs Robert Miller (): initial version, empty, random, petersenĮmily Kirkman (): basic structures, node positioning for Graphs from classical geometries over finite fieldsĪ number of classes of graphs related to geometries over finite fields and Platonic solids (ordered ascending by number of vertices) Shortened_000_111_extended_binary_Golay_code_graphĭistance_3_doubly_truncated_Golay_code_graph
0 kommentar(er)
