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
|
Algorithm |
In a list containing N items the 'middle' item has position [1/2(N+1)] if N is odd; [1/2 (N+2)] if N is even. |
|
|
Graph |
A graph consists of points (vertices or nodes) which are connected by lines (edges or arcs). |
|
|
Subgraph |
A subgraph of G is a graph, each of whose vertices belong to G and each of whose edges belongs to G. |
|
|
Network/ weighted graph |
If a graph has a number associated with each edge (usually called it's weight) then the graph is called a weighted graph if network. |
|
|
Degree/valency |
The degree/ valency of a vertex is the number of edges incident tonit. A vertex is odd (even) if it has odd (even) degree. |
|
|
Path |
A path is a finite sequences of edges, such that the end vertex of one edge in the sequence is the start vertex of the next, and in which no vertex appears more than once. |
|
|
Cycle/circuit |
A cycle/circuit is a closed path, ie the end vertex of the last edge is the start vertex of the first edge. |
|
|
Connected graph |
Two vertices are connected if there is a path between them. A graph is connected if all its vertices are connected. |
|
|
Digraph and directed edges |
If the edges of a graph have a direction associated with them they are known as directed edges and the graph is known as a digraph. |
|
|
Tree |
A tree is a connected graph with no cycle. |
|
|
Spanning tree |
A spanning tree of a graph G is a subgraph which includes all the vertices of G and is also a tree. |
|
|
Minimum spanning tree / minimum connector |
Spanning tree such that the total length of its arcs is as small as possible. |
|
|
Complete graph |
A graph in which each of the n vertices is connected to every other vertex. |
|
|
Total float |
Float=latest time for event-earliest time for event- duration |
|
|
Bipartite graph |
Consists od 2 sets of vertices X and Y. The edges only join vertices X to vertices in Y, not vertices within a ser. |
|
|
Matching |
Pairing of some or all the elements of one set, X, with elements of a second set, Y. If every member of X is paired with a member of Y the matching is said to be complete matching. |
