generate_planar_graphs#

generate_planar_graphs(maximal_number_of_nodes, degree_sequences=None, maximal_degree=None, output_filename=None, allow_parallel_arcs=False, output_ignore_degree_sequences_filename=None, start_with_planar_graphs=None, notation='em', run_in_parallel=True)#

Generates planar grap :param maximal_number_of_nodes: maximal number of nodes that we wish to generate graph. :param degree_sequences: list of degree sequences of graphs. Can also be a dictionary, where keys are degrees and values are number of points with that degree. :param maximal_degree: maximal degree of the nodes (e.g. 4 for knots), if not given, max of degree sequence is used. :param output_filename: :param allow_parallel_arcs: :param output_ignore_degree_sequences_filename: if this parameter is provided, all graphs will be saved during the process of generation (not only the ones that have a matching degree sequence) :param start_with_planar_graphs: the algorithm will start generating graphs using this list of planar. This can be used to continue computations from one step where all graphs up to some degree have already been generated. :param notation: :param run_in_parallel: :return: