{"version":"1.0","type":"link","title":"Widest path problem - Newikis","description":"In graph algorithms, the widest path problem is the problem of finding a path between two designated vertices in a weighted graph, maximizing the weight of the minimum-weight edge in the path. The widest path problem is also known as the maximum capacity path problem. It is possible to adapt most…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/5/5f/CPT-Graphs-undirected-weighted.svg/1280px-CPT-Graphs-undirected-weighted.svg.png","thumbnail_width":1280,"thumbnail_height":1634}