D1 terms 5.0 / 5 based on 1 rating ? MathematicsNetworks, algorithms and problem solvingASEdexcel Created by: chickpeatweetCreated on: 10-04-15 14:26 1028137596 Across 1. Critical analysis: total time an activity can be delayed from earliest start time without delaying the finish time (5, 5) 5. The number of edges leaving a vertex (6) 6. Can travel along each edge once but start and finish different places (4, 8) 7. In a eulerian graph, all the vertexs have an ..... degree (4) 9. A route which only visits each vertex once (4) Down 1. A connected graph with no cycles (4) 2. Connected graph with no cycles where all vertices are connected (8, 4) 3. In a semi-eulerian graph, the starting and finishing vertices will have an .... degree (3) 8. Is traversable, can travel along each edge once and return to start (8) 10. Graph in which all vertices are connected (9, 5)
Comments
No comments have yet been made