LLM and Graph Traversal | Dataford Interview Questions

Explain what an LLM is and solve a BFS/DFS style graph traversal problem.

An LLM is a neural network trained to predict tokens from context. For the coding task, implement BFS traversal on a directed graph represented by an adjacency-list dictionary.

Input and Output

graph maps each vertex to a list of neighboring vertices, and start is a vertex in the graph. Return vertices in BFS order, visiting neighbors in the order provided. Each vertex must appear at most once.

Constraints

1 <= number of vertices <= 10^4
0 <= number of directed edges <= 2 * 10^4
Every vertex appears as a key in graph
start is a vertex in graph
Neighbor lists preserve the required traversal order

Function Signature

def bfs_traversal(graph, start):

Your question is LLM and Graph Traversal. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem