suppose I have a graph in which a single floating point value is contained in each vertex. The configuration of values in the graph needs to be rearranged by transferring selected portions of each value and moving it along the edge into a new vertex. Each of these transfers is known as a step. How do I rearrange the graph from a given configuration to a target configuration in the least number of steps?
