Reachability
Summary
Reachability says which vertices of a graph can be joined by a walk. It is an equivalence relation, and its classes are the connected components. The node reachability gives the precise definition.
Further reading
- Web https://en.wikipedia.org/wiki/Reachability, Definition
About this page
| Tag | 0FDKRX9M9Y |
|---|---|
| URI | m2://0FDKRX9M9Y |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05C40 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.