带负权边的图如何最短路计数

学术版

Floyd?
by caramel_qwq @ 2022-05-14 21:12:46


@[caramel_qwq](/user/444195) floyd好像更加不行吧
by Graygoo @ 2022-05-14 21:14:37


dijkstra魔改
by liqingyang @ 2022-05-14 21:15:22


BellmanFord有啥问题啊
by 鏡音リン @ 2022-05-14 21:18:23


Bellan Ford可行
by zzq_666 @ 2022-05-14 21:20:30


~~不会SPFA和Bellan Ford,不管可不可行dijkstra都可行~~
by liqingyang @ 2022-05-14 21:22:08


@[liqingyang](/user/272088) 不可行
by Lacrymabre @ 2022-05-14 21:26:32


@[Intarely](/user/120438) 为什么?~~另外我说的是魔改的dijkstra~~
by liqingyang @ 2022-05-14 21:26:59


@[liqingyang](/user/272088) 您指的是Johnson那样的处理方式吗
by Graygoo @ 2022-05-14 21:27:37


@[Graygoo](/user/535714) ~~都不会~~,反正大概就是魔改一下dijkstra就能求负权最短路,然后应该再加个计数就行了
by liqingyang @ 2022-05-14 21:28:27


| 下一页