Question

using warshall's algorithm to find shortest path

Answer 1

\[\left[\begin{matrix}0 & 0 & 0 & 1 \\ 1 & 0 & 1 & 1 \\ 1 & 0 & 0 & 1 \\ 0 & 0& 1 & 0\end{matrix}\right]\]

Answer 2

thats the adjacency matrix

Answer 3

@hartnn @BSwan @dan815 @shrutipande9

Answer 4

@Miracrown

Answer 5

@ganeshie8

Answer 6

A : D
B : A, C, D
C : A, D
D : C

Answer 7

what does the algorithm say ?

Answer 8

how did you get that

Answer 9

thats just the adjacency list corresponding to ur matrix

Answer 10

okay input is weight matrix
output should be bath matrix
process is
if W[i,j]=0 then Q[i.j]=0
else Q[i,j]= 1

Answer 11

w is weight matrix, Q is path matrix

Answer 12

whats the start vertex and end vertex ?

Answer 13

Oh this algorithm finds all pairs shortest path is it

Answer 14

yeah

Answer 15

and its big big,2-3 page long

Answer 16

i wont be of much use i guess @BSwan @dan815

Answer 17

thats alright

Answer 18

step 1 ? O.O

Answer 19

process is
if W[i,j]=0 then Q[i.j]=0
else Q[i,j]= 1
thats step 1

Answer 20

ok then set Q
\(\left[\begin{matrix}0 & 0 & 0 & 1 \\ 1 & 0 & 1 & 1 \\ 1 & 0 & 0 & 1 \\ 0 & 0& 1 & 0\end{matrix}\right]\)
oh so W= Q :D

Answer 21

o_o

Answer 22

haha just messing with u :P

Answer 23

-.-

Answer 24

xD
couldnt understand it hehe
http://cs.winona.edu/lin/cs440/ch08-2.pdf

Answer 25

loool :P

Answer 26

And O there are days in this life, worth life and worth death.

Charles wingspanens c:

Answer 27

haha
ups and downs

Answer 28

ill try to learn this
https://www.youtube.com/watch?v=IcDS7EjXxpU

Answer 29

why :O
its okay if u dont know

Answer 30

through A



\(\left[\begin{matrix}0 & 0 & 0 & 1 \\ 1 & 0 & 1 & 1 \\ 1 & 0 & {\color{red
}{1}} & 1 \\ {\color{red}{1}} & 0& 1 & {\color{red}{1}} \end{matrix}\right]\)