Python Forum

I am learning how to use PuLP for linear optimisation and I am interested in plugging a constrained pathfinding problem (Dijkstra) into my use of PuLP.
I am keen to establish feasibility as I have scoured google and that didn't turn up much.
If anyone has tried this before please assist.
Thanks.

Not sure if you looked through the examples (or if what you are looking for is in there), but here's the URL: https://github.com/coin-or/pulp/tree/master/examples

Thank you. Some of the examples are what I need.