# `Network` - library for graph theory

## Table of contents

1. `addEdge` - adds one or several edges to a network
2. `addVertex` - adds one or several vertices to a network
3. `admissibleFlow` - checks a flow for admissibility in a network
4. `allShortPath` - shortest paths for all pairs of nodes
5. `changeEdge` - changes weight and capacity of one or several edges
6. `changeVertex` - changes the weight of one or several vertices in a network
7. `complete` - generates a complete network
8. `convertSSQ` - converts a network into a single source single sink network
9. `cycle` - generates a cycle
10. `delEdge` - deletes one or several edges from a network
11. `delVertex` - deletes one or several vertices from a network
12. `eCapacity` - returns the table of capacities
13. `eWeight` - returns the table of edge weights
14. `edge` - returns a list with all edges
15. `epost, epre` - adjacency lists
16. `inDegree` - the indegree of nodes
17. `isEdge, isVertex` - checks whether an edge or vertex is contained in a network
18. `longPath` - longest paths from one single node
19. `maxFlow` - computes a maximal flow through a network
20. `minCost` - computes a minimal cost flow
21. `minCut` - computes a minimal cut
22. `outDegree` - returns the out-degrees for nodes
23. `printGraph` - print all information about a network
24. `random` - generates a random network
25. `residualNetwork` - computes the residual network
26. `shortPath` - shortest paths from one single node
27. `shortPathTo` - shortest paths to one single node
28. `showGraph` - plots a network
29. `topSort` - topological sorting of the nodes
30. `vWeight` - returns the table of vertex weights
31. `vertex` - returns a list with all vertices
32. `new` - generates a new network

Do you have questions or comments?
Copyright © SciFace Software GmbH & Co. KG 2000