D1 terms 5.0 / 5 based on 1 rating ? MathematicsNetworks, algorithms and problem solvingASEdexcel Created by: chickpeatweetCreated on: 10-04-15 14:26 The number of edges leaving a vertex Degree 1 of 13 Is traversable, can travel along each edge once and return to start Eulerian 2 of 13 In a eulerian graph, all the vertexs have an ..... degree even 3 of 13 Can travel along each edge once but start and finish different places Semi-eulerian 4 of 13 In a semi-eulerian graph, the starting and finishing vertices will have an .... degree odd 5 of 13 Graph that connects vertices in one set to vertices in another set Bipartite graph 6 of 13 Graph in which all vertices are connected Connected graph 7 of 13 A route which only visits each vertex once Path 8 of 13 A route where you can revisit a vertex Walk 9 of 13 A closed path, in which you start and finish at same place Cycle 10 of 13 A connected graph with no cycles Tree 11 of 13 Connected graph with no cycles where all vertices are connected Spanning tree 12 of 13 Critical analysis: total time an activity can be delayed from earliest start time without delaying the finish time Total float 13 of 13
Comments
No comments have yet been made