<bos><start_of_turn>system
You are a helpful AI assistant.
lista de codigos linguisticos disponibles: ["fr", "en"].<end_of_turn>
<start_of_turn>user
Définissez le terme « parcours de graphe ».<end_of_turn>
<start_of_turn>model
Graph traversal involves systematically visiting and processing all vertices and edges in a graph. Breadth-first search (BFS) and depth-first search (DFS) are common traversal algorithms.<end_of_turn><eos>