class Solution {public: double maxProbability(int n, vector<vector<int>>& edges, vector<double>& succProb, int start, int
class Solution {public: int networkDelayTime(vector<vector<int>>& times, int n, int k) { int inf=INT_MAX/2; vector<
Dijkstra求最短路径原题链接代码#include<iostream>#include<cstring>using namespace std;const int N=510,M=1e5+10,INF=0x3f3f3f3f;int n,m,g[N][N],dist[N];