Returns the assortativity of a graph based on vertex degrees. Returns the assortativity of the graph based on numeric properties of the vertices. Returns the list of articulation points in the graph. Generates a random tree by sampling uniformly from the set of labelled trees with a given number of nodes.ĭecides whether two given vertices are directly connected. Generates a graph with a given isomorphism class. Generates a graph with a given degree sequence. Generates a tree in which almost all vertices have the same number of children. Generates a non-growing graph with prescribed power-law degree distributions. Generates a non-growing graph with edge probabilities proportional to node fitnesses. Generates a graph from a degree sequence. Generates a graph based on a stochastic blockmodel. Generates a graph based on a stochastic model where the probability of an edge gaining a new node is proportional to the edges gained in a given time window. Generates a graph based on vertex types and connection probabilities. Generates a Kautz graph with parameters (m, n)
Generates a full graph (directed or undirected, with or without loops). Generates a graph based on the forest fire model Generates a famous graph based on its name. Generates a graph based on the Erdos-Renyi model. Generates a graph based on a simple growing model with vertex types. Generates a de Bruijn graph with parameters (m, n) Generates a graph based on the Barabasi-Albert model. Generates a graph based on asymmetric vertex types and connection probabilities. Generates a graph from its adjacency matrix. Returns the edges a given vertex is incident on. Returns the edge IDs of some edges between some vertices. Returns the edge ID of an arbitrary edge between vertices v1 and v2 Returns the predecessors of a given vertex.
Returns the successors of a given vertex. Returns adjacent vertices to a given vertex. Returns the strength (weighted degree) of some vertices from the graphĬhecks whether a specific set of edges contain loop edgesĬhecks whether an edge is a multiple edge.Ĭhecks whether the graph has multiple edges.Ĭhecks whether an edge has an opposite pair.Ĭounts the multiplicities of the given edges. Returns some vertex degrees from the graph. See help(type) for accurate signature.Ĭhecks whether the graph is a DAG (directed acyclic graph).Ĭhecks whether the graph is simple (no loop or multiple edges).Ĭhecks whether the graph is a (directed or undirected) tree graph.ĭeletes vertices and all its edges from the graph.
0 kommentar(er)
