[Next][Prev] [_____] [Left] [Up] [Index] [Root]
Acknowledgements
Introduction
Construction of Networks
Magma Output: Printing of a Network
Standard Construction for Networks
Subgraphs
Incremental Construction: Adding Edges
Union of Networks
Maximum Flow and Minimum Cut
Bibliography
DETAILS
Introduction
Construction of Networks
Network<n | edges > : RngIntElt, List -> GrphNet, GrphVertSet, GrphEdgeSet
Example Network_GrphNet_Constr (H139E1)
Magma Output: Printing of a Network
Example Network_GrphNet_Constr2 (H139E2)
Standard Construction for Networks
Subgraphs
sub< N | list > : GrphNet, List -> GrphNet, GrphVertSet, GrphEdgeSet
Example Network_ConstrSubNetwork (H139E3)
Incremental Construction: Adding Edges
N + < [ u, v ], c > : GrphNet, < [ GrphVert, GrphVert ], RngIntElt > -> GrphNet, GrphEdge
N + { < [ u, v ], c > } : GrphNet, { < [ GrphVert, GrphVert ], RngIntElt > } -> GrphNet
N +:= < [ u, v ], c > : GrphNet, < [ GrphVert, GrphVert ], RngIntElt > ->
AddEdge(N, u, v, c) : GrphNet, GrphVert, GrphVert, RngIntElt -> GrphNet, GrphEdge
AddEdge(N, u, v, c, l) : GrphNet,GrphVert, GrphVert, RngIntElt, . -> GrphNet, GrphEdge
AddEdges(N, S) : GrphNet, { < [ GrphVert, GrphVert ], RngIntElt > } -> GrphNet
AddEdge(~N, u, v, c) : GrphNet, GrphVert, GrphVert, RngIntElt ->
Union of Networks
Maximum Flow and Minimum Cut
MinimumCut(s, t : parameters) : GrphVert, GrphVert -> SeqEnum, RngIntElt
MinimumCut(Ss, Ts : parameters) : [ GrphVert ], [ GrphVert ] -> SeqEnum, RngIntElt
MaximumFlow(s, t : parameters) : GrphVert, GrphVert -> RngIntElt, SeqEnum
MaximumFlow(Ss, Ts : parameters) : [ GrphVert ], [ GrphVert ] -> RngIntElt, SeqEnum
Flow(e) : GrphEdge -> RngIntElt
Flow(u, v) : GrphVert, GrphVert -> RngIntElt
Bibliography
[Next][Prev] [Right] [____] [Up] [Index] [Root]
|
