Let G be a digraph.The two-objective optimal path problem is to find a path which has the maximum weight and minimum cost in G.

 
  • 雙目標最優(yōu)路問(wèn)題是指在一個(gè)圖中找這樣的路,使其權最大,費用最少。
今日熱詞
目錄 附錄 查詞歷史
国内精品美女A∨在线播放xuan