某公司于乙城市的销售点急需一批成品，该公司成品生产基地在甲城市。 甲城市与乙城市之间共有n 座城市，互相以公路连通。甲城市、乙城市以及其它各城市之间的公路连通情况及每段公路的长度由矩阵 M1 给出。 每段公路均由地方政府收取不同额度的养路费等费用，具体数额由矩阵M2 给出。 请给出在需付养路费总额不超过1500 的情况下，该公司货车运送其产品从甲城市到乙城市的最短运送路线。 具体数据参见文件： M1.txt: 各城市之间的公路连通情况及每段公路的长度矩阵(有向图) 甲城市为城市Num.1，乙城市为城市Num.50。 M2.txt: 每段公路收取的费用矩阵（非对称）。

SY0906128-谭超-Assignment_2（分支定界）
.......................................\Debug
.......................................\.....\path.exe
.......................................\.....\path.ilk
.......................................\.....\path.obj
.......................................\.....\path.pch
.......................................\.....\path.pdb
.......................................\.....\vc60.idb
.......................................\.....\vc60.pdb
.......................................\m1.txt
.......................................\m2.txt
.......................................\path.cpp
.......................................\path.dsp
.......................................\path.dsw
.......................................\path.ncb
.......................................\path.opt
.......................................\path.plg

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．