I wish I knew the correct terminology for the question that I would like to ask, but I don't, so please forgive me if I am not calling the right things by the right names. The practical problem that I am trying to solve (and whose specific nature is to do with data compression) can be phrased as follows:
We have a directed graph with a number of parallel edges with positive weights. So, I am guessing that this might be called a directed weighted multigraph. I need to construct a shortest path on this multigraph, but I cannot use any standard algorithms for it because my graph also happens to be dynamic.
Now, when I tried searching academic literature on dynamic multigraphs, they usually talk about the graphs where you have to be able to reconstruct your shortest path as you follow it, e.g. maybe for realtime traffic navigation. My graph is different in that it does not change due to an external factor. However, it changes every time when particular edge is selected to be a part of the shortest path. So it is as if once you choose edge 1 from node A to B for your shortest path/spanning tree, you disable edges 3-5 from node B to other nodes. So, the graph is changing as the direct result of our traversal.
I am hoping that this kind of dynamic graph problem can have another name, so that I can try to find some academic literature on how one can attack problems of this kind. Or, maybe there is a standard way of recasting this type of problems that makes them more aminable to the efficient computation. Basically, I would appreciate any pointers on how I can try dealing with something like this efficiently, i.e. without setting up direct brute-force iteration through all possible options.
