D1 Glossary 0.0 / 5 ? MathematicsNetworks, algorithms and problem solvingASEdexcel Created by: chickpeatweetCreated on: 08-06-15 19:37 The number of edges incident to a vertex degree 1 of 12 A finite sequence of edges in which they're all connected and no vertex is visited more than once Path 2 of 12 A closed path in which the end vertex of the last edge is the starting vertex of the first edge Cycle 3 of 12 A type of graph which has directed edges digraph 4 of 12 A connected graph with no cycles Tree 5 of 12 A subgraph which includes all the vertices of the original graph and is a tree Spanning tree 6 of 12 A spanning tree in which the total weight of its arcs is as small as possible Minimum spanning tree 7 of 12 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 Bipartite graph 8 of 12 The pairing of some or all of the vertices from set X to the vertices in set Y Matching 9 of 12 Latest event time - earliest event time - duration Total float 10 of 12 A graph which has a weight on each arc Network 11 of 12 All vertices are connected by a path Connected graph 12 of 12
Comments
No comments have yet been made