D1 Glossary 0.0 / 5 ? MathematicsNetworks, algorithms and problem solvingASEdexcel Created by: chickpeatweetCreated on: 08-06-15 19:37 83105612749 Across 1. A type of graph which has directed edges (7) 4. A graph which has a weight on each arc (7) 5. A closed path in which the end vertex of the last edge is the starting vertex of the first edge (5) 6. A type of graph consisting of two sets of vertices, X + Y, and the edges only join vertices in X to Y, not within sets (9, 5) 9. The number of edges incident to a vertex (6) 10. Latest event time - earliest event time - duration (5, 5) Down 2. A finite sequence of edges in which they're all connected and no vertex is visited more than once (4) 3. All vertices are connected by a path (9, 5) 7. A connected graph with no cycles (4) 8. The pairing of some or all of the vertices from set X to the vertices in set Y (8)
Comments
No comments have yet been made