Giters

Data-Driven-World / d2w_ml_notes

Notes for Data Driven World

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Typo in Graph_Search.ipynb

iangohy opened this issue · comments

commented

Depth-First Search

In the figures above, every time we visit a vertex, we put a timestamp on that vertex called discovery time. Once we finish visiting all the neighbours of that vertex, we put another timestamp called finishing time. For example, vertex A has a discrovery discovery time 1 and finishing time 12 as indicated by 1/12 in the figure.