-
-
addEdge -- A method for adding edges to a graph
-
addVertex -- A method for adding a set of vertices to a graph
-
-
-
-
BFS (missing documentation)
-
-
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
-
-
center -- Returns the center of a graph
-
children -- returns the children of a vertex of a digraph
-
-
-
-
-
-
-
-
-
-
-
-
coverIdeal -- Returns the vertex cover ideal of a graph
-
-
-
-
-
-
-
degreeIn -- returns the "in-degree" of a vertex in a digraph
-
-
degreeOut -- returns the "out-degree" of a vertex in a digraph
-
-
-
-
-
density -- computes the density of a graph
-
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
-
-
descendents (missing documentation)
-
DFS (missing documentation)
-
-
-
-
-
-
discoveryTime (missing documentation)
-
-
-
distance -- Computes the distance between two vertexSet in a graph
-
-
-
eccentricity -- Returns the eccentricity of a vertex of a graph
-
-
edgeCuts -- returns the edge cuts of a graph
-
edgeIdeal -- returns the edge ideal of a graph
-
edges -- Returns the edges of a digraph or graph
-
expansion -- returns the expansion of a graph
-
findPaths -- finds all the paths in a digraph of a given length starting at a given vertex
-
finishingTime (missing documentation)
-
floydWarshall -- runs the Floyd-Warshall algorithm on a digraph to determine the minimum distance from one vertex to another in the digraph
-
-
-
-
girth -- A method for computing the girth of a graph
-
-
graph -- Constructs a simple graph
-
-
-
graphLibrary -- constructs a graph of a type specified in the string input
-
graphPower -- constructs a graph raised to a power
-
hasEulerianTrail -- determines whether a graph or a digraph has an Eulerian trail
-
hasOddHole -- checks whether a graph has a odd hole
-
html(Digraph) -- Create an .svg representation of a graph or digraph
-
-
-
-
indexLabelGraph -- Relabels the vertices of a graph or digraph according to their indices, indexed from 0.
-
inducedSubgraph -- A method for finding the induced subgraph of any Graph or Digraph
-
-
isChordal -- checks whether a graph is chordal
-
isCM -- determines if a graph is Cohen-Macaulay
-
-
isCyclic -- determines whether a graph is cyclic
-
-
isEulerian -- determines if a graph or digraph is Eulerian
-
isForest -- determines whether a graph is a forest
-
isLeaf -- determines whether a vertex is a leaf
-
isPerfect -- checks whether a graph is perfect
-
isReachable -- checks if a vertex u is reachable from a vertex v
-
isRegular -- determines whether a graph is regular
-
isRigid -- checks if a graph is rigid
-
-
isSink -- determines if a vertex of a digraph is a sink or not
-
isSource -- determines if a vertex of a digraph is a source or not
-
-
isTree -- determines whether a graph is a tree
-
-
kneserGraph -- constructs a kneser graph of specified size
-
-
-
leaves -- lists the leaves of a tree graph
-
lexicographicProduct (missing documentation)
-
lineGraph -- Returns the line graph of an undirected graph
-
-
-
-
-
-
neighbors -- returns the neighbors of a vertex in a graph
-
-
-
nondescendents (missing documentation)
-
nonneighbors -- returns the non-neighbors of a vertex in a graph
-
-
-
parents -- returns the parents of a vertex on a digraph
-
pathGraph -- A method that makes a path graph
-
prismGraph (missing documentation)
-
radius -- Returns the radius of a graph
-
-
reachable -- Returns the vertices reachable in a digraph from a given collection of vertices
-
reindexBy -- reindexes the vertices according to the input ordering.
-
removeNodes (missing documentation)
-
reverseBreadthFirstSearch -- runs a reverse breadth first search on the digraph and returns a list of the vertexSet in the order they were discovered
-
showTikZ -- Writes a string of TikZ syntax that can be pasted into a .tex file to display G
-
simpleGraph (missing documentation)
-
Singletons (missing documentation)
-
sinks -- returns the sinks of a digraph
-
-
sources -- returns the sources of a digraph
-
-
spectrum -- Returns the spectrum of a graph
-
-
strongProduct -- a method for taking the strong product of two graphs
-
thresholdGraph -- A method that generates a threshold graph from a binary list
-
topologicalSort -- outputs a list of vertices in a topologically sorted order of a DAG.
-
topSort -- outputs a hashtable containing original digraph, new digraph with vertices topologically sorted and a map from vertices of original digraph to new digraph.
-
-
-
-
vertexCovers -- returns a list of the minimal vertex covers of a graph
-
vertexCuts -- lists all the vertex cuts of a graph
-
-
vertexSet -- Returns the vertices of a graph or digraph
-
-
-
writeDotFile -- Writes a graph to a dot file with a specified filename