breadthFirstSearch -- runs a breadth first search on the digraph starting at a specified node and returns a list of the vertices in the order they were discovered
cartesianProduct -- Computes the cartesian product of two graphs
depthFirstSearch -- runs a depth first search on the digraph or digraph and returns the discovery time and finishing time for each vertex in the digraph
descendants -- returns the descendants of a digraph
writeDotFile -- Writes a graph to a dot file with a specified filename
Methods
addEdge(Digraph,Set), see addEdge -- A method for adding edges to a graph
addEdges'(Digraph,List), see addEdge -- A method for adding edges to a graph
addEdges'(Graph,List) (missing documentation)
addVertex(Digraph,Thing), see addVertex -- A method for adding a set of vertices to a graph
addVertices(Digraph,List), see addVertex -- A method for adding a set of vertices to a graph
addVertices(Graph,List) (missing documentation)
adjacencyMatrix(Digraph), see adjacencyMatrix -- Returns the adjacency matrix of a Graph or Digraph
barycenter(Graph), see barycenter -- Returns the barycenter of a grah
bigraph(MixedGraph) (missing documentation)
bipartiteColoring(Graph), see bipartiteColoring -- Returns a coloring of a bipartite graph
breadthFirstSearch(Digraph,Thing), see breadthFirstSearch -- runs a breadth first search on the digraph starting at a specified node and returns a list of the vertices in the order they were discovered
cartesianProduct(Graph,Graph), see cartesianProduct -- Computes the cartesian product of two graphs
center(Graph), see center -- Returns the center of a graph
children(Digraph,Thing), see children -- returns the children of a vertex of a digraph
deleteVertices(Digraph,List), see deleteVertices -- Deletes specified vertices from a digraph or graph
density(Graph), see density -- computes the density of a graph
depthFirstSearch(Digraph), see depthFirstSearch -- runs a depth first search on the digraph or digraph and returns the discovery time and finishing time for each vertex in the digraph
descendants(Digraph,Thing), see descendants -- returns the descendants of a digraph
diameter(Graph), see diameter -- Computes the diameter of a graph
Digraph _ List (missing documentation)
Digraph _ ZZ (missing documentation)
Digraph _* (missing documentation)
digraph(MixedGraph) (missing documentation)
digraphTranspose(Digraph), see digraphTranspose -- returns the transpose of a Digraph
directProduct(Graph,Graph), see directProduct -- Computes the direct product of two graphs
displayGraph(Digraph), see displayGraph -- displays a digraph or graph using Graphviz
displayGraph(String,Digraph), see displayGraph -- displays a digraph or graph using Graphviz
displayGraph(String,String,Digraph), see displayGraph -- displays a digraph or graph using Graphviz
distance(Digraph,Thing,Thing), see distance -- Computes the distance between two vertexSet in a graph
distance(Digraph,Thing) (missing documentation)
distanceMatrix(Digraph), see distanceMatrix -- Computes the distance matrix of a digraph
eccentricity(Graph,Thing), see eccentricity -- Returns the eccentricity of a vertex of a graph
edgeConnectivity(Graph), see edgeConnectivity -- computes the edge connectivity of a graph
edgeCuts(Graph), see edgeCuts -- returns the edge cuts of a graph
edgeIdeal(Graph), see edgeIdeal -- returns the edge ideal of a graph
edges(Digraph), see edges -- Returns the edges of a digraph or graph
edges(Graph), see edges -- Returns the edges of a digraph or graph
expansion(Graph), see expansion -- returns the expansion of a graph
findPaths(Digraph,Thing,ZZ), see findPaths -- finds all the paths in a digraph of a given length starting at a given vertex
floydWarshall(Digraph), see floydWarshall -- runs the Floyd-Warshall algorithm on a digraph to determine the minimum distance from one vertex to another in the digraph
forefathers(Digraph,Thing), see forefathers -- returns the forefathers of a digrah
numberOfComponents(Graph), see numberOfComponents -- computes the number of connected components of a graph
numberOfTriangles(Graph), see numberOfTriangles -- counts how many subtriangles are present in a graph
parents(Digraph,Thing), see parents -- returns the parents of a vertex on a digraph
parents(MixedGraph,Thing) (missing documentation)
radius(Graph), see radius -- Returns the radius of a graph
reachable(Digraph,List), see reachable -- Returns the vertices reachable in a digraph from a given collection of vertices
reachable(Digraph,Set), see reachable -- Returns the vertices reachable in a digraph from a given collection of vertices
reindexBy(Digraph,String), see reindexBy -- reindexes the vertices according to the input ordering.
reindexBy(Graph,String), see reindexBy -- reindexes the vertices according to the input ordering.
reverseBreadthFirstSearch(Digraph,Thing), see reverseBreadthFirstSearch -- runs a reverse breadth first search on the digraph and returns a list of the vertexSet in the order they were discovered
showTikZ(Digraph), see showTikZ -- Writes a string of TikZ syntax that can be pasted into a .tex file to display G
sinks(Digraph), see sinks -- returns the sinks of a digraph
sources(Digraph), see sources -- returns the sources of a digraph
spanningForest(Graph), see spanningForest -- constructs a spanning forest of a graph
spectrum(Graph), see spectrum -- Returns the spectrum of a graph
strongProduct(Graph,Graph), see strongProduct -- a method for taking the strong product of two graphs