Breath First Search

Breath First Search algorithm to find shortest paths in a network

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