| Calling Sequence | Nodes(N)
| |||||||||
| Parameters |
| |||||||||
| Return Type | Nodes | |||||||||
| Methods | type | |||||||||
| Synopsis | The Nodes structure holds the list of labels for nodes in a graph. | |||||||||
| Examples | > G := Graph( Edges( Edge(4,1,2), Edge(7,1,3), Edge(6,2,4), Edge(5,3,4) ), Nodes(1, 2, 3, 4) ); G := Graph(Edges(Edge(4,1,2),Edge(7,1,3),Edge(6,2,4),Edge(5,3,4)),Nodes(1,2,3,4)) | |||||||||
| See also | BipartiteGraph, Clique, DrawGraph, Edge, EdgeComplement, Edges, FindConnectedComponents, Graph, Graph_Rand, InduceGraph, MaxCut, MaxEdgeWeightClique, MST, Path, RegularGraph, ShortestPath, TetrahedronGraph, VertexCover | |||||||||