
Table of contents
addEdge - adds one
or several edges to a network
addVertex - adds
one or several vertices to a network
admissibleFlow -
checks a flow for admissibility in a network
allShortPath
- shortest paths for all pairs of nodes
changeEdge -
changes weight and capacity of one or several edges
changeVertex
- changes the weight of one or several vertices in a network
complete -
generates a complete network
convertSSQ -
converts a network into a single source single sink network
cycle - generates a
cycle
delEdge - deletes
one or several edges from a network
delVertex -
deletes one or several vertices from a network
eCapacity -
returns the table of capacities
eWeight - returns
the table of edge weights
edge - returns a list
with all edges
epost, epre -
adjacency lists
inDegree - the
indegree of nodes
isEdge, isVertex -
checks whether an edge or vertex is contained in a network
longPath -
longest paths from one single node
maxFlow - computes
a maximal flow through a network
minCost - computes
a minimal cost flow
minCut - computes a
minimal cut
outDegree -
returns the out-degrees for nodes
printGraph -
print all information about a network
random - generates
a random network
residualNetwork -
computes the residual network
shortPath -
shortest paths from one single node
shortPathTo -
shortest paths to one single node
showGraph -
plots a network
topSort -
topological sorting of the nodes
vWeight - returns
the table of vertex weights
vertex - returns a
list with all vertices
new - generates a new
network
Do you have
questions or comments?
Copyright © SciFace Software GmbH & Co. KG
2000