| Calling Sequence | Edges(L)
| |||||||||
| Parameters |
| |||||||||
| Return Type | Edges | |||||||||
| Methods | set, type | |||||||||
| Synopsis | The Edges structure is the first field of a Graph data structure. It consists of a list of Edge structures. | |||||||||
| 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, FindConnectedComponents, Graph, Graph_Rand, InduceGraph, MaxCut, MaxEdgeWeightClique, MST, Nodes, Path, RegularGraph, ShortestPath, TetrahedronGraph, VertexCover | |||||||||