Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
14 Cards in this Set
- Front
- Back
Alternating Path |
A path from one unmatched vertex to another unmatched vertex alternating between arcs in the matching and not in the matching |
|
Bipartite Graph |
A graph with two distinct sets of verticies x and y where x is only linked to y and not x to x |
|
Critical Path |
The path with a total float of 0. Any increase in the length of this path increases the total project time |
|
Degree |
The number of edges incident to a vertex |
|
Spanning Tree |
A subgraph that contains all the vertices of the main graph and is a tree |
|
Total Float |
The amount of time an activity can be delayed by without delaying the project length |
|
Tree |
A connected graph with no cycles |
|
Graph |
A graph consists of nodes connected by verticies |
|
Path |
A finite sequence of edges, such that the end vertex of one edge in the sequence is the start vertex of the next, no vertex appears more than once |
|
Subgraph |
A subset of vertices together with an associated subset of edges |
|
Mathching |
The pairing of some or all thje elements of set x, with elements of the second set Y |
|
Maximum Matching |
The number of pairings between set x and y is as high as possible |
|
Greedy algorithm |
A algorithm that makes an optimal choice at each stage |
|
Connected graph |
All pairs of vertices are connect |