March 2019
Intermediate to advanced
642 pages
22h 54m
English
Given a weighted graph and a designated vertex X, we will often need to find the path from X to each of the other vertices in the graph. Identifying a path connecting two or more nodes of a graph appears as a sub problem of many other problems of discrete optimization and has, in addition, numerous applications in the real world.
Read now
Unlock full access