/* * Copyright (c) 2005-2006 Erik Tigerholm * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */ using System; using System.Collections.Generic; using System.Text; namespace OpenTraffic.Model.Graph.Partioning { public class MultiVertex : Vertex where TV : Vertex { [System.Diagnostics.CodeAnalysis.SuppressMessage("Microsoft.Design", "CA1006:DoNotNestGenericTypesInMemberSignatures")] public List>> Edges { get; private set; } public float Weight { get; private set; } private List> nodes; public MultiVertex(TV v) : base(v.Id, v.Name, v.X, v.Y) { nodes = new List>(); this.Weight = 1; Edges = new List>>(); } public void Join(MultiVertex mv) { if (mv != null) { nodes.Add(mv); Weight += mv.Weight; foreach (GraphEdge> e in mv.Edges) { Edges.Add(e); } } } public MultiVertex Reverse() { MultiVertex v1 = nodes[nodes.Count - 1]; Weight -= v1.Weight; nodes.RemoveAt(nodes.Count - 1); return v1; } public override string ToString() { return "mVertx: " + Id + " #" + nodes.Count; } } }