A New Algorithm for Studying Routes in a Connected Graph

The book describes a new algorithm to study all the routes between a starting node, s and all other nodes in connected graph ( or a communication network defined by X nodes and Y spans (Xn, Ys). This algorithm does not employ complicated searches, recursions or artificial intelligence but depends on only combinatorial analysis (also called block design). Once these routes are available, one can then select only simple paths between any pair of nodes or select those routes that satisfy any set of attributes such as link distances, costs or reliabilities.