poj图论解题报告索引

poj1125 - Stockbroker Grapevine(多源最短路径,floyd)

poj1502 - MPI Maelstrom(单源最短路径,dijkstra,bellman-ford,spfa)

poj1511 - Invitation Cards(单源来回最短路径,spfa邻接表)

poj1797 - Heavy Transportation(最大边,最短路变形,dijkstra,spfa,bellman-ford)

poj2240 - Arbitrage(汇率问题,floyd)

poj1860 - Currency Exchange(汇率问题,bellman-ford,spfa)

poj2253 - Frogger(最大边,dijkstra变形)

poj2387- Til the Cows Come Home(单源最短路径,dijkstra,spfa,bellman-ford)

poj2502 - Subway(卡输入的最短路径,dijkstra,floyd)

poj3259 - Wormholes(判断负环,bellman-ford)

poj3268 - Silver Cow Party(来回最短路径,dijkstra)

poj1158 - TRAFFIC LIGHTS(最短路变形)

poj1122 - FDNY to the Rescue!(最短路径变形)

poj1161 - Walls(最短路径,floyd,建图)

poj1734 - Sightseeing trip(最小环,floyd变形)

poj3255 - Roadblocks(次短路径)

poj1251 - Jungle Roads(最小生成树,prim,kruskal)

poj1287 - Networking(最小生成树,prim,kruskal)

poj1258 - Agri-Net(最小生成树,prim)

poj1861- Network(最小生成树,kruskal)

poj2485 - Highways(最小生成树,prim)

poj3522 - Slim Span(最小生成树变形,kruskal)

poj3625 - Building Roads(已经存在一些边的最小生成树,kruskal)

poj3026 - Borg Maze(BFS+prim最小生成树)

poj1635 - Subway tree systems(判断两颗树是否一样)

poj1679 - The Unique MST(是否唯一最小生成树)

poj1789 - Truck History(最小生成树)

poj2031 - Building a Space Station(最小生成树)

poj2377 - Bad Cowtractors(最大生成树)

poj2553 - The Bottom of a Graph(强连通分量,邻接表tarjan与kosaraju)

poj2186 - Popular Cows(强连通分量,邻接表tarjan与kosaraju)

poj1236 - Network of Schools(强连通分量,邻接矩阵tarjan与kosaraju)

poj1523 - SPF(tarjan求割点)

poj1966 - Cable TV Network(求最小割点集，转换为最大流)

poj1904 - King‘s Quest(已知完美匹配，求所有匹配，强连通分量建图)

poj3177 - Redundant Paths(边双连通分量)

poj3352 - Road Construction(边双连通分量)

poj1459 - Power Network(最大流入门)

poj1273 - Drainage Ditches(最大流)

poj1698 - Alice‘s Chance(最大流)

poj3469 - Dual Core CPU(最大流)

poj1149 - PIGS(最大流)

poj3281 - Dining(最大流)

poj2135 - Farm Tour(费用流)

poj2516 - Minimum Cost(费用流)

poj2195 - Going Home(费用流)

poj1087 - A Plug for UNIX(最大流,建图)

poj1274 - The Perfect Stall(二分最大匹配)

poj3041 - Asteroids(二分最大匹配)

poj2226 - Muddy Fields(二分最大匹配)

poj1486 - Sorting Slides(二分最大匹配或拓扑排序)

poj2400 - Supervisor, Supervisee(KM二分最佳匹配)

poj1325 - Machine Schedule(最小点覆盖)

poj1422 - Air Raid(最小路径覆盖)

poj1466 - Girls and Boys(最大独立集)

poj1548 - Robots(最小路径覆盖)

1719 - Shooting Contest(二分最大匹配)

poj2060 - Taxi Cab Scheme(最小路径覆盖)

poj2239 - Selecting Courses(最大匹配数)

poj1201 - Intervals(区间差分约束)

poj1275 - Cashier Employment(差分约束)

poj1364 - King(差分约束)

poj2983 - Is the Information Reliable?(差分约束)

poj1752 - Advertisement(差分约束)

poj1135 - Domino Effect(拓扑排序)

1659 - Frogs‘ Neighborhood