internal Lnk(Lnk e)
{
this.u = e.u;
this.v = e.v;
this.l = e.l;
this.c = e.c;
this.ek = e.ek;
}
internal Lnk(
int u,
int v,
int l,
int c,
EdgeKind ek,
Lnk next)
{
this.u = u;
this.v = v;
this.l = l;
this.c = c;
this.ek = ek;
this.next = next;
}
static Edge[] LnkToEdge(Lnk edge)
{
int n = 0;
Lnk l = edge;
while (l != null)
{
n++;
l = l.next;
}
Edge[] ret = new Edge[n];
l = edge;
n = 0;
while (l != null)
{
ret[n++] = new Edge(l.u, l.v, l.l, l.c);
l = l.next;
}
return(ret);
}
internal Lnk(Lnk e)
{
this.u = e.u;
this.v = e.v;
this.l = e.l;
this.c = e.c;
this.ek = e.ek;
}
internal Lnk(
int u,
int v,
int l,
int c,
EdgeKind ek,
Lnk next)
{
this.u = u;
this.v = v;
this.l = l;
this.c = c;
this.ek = ek;
this.next = next;
}
static Edge[] LnkToEdge(Lnk edge)
{
int n=0;
Lnk l=edge;
while(l != null)
{
n++;
l=l.next;
}
Edge[] ret=new Edge[n];
l=edge;
n=0;
while(l != null)
{
ret[n++]=new Edge(l.u,l.v,l.l,l.c);
l=l.next;
}
return ret;
}
