Question

Exercises for Section 7.1 7.1.1 Let D be the digraph of Figure 7.7. b e Of g C d h Figure 7.7 (a) Find a directed walk in D of length 8. Is this walk a directed path? (b) Find a directed trail in D of length 10.. (c) Find a directed path in D of longest possible length. (d) Find a directed cycle in D of longest possible length. (e) Is D weakly connected? (f) Is D strongly connected? If so, give an example of a directed path from u to u for each pair of vertices u and v of D. If D is not strongly connected, find a pair of vertices u and v such that u is not reachable from v.

          Exercises for Section 7.1
7.1.1 Let D be the digraph of Figure 7.7.
b
e
Of
g
C
d
h
Figure 7.7
(a) Find a directed walk in D of length 8. Is this walk a directed path?
(b) Find a directed trail in D of length 10..
(c) Find a directed path in D of longest possible length.
(d) Find a directed cycle in D of longest possible length.
(e) Is D weakly connected?
(f) Is D strongly connected? If so, give an example of a directed path from u
to u for each pair of vertices u and v of D. If D is not strongly connected,
find a pair of vertices u and v such that u is not reachable from v.

Exercises for Section 7.1
7.1.1 Let D be the digraph of Figure 7.7.
b
e
Of
g
C
d
h
Figure 7.7
(a) Find a directed walk in D of length 8. Is this walk a directed path?
(b) Find a directed trail in D of length 10..
(c) Find a directed path in D of longest possible length.
(d) Find a directed cycle in D of longest possible length.
(e) Is D weakly connected?
(f) Is D strongly connected? If so, give an example of a directed path from u
to u for each pair of vertices u and v of D. If D is not strongly connected,
find a pair of vertices u and v such that u is not reachable from v.

Added by Megan D.

Question

Please give Ace some feedback