[____] [____] [_____] [____] [__] [Index] [Root] 


Subindex: Near  ..    network-vertex-edge-set




Near

   IsNearLinearSpace(D) : Inc -> BoolElt

   NearLinearSpace(I) : Inc -> IncNsp

   NearLinearSpace< v | X : parameters > : RngIntElt, List -> IncNsp


NearLinearSpace

   NearLinearSpace(I) : Inc -> IncNsp

   NearLinearSpace< v | X : parameters > : RngIntElt, List -> IncNsp


Nearly

   IsNearlyPerfect(C) : Code -> BoolElt


Negation

   NegationMap(E) : CrvEll -> Map


NegationMap

   NegationMap(E) : CrvEll -> Map


Negative

   IsNegative( W, r ) : GrpPermCox, RngIntElt -> BoolElt

   IsNegative( R, r ) : RootDtm, RngIntElt -> BoolElt

   IsNegative( R, r ) : RootSys, RngIntElt -> BoolElt

   IsNegativeDefinite(F) : ModMatRngElt -> BoolElt

   IsNegativeSemiDefinite(F) : ModMatRngElt -> BoolElt

   Negative( W, r ) : GrpPermCox, RngIntElt -> RngIntElt

   Negative( R, r ) : RootDtm, RngIntElt -> RngIntElt

   Negative( R, r ) : RootSys, RngIntElt -> RngIntElt


negative

   Operators (OVERVIEW)


Neighbor

   Neighbor(L, v, p) : Lat, LatElt, RngIntElt -> Lat

   Neighbour(L, v, p) : Lat, LatElt, RngIntElt -> Lat

   NeighbourClosure(L, p) : Lat, RngIntElt -> Lat


NeighborClosure

   NeighborClosure(L, p) : Lat, RngIntElt -> Lat

   NeighbourClosure(L, p) : Lat, RngIntElt -> Lat


Neighbors

   InNeighbors(u) : GrphVert -> { GrphVert }

   InNeighbours(u) : GrphVert -> { GrphVert }

   InNeighbours(u) : GrphVert -> { GrphVert }

   Neighbours(u) : GrphVert -> { GrphVert }

   Neighbours(L, p) : Lat, RngIntElt -> Lat

   OutNeighbours(u) : GrphVert -> { GrphVert }

   OutNeighbours(u) : GrphVert -> { GrphVert }


Neighbour

   Neighbor(L, v, p) : Lat, LatElt, RngIntElt -> Lat

   Neighbour(L, v, p) : Lat, LatElt, RngIntElt -> Lat

   NeighbourClosure(L, p) : Lat, RngIntElt -> Lat

   Lat_Neighbour (Example H46E19)


NeighbourClosure

   NeighborClosure(L, p) : Lat, RngIntElt -> Lat

   NeighbourClosure(L, p) : Lat, RngIntElt -> Lat


Neighbours

   InNeighbors(u) : GrphVert -> { GrphVert }

   InNeighbours(u) : GrphVert -> { GrphVert }

   InNeighbours(u) : GrphVert -> { GrphVert }

   Neighbours(u) : GrphVert -> { GrphVert }

   Neighbours(L, p) : Lat, RngIntElt -> Lat

   OutNeighbours(u) : GrphVert -> { GrphVert }

   OutNeighbours(u) : GrphVert -> { GrphVert }


neighbours

   Neighbour relations and graphs (LATTICES)


NestedExists

   Set_NestedExists (Example H7E13)


NestedIteration

   Seq_NestedIteration (Example H8E6)


nesting

   Nested Aggregates (INTRODUCTION TO AGGREGATES [SETS, SEQUENCES, AND MAPPINGS])


Network

   Network<n | edges > : RngIntElt, List -> GrphNet, GrphVertSet, GrphEdgeSet

   UnderlyingNetwork(G) : Grph -> GrphDir, GrphVertSet, GrphEdgeSet


network

   AddEdges(~N, S) : GrphNet, [ < [  GrphVert, GrphVert ], RngIntElt > ] ->

   Adding Edges (NETWORKS)

   Adding Vertices (NETWORKS)

   Construction of Networks (NETWORKS)

   Converting between Networks and Simple Graphs (NETWORKS)

   Degree Functions for a Network (NETWORKS)

   Elementary Invariants and Predicates for Networks (NETWORKS)

   Incremental Construction of Networks (NETWORKS)

   Magma Output: Printing of a Network (NETWORKS)

   Maximum Flow and Minimum Cut (NETWORKS)

   NETWORKS

   Removing Edges (NETWORKS)

   Removing Vertices (NETWORKS)

   Standard Construction for Networks (NETWORKS)

   Subgraphs (NETWORKS)

   The Vertex--Set and Edge--Set of Networks (NETWORKS)

   Unions of Networks (NETWORKS)

   Vertex Insertion, Contraction (NETWORKS)


network-adj-deg

   Degree Functions for a Network (NETWORKS)


network-constr

   Construction of Networks (NETWORKS)


network-contr-switch

   Vertex Insertion, Contraction (NETWORKS)


network-conversion

   Converting between Networks and Simple Graphs (NETWORKS)


network-elem

   Elementary Invariants and Predicates for Networks (NETWORKS)


network-flow

   Maximum Flow and Minimum Cut (NETWORKS)


network-mutation

   Incremental Construction of Networks (NETWORKS)


network-mutation-add-e

   AddEdges(~N, S) : GrphNet, [ < [  GrphVert, GrphVert ], RngIntElt > ] ->

   Adding Edges (NETWORKS)


network-mutation-add-v

   AddVertex(~N) : GrphNet ->

   AddVertices(~N, n) : GrphNet, RngIntElt ->

   Adding Vertices (NETWORKS)


network-mutation-rm-e

   Removing Edges (NETWORKS)


network-mutation-rm-v

   RemoveVertex(~N, v) : GrphNet, GrphVert ->

   RemoveVertices(~N, U) : GrphNet, { GrphVert } ->

   Removing Vertices (NETWORKS)


network-print

   Magma Output: Printing of a Network (NETWORKS)


network-stand-constr

   Standard Construction for Networks (NETWORKS)

   Subgraphs (NETWORKS)


network-union

   Unions of Networks (NETWORKS)


network-vertex-edge-set

   The Vertex--Set and Edge--Set of Networks (NETWORKS)




[____] [____] [_____] [____] [__] [Index] [Root]