- 1 (19.88 KiB) Viewed 68 times
السؤال 1 A directed graph has 6 nodes and the following direct paths: from node 3 to 1; from node 6 to 1; from node 3 to
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
السؤال 1 A directed graph has 6 nodes and the following direct paths: from node 3 to 1; from node 6 to 1; from node 3 to
السؤال 1 A directed graph has 6 nodes and the following direct paths: from node 3 to 1; from node 6 to 1; from node 3 to 2; from node 5 to 3; from node 1 to 6; from node 2 to 6; Construct the adjacency matrix A to represent this graph. Use the Warshall Algorithm to find the Transitive Closure T. Write the last row of the Transitive Closure here
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!