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;
16 Cards in this Set
- Front
- Back
|
Algorithms |
Middle term: Odd - 1/2 (n+1) Even - 1/2 (n+2) |
|
|
Graph |
Consists of Vertices/Nodes and Edges/Arcs |
|
|
Subgraph |
Part of a graph |
|
|
Weighted Graphs |
Each Edge has numbers (weights) on them |
|
|
Degree/Valancy |
The number of edges incident on a Vertex (odd vertex has an odd degree) |
|
|
Path |
Finite sequence of edges, such that the end vertex is the start vertex of another edge. No vertex appears more than once |
|
|
Cycle (Circuit) |
Closed path (end vertex of last edge is the start vertex of first edge) |
|
|
Connected Vertices and Graphs |
Two vertices are connected it there is a path between them. Two graphs are connected if all it's vertices are connected |
|
|
Digraph |
Edges of a graph have direction (directed edges) |
|
|
Tree |
Connected graph with no cycles |
|
|
Spanning Tree |
Subgraph which includes all vertices and is a tree |
|
|
Minimum Spanning Tree |
Spanning Tree such that the total length of it's arcs is as small as possible. A.k.a Minimum connector |
|
|
Complete Graph |
Graph which has all vertices connected to every other vertice |
|
|
Total Float |
Late (end) - Early (start) - Duration |
|
|
Bipartite Graph |
Two sets of Vertices with edges only connecting between sets and not within a set. |
|
|
Matching |
Pairing of some or all of the elements of one set with elements of a second set. If every member of one set is paired with a member of another set, called a complete matching |
