Reading...
Play button
Play button
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;
11 Cards in this Set
- Front
- Back
|
Tree
|
A connected graph with no loops, cycles or multiple edges.
|
|
|
Spanning Tree
|
A tree that includes all vertices.
|
|
|
Minimum Spanning Tree
|
A spanning tree of minimum total length.
|
|
|
Bipartite Graph
|
A graph consisting of two distinct sets of vertices X and Y in which… arcs can only join a vertex in X to a vertex in Y.
|
|
|
Alternating Path
|
A path from an unmatched vertex in X to an unmatched vertex in Y which alternately uses arcs in/not in the matching.
|
|
|
Matching
|
The (1-1) matching / pairing of some elements of X with elements of Y.
|
|
|
Complete matching
|
A 1-1 matching between all elements of X onto Y.
|
|
|
Slack=
|
L(i)-e(i)
|
|
|
Critical event
|
Slack=0, e(i)=l(i)
|
|
|
Float
|
(L(j)-e(j))-d(i,j)
|
|
|
Critical activity
|
Float=0
|
