(definition)

**Definition:**
An *undirected graph* that has a *path* between every pair of *vertices*.

**See also**
*complete graph*, *biconnected graph*, *triconnected graph*, *strongly connected graph*, *forest*, *bridge*, *reachable*, *maximally connected component*, *connected components*, *vertex connectivity*, *edge connectivity*.

*Note:
After LK.*

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 19 April 2004.

HTML page formatted Fri Mar 25 16:20:34 2011.

Cite this as:

Paul E. Black, "connected graph", in
*Dictionary of Algorithms and Data
Structures* [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 19 April 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/connectedGraph.html