Regarding Random Walk

[deveshd...@gmail.com]

Hi,

I have a question about what is happening in this video at 00:02:49 -

http://www.youtube.com/watch?v=CgXkrjaox2I#t=169s.

If we move from node A to node B , and suppose that node B contains only 1 path , i.e., from node A , then can we traverse back to node A and move to some other node 'X' and if yes , how do we update our count ?.

Thanks!

---

Reference Key - Key('StudentQuestionEntity', 5771618586984448, namespace='ns_noc24_cs113')

[NOC243 CS113]

Hi,

If the path is only from A to B, and there is no path from B to A, we cannot go back to A and visit other nodes.
We are stuck at B. 

Thanks
TA