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