D1 terms 5.0 / 5 based on 1 rating ? MathematicsNetworks, algorithms and problem solvingASEdexcel Created by: chickpeatweetCreated on: 10-04-15 14:26 37251610948 Across 1. A connected graph with no cycles (4) 4. 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. Connected graph with no cycles where all vertices are connected (8, 4) 7. In a eulerian graph, all the vertexs have an ..... degree (4) Down 2. A closed path, in which you start and finish at same place (5) 3. Graph in which all vertices are connected (9, 5) 8. In a semi-eulerian graph, the starting and finishing vertices will have an .... degree (3) 9. A route where you can revisit a vertex (4) 10. A route which only visits each vertex once (4)
Comments
No comments have yet been made