Decision Definitions 3.5 / 5 based on 3 ratings ? MathematicsNetworks, algorithms and problem solvingASEdexcel Created by: Issy HaighCreated on: 13-05-13 16:54 Graph A graph consists of vertices or nodes which are connected by edges or arcs 1 of 16 Subgraph A graph whose vertices belong to the bigger graph it is made up from 2 of 16 Degree/Valency The number of edges a node has attached to it 3 of 16 Path A finite series of edges, such that the end vertex of one edge in the sequence is the start vertex of the next, and no vertex appears more than once 4 of 16 Cycle A closed path- the end vertex of the last edge is the start vertex of the first edge 5 of 16 Digraph A graph with directed edges 6 of 16 Tree A connected graph with no cycles 7 of 16 Spanning tree A subgraph which includes all the vertices and forms a tree 8 of 16 Minimum spanning tree A spanning tree such that the total weight of the arcs is as low as possible - Kruskal or Prim 9 of 16 Algorithm Well defined sequence of steps leading to the solution of a problem of a given type 10 of 16 Traversable (Eulerian) A graph is traversable if all the vertices are of even degree 11 of 16 Semi-traversable Two odd vertices only 12 of 16 Maximal matching A matching that contains the greatest possible number of edges 13 of 16 Complete matching A matching that includes every vertex of the graph 14 of 16 Objective line A line joining all points for which the objective function takes a specified value 15 of 16 Feasible region (R) the set of (x,y) values that satisfy all the constraints 16 of 16
Comments
No comments have yet been made