An extension of IndexedEdgeList that caches the results of calculations of various graph properties so as to provide speedier performance. Provides the same set of public methods. This is the recommended data type to use with Dgraph.
Graph data type based on igraph's igraph_t. The basic data structure is a pair of arrays whose entries consist of the start and end vertices of the edges in the graph. These are supplemented by sorted indices and cumulative sums that enable fast calculation of graph properties from the stored data.
Test if G is a directed graph.
Test if G is a Dgraph graph type.
Test if G is an undirected graph.
The basic graph data structure used here is adapted from the library igraph by Gábor Csárdi and Tamás Nepusz.
Copyright © 2013 Joseph Rushton Wakeling
This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.
Basic graph data structures.