Einfach einen Begriff in der Tabelle rechts anklicken um weitere Übersetzungen in dieser Sidebar zu erhalten.
In graph theory, reachability refers to the ability to get from one vertex to another within a graph. A vertex
s
{displaystyle s}
can reach a vertex
t
{displaystyle t}
(and
t
{displaystyle t}
is reachable from
s
{displaystyle s}
) if there exists a sequence of adjacent vertices which starts with
s
{displaystyle s}
and ends with
t
{displaystyle t}
.