Series: #shortestdistance – Shortest distance in unweighted graphs Posted on August 5, 2019September 23, 2019 by braindenny Shortest distance in a graph Name Example When BFS examine the target before pushing, or wait after poping at the next level? What if starting and ending point is the same? Initialize level with 0 or 1? Link: Why can’t DFS be used to find shortest paths in unweighted graphs? CheatSheet: Leetcode For Code Interview See all series problems: #series Leetcode: Shortest Word Distance IIILeetcode: Shortest Way to Form StringLeetcode: Shortest Path with Alternating ColorsLeetcode: Shortest Path Visiting All NodesLeetcode: Shortest Path in Binary MatrixLeetcode: Shortest Distance to Target ColorLeetcode: Shortest Distance to a Character See more blog_posts. Post Views: 0