Computer programmes for finding shortest distances in graphs are presented.