Finding shortest path between two nodes with a set of forbidden nodes
Create two directed copies of the graph, one without the forbidden nodes. Connect the outgoing edges of the "forbidden" nodes to the second graph.