1) - adjacency list - a linked list that identifies all the vertices to which a particular vertex is connected; each vertex has its own adjacency list.
2) - adjacency matrix - for a graph with N nodes, an N x N table that shows the existence (and weights) of all the edges in the graph.
3) - adjacent node - two nodes in a graph that are connected by an edge.
4) - breadth-first traversal - a node visiting strategy where the closest neighbors are visited first.
5) - depth-first traversal - a node visiting strategy where the longest paths is followed first.
6) - directed graph (digraph) - a graph in which each edge is directed from one vertex to another (or the same) vertex.
7) - edges/arcs - a pair of vertices representing a connection between two nodes in a graph.
8) - graph - a data structure that consists of a set of nodes and a set of edges that relate the nodes to each other.
9) - shorted path - the path with the smallest weight.
10) - source - in a digraph, the node the arrow originates from.
11) - target - in a digraph, the node the arrow is entering.
12) - undirected graph - a graph in which the edges have no direction.
13) - vertex - a node in a graph.
14) - weighted graph - a graph in which each edge carries a value.
15) - weight of a path - the total sum of the weights of all edges in a path.