出典:Wiktionary
reachability (countable かつ uncountable, 複数形 reachabilities)
出典:Wikipedia
出典:『Wikipedia』 (2011/04/29 15:46 UTC 版)
In graph theory, reachability is the notion of being able to get from one vertex in a directed graph to some other vertex. Note that reachability in undirected graphs is trivial — it is sufficient to find the connected components in the graph, which can be done in linear time.