Lowlevel Python interface for the igraph library. Should not be used directly.
Class 

Class representing the parameters of the ARPACK module. 
Class 

igraph BFS iterator object 
Class 

igraph DFS iterator object 
Class 

Class representing a single edge in a graph. 
Class 

Lowlevel representation of an edge sequence. 
Class 

Lowlevel representation of a graph. 
Class 

Undocumented 
Class 

Class representing a single vertex in a graph. 
Class 

Lowlevel representation of a vertex sequence. 
Function  community 
Undocumented 
Function  convex 
Calculates the convex hull of a given point set. 
Function  is 
Deprecated since 0.9 in favour of is_graphical() . 
Function  is 
Returns whether a list of degrees can be a degree sequence of some graph, with or without multiple and loop edges, depending on the allowed edge types in the remaining arguments. 
Function  is 
Deprecated since 0.9 in favour of is_graphical() . 
Function  set 
Sets the handler to be called when igraph is performing a long operation. 
Function  set 
Sets the random number generator used by igraph. 
Function  set 
Sets the handler to be called when igraph tries to display a status message. 
Function  _compare 
Undocumented 
Function  _disjoint 
Undocumented 
Function  _intersection 
Undocumented 
Function  _power 
Undocumented 
Function  _split 
Undocumented 
Function  _union 
Undocumented 
Calculates the convex hull of a given point set.
Parameters  
vs  the point set as a list of lists 
coords  if True, the function returns the coordinates of the corners of the convex hull polygon, otherwise returns the corner indices. 
Returns  
either the hull's corner coordinates or the point indices corresponding to them, depending on the coords parameter. 
Deprecated since 0.9 in favour of is_graphical()
.
Returns whether a list of degrees can be a degree sequence of some graph.
Note that it is not required for the graph to be simple; in other words, this function may return True for degree sequences that can be realized using one or more multiple or loop edges only.
In particular, this function checks whether
 all the degrees are nonnegative
 for undirected graphs, the sum of degrees are even
 for directed graphs, the two degree sequences are of the same length and equal sums
Parameters  
out  the list of degrees. For directed graphs, this list must contain the outdegrees of the vertices. 
in  the list of indegrees for directed graphs. This parameter must be None for undirected graphs. 
Returns  
True if there exists some graph that can realize the given degree sequence, False otherwise. 
Returns whether a list of degrees can be a degree sequence of some graph, with or without multiple and loop edges, depending on the allowed edge types in the remaining arguments.
Parameters  
out  the list of degrees. For directed graphs, this list must contain the outdegrees of the vertices. 
in  the list of indegrees for directed graphs. This parameter must be None for undirected graphs. 
loops  whether loop edges are allowed. 
multiple  whether multiple edges are allowed. 
Returns  
True if there exists some graph that can realize the given degree sequence with the given edge types, False otherwise. 
Deprecated since 0.9 in favour of is_graphical()
.
Returns whether a list of degrees can be a degree sequence of some simple graph.
Note that it is required for the graph to be simple; in other words, this function will return False for degree sequences that cannot be realized without using one or more multiple or loop edges.
Parameters  
out  the list of degrees. For directed graphs, this list must contain the outdegrees of the vertices. 
in  the list of indegrees for directed graphs. This parameter must be None for undirected graphs. 
Returns  
True if there exists some simple graph that can realize the given degree sequence, False otherwise. 
Sets the handler to be called when igraph is performing a long operation.
Parameters  
handler  the progress handler function. It must accept two arguments, the first is the message informing the user about what igraph is doing right now, the second is the actual progress information (a percentage). 
Sets the random number generator used by igraph.
Parameters  
generator  the generator to be used. It must be a Python object with at least three attributes: random, randint and gauss. Each of them must be callable and their signature and behaviour must be identical to random.random, random.randint and random.gauss. By default, igraph uses the random module for random number generation, but you can supply your alternative implementation here. If the given generator is None, igraph reverts to the default Mersenne twister generator implemented in the C layer, which might be slightly faster than calling back to Python for random numbers, but you cannot set its seed or save its state. 
Sets the handler to be called when igraph tries to display a status message.
This is used to communicate the progress of some calculations where no reasonable progress percentage can be given (so it is not possible to use the progress handler).
Parameters  
handler  the status handler function. It must accept a single argument, the message that informs the user about what igraph is doing right now. 