cyp0633
/
homework
mirror of https://github.com/cyp0633/homework.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

CSP 5-1 dijkstra Dijkstra? 

Eliminate warnings & format
This commit is contained in:
cyp0633 2021-07-12 08:34:56 +08:00
parent 08e3f37741
commit 71f1457cf7
1 changed files with 44 additions and 43 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

87
CSP-Training/5/1-dijkstra.cpp
View File

@ -6,13 +6,52 @@
using namespace std;
int graph[10000][10000];
bool Greater(const vector<int> &a, vector<int> b, int n); //先把n推入vector b中
int *Dijkstra(int source, int n)
void Dijkstra(int source, int n);
int main()
{
int n, m, s, source, dest, weight;
scanf("%d %d", &n, &m);
s = 1;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
graph[i][j] = (1 << 30) - 1;
}
graph[i][i] = 0;
}
for (int i = 0; i < m; i++)
{
scanf("%d %d %d", &source, &dest, &weight);
if (graph[source - 1][dest - 1] > weight)
{
graph[source - 1][dest - 1] = weight;
graph[dest - 1][source - 1] = weight;
}
}
Dijkstra(s - 1, n);
return 0;
}
bool Greater(const vector<int> &a, vector<int> b, int n)
{
b.push_back(n);
int minLen = a.size() < b.size() ? a.size() : b.size();
for (int i = 0; i < minLen; i++)
{
if (a[i] != b[i])
{
return a[i] > b[i];
}
}
return false;
}
void Dijkstra(int source, int n)
{
int *dist = new int[n + 1], mark[n + 1];
vector<int> routeStr[n];
for (int i = 0; i < n + 1; i++)
{
dist[i] = 1 << 31 - 1;
dist[i] = (1 << 30) - 1;
mark[i] = 0;
}
routeStr[0].push_back(1);
@ -43,52 +82,14 @@ int *Dijkstra(int source, int n)
}
}
}
if (dist[n - 1] == 1 << 31 - 1)
if (dist[n - 1] == (1 << 30) - 1)
{
printf("-1");
return dist;
return;
}
for (vector<int>::iterator i = routeStr[n - 1].begin(); i != routeStr[n - 1].end(); i++)
{
printf("%d ", *i);
}
return dist;
}
int main()
{
int n, m, s, source, dest, weight;
scanf("%d %d", &n, &m);
s = 1;
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
graph[i][j] = 1 << 31 - 1;
}
graph[i][i] = 0;
}
for (int i = 0; i < m; i++)
{
scanf("%d %d %d", &source, &dest, &weight);
if (graph[source - 1][dest - 1] > weight)
{
graph[source - 1][dest - 1] = weight;
graph[dest - 1][source - 1] = weight;
}
}
int *dist = Dijkstra(s - 1, n);
return 0;
}
bool Greater(const vector<int> &a, vector<int> b, int n)
{
b.push_back(n);
int minLen = a.size() < b.size() ? a.size() : b.size();
for (int i = 0; i < minLen; i++)
{
if (a[i] != b[i])
{
return a[i] > b[i];
}
}
return false;
return;
}