![]() Poznámka o existenci konečných grafů (A remark on the existence of finite graphs), The method parameter controls the order in which the vertices to be connected are chosen. Procedure, the graph is completed by adding self-loops to it. If self-loopsĪre also allowed, the same algorithm is used, but if a non-zero vertex remains at the end of the Loopless multigraphs are generated using an analogous algorithm: an arbitrary vertex is chosen,Īnd it is connected with a single connection to a highest remaining degee vertex. ![]() Pairs are determined based on lexicographic ordering. In the directed case, the "highest" (in, out) degree These algorithms work by choosing an arbitrary vertex and connecting all its stubs (undirected case), or the analogous Kleitman-Wang algorithm (directed case). Simple undirected graphs are constructed using the Havel-Hakimi algorithm Or a directed graph that realized a given pair of out- and in-degree sequences. This function generates an undirected graph that realizes a given degree sequence, Igraph_edge_type_sw_t allowed_edge_types, Igraph_error_t igraph_realize_degree_sequence(Ĭonst igraph_vector_int_t *outdeg, const igraph_vector_int_t *indeg, Printf("The directed complete graph on %" IGRAPH_PRId " vertices with self-loops has %" IGRAPH_PRId " edges.\n", */ igraph_full(&graph, n_vertices, IGRAPH_DIRECTED, IGRAPH_LOOPS) * Create a directed graph with self-loops. Printf("The undirected complete graph on %" IGRAPH_PRId " vertices with self-loops has %" IGRAPH_PRId " edges.\n", */ igraph_full(&graph, n_vertices, IGRAPH_UNDIRECTED, IGRAPH_LOOPS) * Create an undirected complete graph with self-loops. Printf("The directed complete graph on %" IGRAPH_PRId " vertices has %" IGRAPH_PRId " edges.\n", */ igraph_full(&graph, n_vertices, IGRAPH_DIRECTED, IGRAPH_NO_LOOPS) * Remember to destroy the object at the end. Igraph_vcount(&graph), igraph_ecount(&graph)) Printf("The undirected complete graph on %" IGRAPH_PRId " vertices has %" IGRAPH_PRId " edges.\n", */ igraph_full(&graph, n_vertices, IGRAPH_UNDIRECTED, IGRAPH_NO_LOOPS) */ /* Use IGRAPH_UNDIRECTED and IGRAPH_NO_LOOPS instead of 1/TRUE and 0/FALSE for better readability. igraph_extended_chordal_ring - Create an extended chordal ring. igraph_generalized_petersen - Creates a Generalized Petersen graph. igraph_circulant - Creates a circulant graph. ![]() igraph_de_bruijn - Generate a de Bruijn graph. igraph_atlas - Create a small graph from the “ Graph Atlas”. igraph_from_prufer - Generates a tree from a Prüfer sequence. igraph_lcf_vector - Creates a graph from LCF notation. igraph_lcf - Creates a graph from LCF notation. igraph_famous - Create a famous graph by simply providing its name. igraph_realize_degree_sequence - Generates a graph with the given degree sequence. igraph_full_multipartite - Create a full multipartite graph. ![]() igraph_full_citation - Creates a full citation graph. igraph_full - Creates a full graph (directed or undirected, with or without loops). igraph_regular_tree - Creates a regular tree. igraph_symmetric_tree - Creates a symmetric tree with the specified number of branches at each level. igraph_kary_tree - Creates a k-ary tree in which almost all vertices have k children. igraph_ring - Creates a cycle graph or a path graph. igraph_hexagonal_lattice - A hexagonal lattice with the given shape. igraph_triangular_lattice - A triangular lattice with the given shape. igraph_square_lattice - Arbitrary dimensional square lattices. igraph_wheel - Creates a wheel graph, a union of a star and a cycle graph. igraph_star - Creates a star graph, every vertex connects only to the center. igraph_adjlist - Creates a graph from an adjacency list. igraph_sparse_weighted_adjacency - Creates a graph from a weighted sparse adjacency matrix. ![]() igraph_sparse_adjacency - Creates a graph from a sparse adjacency matrix. igraph_weighted_adjacency - Creates a graph from a weighted adjacency matrix. igraph_adjacency - Creates a graph from an adjacency matrix. igraph_small - Shorthand to create a small graph, giving the edges as arguments. igraph_create - Creates a graph with the specified edges. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |