Glossary of Key Terms


Term Definition
Acyclic graph A graph without a cycle.
Adjacency The adjacent side is the remaining side of a right triangle; it forms the side of both angles of interest.
Birth The first and direst of all the disasters, emblematic of the facts of coming to life, the nature of which appears to be no uniformity.
Build To erect or construct as an edifice or fabric of any kind; to form by uniting materials into a regular structure; to fabricate.
Co-Secant The reciprocal of the sine; it gives the ratio of the hypotenuse to the length of the opposite side.
Computational Complexity The amount of resources an algorithm requires to run, determined by time (how long it takes) and space (storage it requires).
Cosine The ratio of the length of the adjacent leg to that of the hypotenuse.
Cycle When it is possible to start from a node in a graph, traverse edges, and come back to the node’s starting point.
Degree The number of edges adjacent to a node.
Destroy To un-build; to pull or tear down; to separate into its constituent parts; to break up the structure and organic existence of; to demolish.
Equality The exact agreement between two expressions or magnitude.
Foundations of Increase If you add something many times you multiply it. If you multiply something many times you raise it to power or exponentiate it.
Freedom The exemption from the power and control of another.
Frequency Events over seconds; reveals the required hertz.
Governance To bring conformity with rules, principles or usage.
Gradian A unit of angle measurement where 100 gradians is equal to 90 degrees. A gradian represents 1 out of 400 repetitions.
Greedy Algorithm An algorithm that attempts to solve a problem by finding the best solution at each stage.
Harlot Emblematic of a person given to low conduct; a rogue, a cheat, a rascal.
Hypotenuse The opposite side of the right angle.
Joy The passion of emotion exalted by the expectation of good.
Knowledge Clear perception of fact, truth or duty; certain apprehension; familiar cognizance and cognition.
Linked List A data structure where each item contains its payload data and the memory location of the next item on the list.
List A data structure that contains a group of things in such a way that from one item we can find the next one.
Logarithm Answers the question, "To which Power should I raise a number to get the value I want."
Node The items in a list are called nodes. In graph theory, tasks are nodes.
Nourishment To feed and cause growth.
Onset The minimal constant sound, blend or digraph that begins a syllable.
Opposite (Side) The side opposite to the angle of interest.
Optimal Stopping Point A strategy found by examining and discarding the square root of options, then selecting the next candidate that surpasses the benchmark set by the discarded group.
Orphan Emblematic of someone or something who lacks support or care or supervision; also the first line of a paragraph that is set at the last line of a page or column.
Part A quantity that measures another quantity, but is also a multiple of a quantity that it measures.
Path A sequence of nodes and edges in a graph. A path that starts and ends at the same node is a tour or circuit.
Path Length The sum of length along the path.
Period The interval of time between events; the reciprocal of frequency.
Point That which arrests attention or indicates quantities or character; a salient feature, a characteristic, a peculiarity, an item, a detail.
Pointer A place in memory that holds the memory location of another place.
Power The capability of producing an effect.
Radian A unit of angle measurement. One radian is equal to 180 degrees over pi; a 90-degree angle is equivalent to one radian and is pi over 2.
Refreshment To relieve from the fatigue of depression or to refrigerate the passions.
Relief A pause for relaxation in regards to someone who takes the place of another.
Rhythm Constituted by accented parts and unaccented or silent parts.
Secant The reciprocal of a cosine; gives the ratio of the length of the hypotenuse to the adjacent side.
Sequential Search An algorithm that makes a computer jump from pointer to pointer until it either reaches the item being looked for or null.
Sine The ratio of the length of the side that is the opposite of an angle to the length of the longest side of the angle (the hypotenuse).
Smart Length The shortest path between two nodes.
Tangent The ratio between the opposite and adjacent side.
Task Tasks are nodes and priorities are links between them.
Tour / Circuit A path that starts and ends at the same node.
Understanding The apprehended meaning or the intention of an art, part, and/or point.
Unit Circle Denotes the radius or central origin.
Uncertainty (Statement on) No exact algorithm exists when a graph is constructed while solving a problem during its existence.
Weight (of a Path) A value assigned to an edge. If all weights equal one, the path length equals the number of edges; otherwise, this is not true.
Widow Represents the deprivation of someone or something who is loved; to strip of anything beloved or highly esteemed; to make desolate or bare; to bereave.
Wisdom The use of the best means for attending the best ends.