Heat Wave

The good folks in Texas are having a heatwave this summer. Their Texas Longhorn cows make for good eating but are not so adept at creating creamy delicious dairy products. Farmer John is leading the charge to deliver plenty of ice cold nutritious milk to Texas so the Texans will not suffer the heat too much.
FJ has studied the routes that can be used to move milk from Wisconsin to Texas. These routes have a total of T (1 <= T <= 2,500) towns conveniently numbered 1…T along the way (including the starting and ending towns). Each town (except the source and destination towns) is connected to at least two other towns by bidirectional roads that have some cost of traversal (owing to gasoline consumption, tolls, etc.). Consider this map of seven towns; town 5 is the source of the milk and town 4 is its destination (bracketed integers represent costs to traverse the route):
[1]----1—[3]-
/
[3]—6---[4]—3–[3]–4
/ / /|
5 --[3]-- --[2]- |
\ / / |
[5]—7---[2]–2—[3]—
| /
[1]------
Traversing 5-6-3-4 requires spending 3 (5->6) + 4 (6->3) + 3 (3->4) = 10 total expenses.
Given a map of all the C (1 <= C <= 6,200) connections (described as two endpoints R1i and R2i (1 <= R1i <= T; 1 <= R2i <= T) and costs (1 <= Ci <= 1,000), find the smallest total expense to traverse from the starting town Ts (1 <= Ts <= T) to the destination town Te (1 <= Te <= T).

• Line 1: Four space-separated integers: T, C, Ts, and Te
• Lines 2…C+1: Line i+1 describes road i with three space-separated integers: R1i, R2i, and Ci
• Line 1: A single integer that is the length of the shortest route from Ts to Te. It is guaranteed that at least one route exists.
  输入
  7 11 5 4
  2 4 2
  1 4 3
  7 2 2
  3 4 3
  5 7 5
  7 3 3
  6 1 1
  6 3 4
  2 4 3
  5 6 3
  7 2 1

输出
7
说明
5->6->1->4 (3 + 1 + 3)

题意就是有几个小镇各个小镇之间有一些路线，不同的路线会有不同的消耗，
求给点两个小镇之间的最小消耗。
思路：Dijkstra用在无向图，水题一道，话不多说直接上代码，不懂Dijkstra
算法的自行百度。

#include<bits/stdc++.h>
#include<unordered_map>
#define N 2501 
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int MAXN = 1e6 + 10;
const int inf = 0x3f3f3f3f;
inline ll fpow(ll a, ll b){ ll r = 1, t = a; while (b){ if (b & 1)r = (r*t) % MOD; b >>= 1; t = (t*t) % MOD; }return r; }
multiset<int>ve;
struct node{
 int x,y;
 bool operator<(const node &b) const{
  return y>b.y;
 }
}v[MAXN];
int dis[N],e[N][N],book[N],u,minx;
int t1,t2,t3;
int main()
{
 int n,m,bx,by;
 cin>>n>>m>>bx>>by;
 for(int i=1;i<=n;i++)
 for(int j=1;j<=n;j++)
 if(i==j)e[i][j]=0;
 else e[i][j]=inf;
 
 for(int i=1;i<=m;i++)
 {
  cin>>t1>>t2>>t3;
  if(e[t1][t2]>t3)
  {
    
  e[t1][t2]=t3;
  e[t2][t1]=t3;
  }
 
 }
 for(int i=1;i<=n;i++)
 dis[i]=e[bx][i];
 book[bx]=1;
 for(int i=1;i<n;i++)
 {
  minx=inf;
  for(int j=1;j<=n;j++)
  {
   if(!book[j]&&dis[j]<minx)
   {
    minx=dis[j];
    u=j;
   }
  }
  book[u]=1;
  for(int v=1;v<=n;v++)
  {
   if(e[u][v]<inf&&dis[v]>dis[u]+e[u][v])
   {
    dis[v]=dis[u]+e[u][v];
   }
  }
 }
// for(int i=1;i<=n;i++)
 cout<<dis[by]<<endl;
 
 
 
}