Graph0
Value parameters
- ch
-
the array of child (adjacency) vertex sets (outgoing edges)
- inverse
-
whether to store inverse adjacency sets (parents)
- label
-
the array of vertex labels: v -> vertex label
- name
-
the name of the digraph
Attributes
- Graph
-
- Supertypes
-
trait Serializabletrait Producttrait Equalstrait Cloneableclass Objecttrait Matchableclass AnyShow all
Members list
Value members
Concrete methods
Add the inverse adjacency sets for rapid accesses to parent vertices.
Add the inverse adjacency sets for rapid accesses to parent vertices.
Attributes
Create an array vertices from selected vertices from graph g, those in vset. If makeMap, record the mapping between g's vertices and the new vertices.
Create an array vertices from selected vertices from graph g, those in vset. If makeMap, record the mapping between g's vertices and the new vertices.
Value parameters
- g
-
graph to be used for adding vertex labels
- makeMap
-
whether to make a map from new vertex id's to old vertex id's
- vset
-
selected vertices from graph g
Attributes
Create an array [1, 2, ..., size] for default values for id's.
Create an array [1, 2, ..., size] for default values for id's.
Attributes
Given an array of labels, return an index from labels to the sets of vertices containing those labels.
Given an array of labels, return an index from labels to the sets of vertices containing those labels.
Value parameters
- label
-
the array of vertex labels
Attributes
Check whether the end-point vertex id of each edge is within bounds: 0 .. maxId.
Check whether the end-point vertex id of each edge is within bounds: 0 .. maxId.
Attributes
Clone (make a deep copy) of this digraph.
Clone (make a deep copy) of this digraph.
Attributes
- Definition Classes
-
Object
To check if two graphs are equal.
To check if two graphs are equal.
Value parameters
- g2_
-
the graph to be compared with this graph
Attributes
- Definition Classes
-
Equals -> Any
Make this directed graph work like an undirected graph by making sure that for every edge u -> v, there is a v -> u edge and that they have same edge label.
Make this directed graph work like an undirected graph by making sure that for every edge u -> v, there is a v -> u edge and that they have same edge label.
Attributes
Return the number of edges in this digraph.
Return the number of edges in this digraph.
Attributes
Print this digraph in a deep sense with all the information.
Print this digraph in a deep sense with all the information.
Value parameters
- clip
-
whether to clip out "Set(" and ")"
Attributes
Return the size of graph in terms of the number of vertices.
Return the size of graph in terms of the number of vertices.
Attributes
Convert the i'th row/line of this digraph to a string.
Convert the i'th row/line of this digraph to a string.
Value parameters
- i
-
the i'th row/line
Attributes
Convert this digraph to a string in a shallow sense. Large arrays are not converted. Use print to show all information.
Convert this digraph to a string in a shallow sense. Large arrays are not converted. Use print to show all information.
Attributes
- Definition Classes
-
Any
Inherited methods
Attributes
- Inherited from:
- Product
Attributes
- Inherited from:
- Product