Hi everyone, I have got an adjacency matrix here which gives my graph in R.
But is there any way to write Breadth First Search algorithm to obtain path
matrix? I'm really new to R, can anybody please help?
I know the idea but just don't know how to write it, basically I am trying
to look at only upper triangle in the matrix, and I hope to be able to look
at every entry and therefore obtain path matrix which gives me the path
length for every vertex from all other vertices.
Thanks a lot, please give me a hand.
--
View this message in context:
http://r.789695.n4.nabble.com/path-matrix-tp4655805.html
Sent from the R help mailing list archive at Nabble.com.
