|igraph Reference Manual|
igraph_create— Creates a graph with the specified edges.
igraph_small— Shortand to create a short graph, giving the edges as agruments
igraph_adjacency— Creates a graph object from an adjacency matrix.
igraph_weighted_adjacency— Creates a graph object from a weighted adjacency matrix.
igraph_adjlist— Create a graph from an adjacency list
igraph_star— Creates a star graph, every vertex connects only to the center.
igraph_lattice— Creates most kind of lattices.
igraph_ring— Creates a ring graph, a one dimensional lattice.
igraph_tree— Creates a tree in which almost all vertices have the same number of children.
igraph_full— Creates a full graph (directed or undirected, with or without loops).
igraph_full_citation— Creates a full citation graph
igraph_famous— Create a famous graph by simply providing its name
igraph_lcf— Create a graph from LCF notation
igraph_lcf_vector— Create a graph from LCF notation
igraph_atlas— Create a small graph from the “Graph Atlas”.
igraph_de_bruijn— Generate a de Bruijn graph.
igraph_kautz— Generate a Kautz graph.
igraph_extended_chordal_ring— Create an extended chordal ring
igraph_connect_neighborhood— Connects every vertex to its neighborhood
|<< Chapter 7. Graph Generators||1.1.