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;
14 Cards in this Set
- Front
- Back
|
Connected Component |
A Connected Component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, but not to any additional vertices of the supergraph.
|
|
|
Testing Bipartiness |
application, N/A
|
|
|
Directed Graph |
A directed graph is a graph that are connected together, where all the edges are directed from one vertex to another.
|
|
|
Directed Acyclic Graph |
A DAG is a Directed Graph with no directed cycles. There is no way to start at a vertex and follow a sequence of edges that eventually take you back to the starting vertex.
|
|
|
Strong Connectivity |
If every vertex is reachable from every other vertex.
|
|
|
Minimum Spanning Tree |
A Tree that connects all the vertices together, and has a total weight equal or less than every other possible tree weight.
|
|
|
Cycles and Cuts |
A Cut is a partition of the vertices of a graph into two disjoint subsets.
Look more into. |
|
|
Cut Sets |
Any Cut results in a cut-sets.
|
|
|
Greedy Algorithm |
An algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum.
|
|
|
Clustering |
The process of organizing objects into groups whose members are similar in some way.
Look more into. |
|
|
Single-link Clustering |
Look into.
|
|
|
Master Theorem |
N/A
|
|
|
Recurrence Relationships |
An equation that recursively defines a sequence or multidimensional array of values, once one or more initial terms are give: each further term of the sequence or array is defined as a function of the preceding terms.
|
|
|
Big O notation |
The limiting behavior of a function when the argument tends towards infinity.
|
