---
title: Graph BFS
description: 'Nodes are visited in order of distance from the start, which gives the shortest path in an unweighted graph.'
hidden: true
---