Warning: session_start(): open(/tmp/sess_2ac42e2e64d47194aacdfeca5495dc50, O_RDWR) failed: No space left on device (28) in /data/wiki/inc/init.php on line 239
Warning: session_start(): Failed to read session data: files (path: ) in /data/wiki/inc/init.php on line 239
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/auth.php on line 430
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103
Warning: Cannot modify header information - headers already sent by (output started at /data/wiki/inc/init.php:239) in /data/wiki/inc/Action/Export.php on line 103
/*
朱刘算法是干什么的呢
给定一个有向图以及点X，求以X为根节点的最小生成树（有向）
*/
#include
#include
#include
#include
#include
#define maxn 10005
using namespace std;
struct nod
{
int x,y;
double w;
nod(){}
}edge[maxn];
int n,m,root;
double x[maxn],y[maxn];
int id[maxn],vis[maxn],pre[maxn];
double in[maxn];
double zhuliu()
{
double ans=0;
int sz=n;
while(1)
{
for(int i=1;i<=sz;i++)
in[i]=123456789.0,vis[i]=id[i]=0;
for(int i=1;i<=m;i++)
{
if( edge[i].w