{"version":"1.0","type":"link","title":"Reachability - Newikis","description":"In graph theory, reachability refers to the ability to get from one vertex to another within a graph. A vertex can reach a vertex (and is reachable from ) if there exists a sequence of adjacent vertices (i.e. a walk) which starts with and ends with .","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}