Term

Definition
path that starts and ends at the same vertex 


Term

Definition
possible to reach any vertex from any other vertex
(go from one place to another without picking up pencil.) 


Term

Definition
a graph where the edges have arrows indicating direction.
(oneway streets) 


Term

Definition
A link between two vertices in a graph 


Term

Definition
A circuit that includes each edge of a graph onceand only once. 


Term

Definition
Adding new edges to a graph to make that graph a Euler circuit 


Term

Definition
A structure of vertices and edges, where the edges connect vertices 


Term

Definition
the best ranking solution out of all the possible ones: least cost, shortest distance etc.. 


Term

Definition
Connected sequence of edges in a graph 


Term

Definition
The number of edges touching that vertex 


Term

Definition
A point on a graph where one or more edges end. 


Term

Definition
A stepbystep descriptions of how to solve a problem 


Term

Definition
method solves TSP by finding all possible Hamiltonian circuits and picking the best (optimal) one 


Term

Definition
A graph in which every pair of vertices is joined by an edge 


Term

Definition
Longest path in an orderrequirement graph length of path= earliest completion time for all tasks making the job 


Term
Fundamental Principle of Counting 

Definition
Method for counting outcomes of multistage processes. 


Term

Definition
Approach for solving an optimization problem:
The cheapest action is taken. : not always optimal solution 


Term

Definition
A circuit using specific edges that starts and ends at the same vertex and visits each vertex once and only once 

