首先我们设电流为1A 终点电势为零 点i的电势为Ui
由于电流是流 显然对于每个点(点1和点n除外) 有总流入等于总流出 即
Σ(Ui-Uj)/Rij=0 (i!=1,i!=n)
Σ(U1-Uj)/R1j=1
Σ(Un-Uj)/Rnj=-1
Un=0
联立方程组高斯消元即可 最后输出点1的电势就是答案
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#define cl(x) memset(x,0,sizeof(x))
using namespace std;
const int M=505;
int n,m;
double map[M][M],f[M][M],ans[M];
inline void Gauss()
{
for (int i=1;i<=n;i++)
{
int k=0;
for (int j=i;j<=n;j++) if (fabs(f[j][i])>fabs(f[k][i])) k=j;
for (int j=1;j<=n+1;j++) swap(f[i][j],f[k][j]);
for (int j=i+1;j<=n;j++)
{
double tmp=f[j][i]/f[i][i];
for (int k=i;k<=n+1;k++)
f[j][k]-=f[i][k]*tmp;
}
}
for (int i=n;i;i--)
{
for (int j=n;j>i;j--) f[i][n+1]-=ans[j]*f[i][j];
ans[i]=f[i][n+1]/f[i][i];
}
}
int main()
{
int ix,iy,ir;
while (~scanf("%d%d",&n,&m))
{
cl(map); cl(f);
for(int i=1;i<=m;i++)
scanf("%d%d%d",&ix,&iy,&ir),map[ix][iy]+=1.0/ir,map[iy][ix]+=1.0/ir;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f[i][i]+=map[i][j],f[i][j]-=map[i][j];
f[1][n+1]=1; f[n][n+1]=-1; f[n][n]+=1.0;
Gauss();
printf("%.2lf\n",ans[1]);
}
return 0;
}