Fewest nodes on a path when one vertex may be broken

Find the path between two nodes of a graph that passes through the fewest nodes, and return that count. One vertex may be broken and unusable: handle both the case where it matters and where it does not, and explain how your search changes.