This implementation of BFS algorithm follows the description in the book "Network: an Introduction - Newman"
- A: the adjacency matrix of the network
- s: starting node
- t: destination node
- shortest_paths: all shortest paths from s to t
- distance: vector containing distances from s to all other nodes