Concepts inOptimal segmentation points for programs
Directed graph
In mathematics, a directed graph or digraph is a graph, or set of nodes connected by edges, where the edges have a direction associated with them. In formal terms a digraph is a pair (sometimes) of: a set V, whose elements are called vertices or nodes, a set A of ordered pairs of vertices, called arcs, directed edges, or arrows (and sometimes simply edges with the corresponding set named E instead of A).
more from Wikipedia
Partition of a set
In mathematics, a partition of a set X is a division of X into non-overlapping and non-empty "parts" or "blocks" or "cells" that cover all of X. More formally, these "cells" are both collectively exhaustive and mutually exclusive with respect to the set being partitioned.
more from Wikipedia
Vertex (graph theory)
In graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices).
more from Wikipedia
Contiguity
A contiguity is a continuous mass, or a series of things in contact or in proximity. In a different meaning, contiguity is the state of being contiguous. The concept was first set out in the Law of Contiguity, one of Aristotle's Laws of Association, which states that things which occur in proximity to each other in time or space are readily associated.
more from Wikipedia
Computer program
A computer program (also software, or just a program) is a sequence of instructions written to perform a specified task with a computer. A computer requires programs to function, typically executing the program's instructions in a central processor. The program has an executable form that the computer can use directly to execute the instructions.
more from Wikipedia
Expected value
In probability theory, the expected value (or expectation, or mathematical expectation, or mean, or the first moment) of a random variable is the weighted average of all possible values that this random variable can take on. The weights used in computing this average correspond to the probabilities in case of a discrete random variable, or densities in case of a continuous random variable.
more from Wikipedia