D1 Definitions 5.0 / 5 based on 1 rating ? MathematicsDescision MathsA2/A-levelEdexcel Created by: jroe99Created on: 14-06-18 20:29 71086213459 Across 1. An algorithm for constructing a minimum spanning tree in a weighted network, finds the quickest way to link nodes in a system. Can start with any node & has no need to check for cycles. Can be applied to a matrix. (4) 4. An edge which starts & finished at the same vertex. (4) 5. A connected graph with no cycles. (4) 8. A complete bipartite graph with r vertices in the first set & s vertices in the second set. (3) 9. A graph in which some of the edges are directed. (7) 10. Precise set of instructions that anyone can use them to achieve a particular goal in a specified number of steps. (9) Down 2. Vertices connected by arcs. (5) 3. A one to one pairing of some or all of the nodes of one set in a bipartite graph with nodes of the alternate set. One to one means each node from one set is matched with only one node of the alternate set. (8) 6. A graph with no loops & not more than one edge connecting any pair of vertices. (6, 5) 7. A graph consisting of two sets of vertices & edges which joins members of one set of members of the other set & has no edges joining members of a set to members of the same set. (9, 5)
Comments
No comments have yet been made