joselynflores574
joselynflores574
13.07.2019 • 
Mathematics

With the attached second question
1. using warshall’s algorithm, compute the reflexive-transitive closure of the relation below. show the matrix after the reflexive closure and then after each pass of the outermost for loop that computes the transitive closure.
[ 111100010010101]
2. using the matrix in the previous problem show the final result of executing floyd’s algorithm on that matrix to produce a matrix containing path lengt

Solved
Show answers

Ask an AI advisor a question