Network Optimization Action Set: Syntax

Provides actions for combinatorial and network flow optimization

Table of Actions

Action Name	Description
biconnectedComponents	Calculates the biconnected components and articulation points of a graph
clique	Calculates the maximal cliques of a graph
connectedComponents	Calculates the connected components of a graph
cycle	Calculates the cycles of a graph
linearAssignment (LAP)	Calculates the minimum-cost linear assignment (minimum link-weighted matching) of a bipartite graph
loadGraph	Loads a graph into memory
maxFlow	Calculates the maximum flow of a graph
minCostFlow (MCF)	Calculates the minimum-cost network flow of a graph
minCut	Calculates the minimum cut of a graph
minSpanTree (MST)	Calculates the minimum spanning tree of a graph
path	Calculates the paths of a graph
readGraph	Reads a graph
shortestPath	Calculates the shortest paths between pairs of nodes in a graph
summary	Calculates the summary statistics of a graph
topologicalSort (topSort)	Calculates the topological ordering of a graph
transitiveClosure	Calculates the transitive closure of a graph
tsp	Solves the traveling salesman problem
unloadGraph	Unloads a graph from memory
vrp	Solves the vehicle routing problem