# Shared Flashcard Set

## Details

Concepts of Mathematics
Chapters 1 and 2
18
Mathematics
11/14/2007

Term
 Circuit
Definition
 path that starts and ends at the same vertex
Term
 Connected Graph
Definition
 possible to reach any vertex from any other vertex (go from one place to another without picking up pencil.)
Term
 Digraph
Definition
 a graph where the edges have arrows indicating direction. (one-way streets)
Term
 Edge
Definition
 A link between two vertices in a graph
Term
 Euler circuit
Definition
 A circuit that includes each edge of a graph once-and only- once.
Term
 Eulerizing
Definition
 Adding new edges to a graph to make that graph a Euler circuit
Term
 Graph
Definition
 A structure of vertices and edges, where the edges connect vertices
Term
 Optimal solution
Definition
 the best ranking solution out of all the possible ones: least cost, shortest distance etc..
Term
 Path
Definition
 Connected sequence of edges in a graph
Term
 Valence (of a vertex)
Definition
 The number of edges touching that vertex
Term
 Vertex
Definition
 A point on a graph where one or more edges end.
Term
 Algorithm
Definition
 A step-by-step descriptions of how to solve a problem
Term
 Brute force method
Definition
 method solves TSP by finding all possible Hamiltonian circuits and picking the best (optimal) one
Term
 Complete Graph
Definition
 A graph in which every pair of vertices is joined by an edge
Term
 Critical Path
Definition
 Longest path in an order-requirement graphlength 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
 Greedy Algorithm
Definition
 Approach for solving an optimization problem:The cheapest action is taken. : not always optimal solution
Term
 Hamiltonian Circuit
Definition
 A circuit using specific edges that starts and ends at the same vertex and visits each vertex once and only once
Supporting users have an ad free experience!