Reachability
id:
reachability-306-11181272
title:
Reachability
text:
In graph theory, reachability refers to the ability to get from one vertex to another within a graph. A vertex s can reach a vertex t if there exists a sequence of adjacent vertices which starts with s and ends with t . In an undirected graph, reachability between all pairs of vertices can be determined by identifying the connected components of the graph. Any pair of vertices in such a graph can reach each other if and only if they belong to the same connected component; therefore, in such a gr
brand slug:
wiki
category slug:
encyclopedia
description:
Whether one vertex can be reached from another in a graph
original url:
https://en.wikipedia.org/wiki/Reachability
date created:
date modified:
2023-06-26T12:28:44Z
main entity:
{"identifier":"Q1361526","url":"https://www.wikidata.org/entity/Q1361526"}
image:
fields total:
13
integrity:
14