the array of vertex (child) adjacency sets (outgoing edges)
the array of verter labels
whether to store inverse adjacency sets (parents)
Add the inverse adjacency sets for rapid accesses to parent vertices.
the array of vertex (child) adjacency sets (outgoing edges)
Given an array of labels, returns an index from labels to the sets of vertices containing those labels
Given an array of labels, returns an index from labels to the sets of vertices containing those labels
the array of vertex labels of type TLabel
Clone (make a deep copy) of this graph.
Clone (make a deep copy) of this graph.
Returns the set of vertices in the graph with label l.
whether to store inverse adjacency sets (parents)
Determines whether or not the graph is connected.
the array of verter labels
the map from label to the set of vertices with the label
Returns the number of edges in the graph.
Returns the maximum label value.
Determines the number of vertices in the graph that have outgoing edges to themselves.
The optional array of vertex inverse (parent) adjacency sets (incoming edges)
Prints the adjacency set, labels, and labelMap of the graph.
Returns the number of vertices in the graph.
Indicate basic information about this graph.
Indicate basic information about this graph. Due to its potential size, use print to show graph details.
Writes the graph to ONE file in the following format: <vertexId> <labelId> <adjVertex1> <adjVertex2> .
Writes the graph to ONE file in the following format: <vertexId> <labelId> <adjVertex1> <adjVertex2> ...
the file in which to write the graph's label and edge information
Writes the graph to TWO igraph compatible files.
Writes the graph to TWO igraph compatible files.
igraph.sourceforge.net
Writes the graph to TWO Neo4J compatible files: lFile and eFile so that they may be fed into Neo4j with one of its utilities.
Writes the graph to TWO Neo4J compatible files: lFile and eFile so that they may be fed into Neo4j with one of its utilities. FIX: need to handle multiple edge types.
the file containing the graph labels (line: vertex-id TAB label)
the file the edges (line: start-id TAB end-id TAB type)
The
Graphclass stores vertex-labeled directed graphs using an adjacency set ('adj') representation, e.g., adj = { {1, 2}, {0}, {1} } means that the graph has the following edges { (0, 1), (0, 2), (1, 0), (2, 1) }. Optionally, inverse adjacency via the 'par' array can be stored at the cost of nearly doubling the storage requirements.the array of vertex (child) adjacency sets (outgoing edges)
the array of verter labels
whether to store inverse adjacency sets (parents)