Graphs - General Questions

A directed graph with no cycles is called a:

A graph with an edge between every pair of vertices is:

What is the output of the following code?

from collections import deque
g = {1: [2, 3], 2: [4], 3: [4], 4: []}
seen, q, order = {1}, deque([1]), []
while q:
    v = q.popleft()
    order.append(v)
    for w in g[v]:
        if w not in seen:
            seen.add(w)
            q.append(w)
print(order)

An adjacency list representation uses space:

A Hamiltonian path visits: