Find centralized, trusted content and collaborate around the technologies you use most.
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
哪种算法可以找到有向子图(由相同的顶点和最少的边组成),并且所有路径都将保留?
G(V,E) --> 在 E 中找到 V=V & E' 的最小 G'(V,E'),并且所有路径都保留。
谢谢。