networkx/networkx — pull request #762 by aparamon (2012-08-29 18:21:44+00:00)
Title: Shortest path algorithms with restrictions

Many interesting algorithms e.g. Yen's k-shortest simple paths, White's node-independent paths require a procedure for finding shortest path with restrictions:

* ignore a subset of graph nodes
* ignore certain graph edges

It is proposed to introduce optional ignore_nodes and ignore_edges parameters for all shortest path procedures.

Here is the initial version (only supporting shortest_path, unweighted case).