23,99 €
inkl. MwSt.
Versandfertig in 6-10 Tagen
12 °P sammeln
Andere Kunden interessierten sich auch für
![Ternary Relation]( "Ternary Relation")
Ternary Relation23,99 €![Clairaut's Relation]( "Clairaut's Relation")
Clairaut's Relation31,99 €![The World of the Unseen: An Essay On the Relation of Higher Space to Things Eternal]( "The World of the Unseen: An Essay On the Relation of Higher Space to Things Eternal")
The World of the Unseen: An Essay On the Relation of Higher Space to Things Eternal34,99 €![Mémoire Sur La Relation Qui Existe Entre Les Distances Respectives De Cinq Points Quelconques Pris Dans L'Espace]( "Mémoire Sur La Relation Qui Existe Entre Les Distances Respectives De Cinq Points Quelconques Pris Dans L'Espace")
Mémoire Sur La Relation Qui Existe Entre Les Distances Respectives De Cinq Points Quelconques Pris Dans L'Espace34,99 €![Hadwiger Finsler Inequality]( "Hadwiger Finsler Inequality")
Hadwiger Finsler Inequality23,99 €![Klein Geometry]( "Klein Geometry")
Klein Geometry23,99 €![Chern Weil Theory]( "Chern Weil Theory")
Chern Weil Theory27,99 €
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.For a directed graph D = (V, A), the reachability relation of D is the transitive closure of its arc set A, which is to say the set of all ordered pairs (s, t) of vertices in V for which there exist vertices v0 = s, v1, , vd = t such that (vi - 1, vi ) is in A for all 1 i d.