Breath First Search
Breath First Search algorithm to find shortest paths in a network
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
This implementation of BFS algorithm follows the description in the book "Network: an Introduction - Newman"
Inputs:
- A: the adjacency matrix of the network
- s: starting node
- t: destination node
Outputs:
- shortest_paths: all shortest paths from s to t
- distance: vector containing distances from s to all other nodes
Cite As
Anh-Dung Nguyen (2026). Breath First Search (https://www.mathworks.com/matlabcentral/fileexchange/39763-breath-first-search), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.0.0 (1.82 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
