| A graph in which each vertex is connected to each of the others (with one edge between each pair of vertices) is _______. |
| |

| A list data structure that is used to represent graphs. Each node has a list of nodes that it is connected to. |
| |

| The least number of colors it takes to color its vertices so that adjacent vertices have different colors. |
| |

| A 2D array containing weights on edges. It has a row for each vertex and a column for each vertex. |
| |

| A directed graph in which every pair of vertices has a path between them in both directions. |
| |

| A sequence of vertices in which each pair of successive vertices is connected by an edge. |
| |

| A graph in which there is a path connecting every pair of vertices is ________. |
| |

| A path that does not cross itself – no vertex is repeated – is called ______. |
| |

| An edge is ________ on a vertex if the vertex is an endpoint of the edge. |
| |

| A graph in which each edge is an ordered pair, ex: (D,C) ∈ E, (C,D) ∉ E |
| |

| Defined by finite sets: V = a set of vertices, and E = a set of edges |
| |

| The number of edges in a path or the sum of the weights of its edges. |
| |

| A graph in which edges have some kind of value associated with them. |
| |

| Two vertices are ________ if they are endpoints of the same edge. |
| |

| A graph in which each edge can be traversed in either direction. |
| |

| The number of incident edges on a vertex is the vertex’s ______. |
| |

| A connected subgraph which contains all vertices and is a tree. |
| |

| Edges are represented with _____ between vertices. |
| |

| An edge with the endpoints being the same vertex. |
| |

| A path that starts and ends on the same vertex. |
| |

| An undirected, connected graph with no cycles. |
| |

| A vertex of degree zero (no edges connected). |
| |

| The number of edges pointing from a node. |
| |

| A graph that doesn’t contain any cycles. |
| |

| The number of edges pointing to a node. |
| |

| Vertices are represented with ______. |
| |

| The vertices connected to an edge. |
| |

| Vertices are denoted with a _____. |
| |

| A digraph has ________ edges. |
| |

| Another name for a vertex. |
| |

| |