A **graph** stores the ____ between pairs of **objects**. Like a\nlinked list or binary tree, a **graph** consists of **nodes** known\nas ____, which are connected to other **nodes** through **links**\nknown as ____. The number of **links** connected to a **node** is\ncalled the ____ of the **object**. A sequence of **links** between\ntwo **nodes** in a **graph** is called a ____.

Match the **graph** terms below to the following descriptions:

- \n
- There exists a path between any two nodes in a graph. \n
- When edges can only be traversed in one direction. \n
- When each edge has a corresponding cost. \n
- When there are no parallel or self-loop edges in a graph. \n
- When every node has a degree
*n - 1*. \n

Reorder the following rows of an **adjacency matrix** to correspond\nto the **graph** below:

\n \n

\n\n\n A B C D E\nA ? ? ? ? ?\nB ? ? ? ? ?\nC ? ? ? ? ?\nD ? ? ? ? ?\nE ? ? ? ? ?\n\n", "responses": { "a": "

Reorder the following lists of an **adjacency list** to correspond to\nthe **graph** below:

\n \n

\n\n\nA: ?\nB: ?\nC: ?\nD: ?\nE: ?\n\n", "responses": { "a": "