algorithm - 查找图突变序列(Find graph mutation sequence)

Question

Im trying to find any algorithm which finds graph mutation sequence for game engine.

(我试图找到任何能找到游戏引擎图形突变序列的算法。)

Problem: Weighted graph A should be mutated to graph B. There is a rule: you are limited to actions: you cannot modify/add/remove more than two nodes in a same time.

(问题：加权图A应该突变为图B。有一个规则：您仅限于操作：您不能同时修改/添加/删除两个以上的节点。)

Algorithm should find a sequence of actions on nodes.

(算法应在节点上找到一系列动作。)

Is there any algorithm/similar example which do similar thing?

(有没有做类似事情的算法/类似例子？)

Even greedy one.

(甚至贪婪的一个。)

Thanks in advance.

(提前致谢。)

  ask by Olexander Korenyuk translate from so

Answer 1

等待大神答复