Page 1 of 1
السؤال 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
Posted: Sat Nov 27, 2021 10:36 am
by answerhappygod
- 1 (19.88 KiB) Viewed 49 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 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