Content#
Generation functions#

Generate a graph where all nodes are connected. 

Generate a circular graph. 

Create a graph using a 2D distance rule to create the connection between neurons. 

Generate a random graph as defined by Erdos and Renyi but with a reciprocity that can be chosen. 

Generate a random graph with constant in or outdegree. 

Generate a random graph from a given list of degrees. 

Generate a random graph with constant in or outdegree. 

Generate a (potentially smallworld) graph using the NewmanWatts algorithm. 

Generate a Price graph model (BarabasiAlbert if undirected). 

Generate a freescale graph of given reciprocity and otherwise devoid of correlations. 

Generate a sparse random graph with given average clustering coefficient and degree. 

Generate a (potentially smallworld) graph using the WattsStrogatz algorithm. 
Connectors#

Function to connect nodes with a given graph model. 

Function to connect groups with a given graph model. 

Function to connect excitatory and inhibitory population with a given graph model. 
Rewiring functions#

Generate a new rewired graph from g. 

Build a (generally irregular) lattice by rewiring the edges of a graph. 