public void linkLink()
{
w1 = new GraphAlgos.Weg(this, this.node2, this.node1);
w2 = new GraphAlgos.Weg(this, this.node1, this.node2);
node1.AddWeg(w1);
node2.AddWeg(w2);
}
public PathPos(Path path, Vector3 pt, Weg weg, int index, float lambda)
{
this.path = path;
this.pt = pt;
this.weg = weg;
this.index = index;
this.lambda = lambda;
}
public void DelWeg(Weg weg)
{
if (wegtos == null)
{
wegtos = new HashSet <Weg>();
}
wegtos.Remove(weg);
}
public void AddWeg(Weg weg)
{
if (wegtos == null)
{
wegtos = new HashSet <Weg>();
}
wegtos.Add(weg);
}
public void AddWaypt(Weg w)
{
// should control to see if additions are consistent
waypts.Add(w);
if (waypts.Count == 1)
{
weg1Pt1 = w.link.node1.pt;
weg1Pt2 = w.link.node2.pt;
weg1FrPt = w.frNode.pt;
weg1ToPt = w.toNode.pt;
}
}
