James Pan

原题网址：https://leetcode.com/problems/word-ladder/Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWor

原题网址：https://leetcode.com/problems/word-ladder-ii/Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginWord to endWord, s

Dijkstra最短路径算法是计算某一点到其它点的最短距离的算法。Floyd算法是用来计算图中所有点之间的最短距离，可参考：http://developer.51cto.com/art/201403/433874.htm最小生成树（Minimium Spanning Tree）如果要在N个城市中铺设网络，每个城市之间的网络建设成本不同，如何找到一个建设方案，使得

原题网址：https://www.hackerrank.com/challenges/bfsshortreachGiven an undirected graph consisting of  nodes (labelled 1 to N) where a specific given node  represents the start position and

原题网址：https://leetcode.com/problems/shortest-distance-from-all-buildings/You want to build a house on an empty land which reaches all buildings in the shortest amount of distance. You can only