ACM-最短/长路径
最短/长路径(Dijkstra/Floyd/SPFA)
luyehao1
ACMer
展开
-
Minimum Distance in a Star Graph(南宁网络赛)
In this problem, we will define a graph called star graph, and the question is to find the minimum distance between two given nodes in the star graph.Given an integer nnn, an n−dimensionaln-dimensionaln−dimensional star graph, also referred to as SnS_{n}原创 2017-09-24 19:35:55 · 368 阅读 · 0 评论 -
Schedule Problem (HDU 1534 差分约束+SPFA)
A project can be divided into several parts. Each part should be completed continuously. This means if a part should take 3 days, we should use a continuous 3 days do complete it. There are four types of constrains among these parts which are FAS, FAF, SAF原创 2017-07-24 14:19:38 · 304 阅读 · 0 评论 -
SPFA求最短路并保存最短路径
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <vector>#include <queue>#include <algorithm>using namespace std;const原创 2018-02-28 15:24:45 · 1201 阅读 · 2 评论 -
1003 Emergency(两点间最短路径的条数)
题目链接:1003 Emergency 题意:给定一张图,且每个节点有一个权值,给定起点和终点,求起点和终点之间最短路径的条数和权值和最大值。 思路:对dijkstra算法进行一定变形即可。用tot[i]表示起点到第i个点最短路径的条数。num[i]表示起点到第i个点的最短路中权值和的最大值,dis[i]表示当前从起点到i的最短路的距离。因此只需在最后的更新操作中进行适...原创 2019-02-22 14:35:24 · 807 阅读 · 0 评论