Efficient way to find a path from start to finish

I am currently doing an assignment where we need to find a path from a node on an undirected graph, the start node, to the destination node without changing the type of edge (each edge is labelled with a letter) more than a specified amount of times. (E.g. If only one change is allowed, then going from an edge labelled 'a' to an edge labelled 'b' will use up that one change. But going from 'a' to 'a' will not use up any changes). We can only use Depth First...

Read More »

By: StackOverFlow - 7 days ago

Related Posts