/// <summary> /// Constructor which initializes a single empty block with BlockWeight 1. /// </summary> /// <param name="votedNodeIndex"></param> public NodeVoting(int votedNodeIndex) { VotedNodeIndex = votedNodeIndex; VotingBlocks=new List<VoteBlock>(); var voteBlock = new VoteBlock(new List<Vote>(), 1); VotingBlocks.Add(voteBlock); }
/// <summary> /// Constructor which initializes a single empty block with BlockWeight 1. /// </summary> /// <param name="votedNodeIndex"></param> public NodeVoting(int votedNodeIndex) { VotedNodeIndex = votedNodeIndex; VotingBlocks = new List <VoteBlock>(); var voteBlock = new VoteBlock(new List <Vote>(), 1); VotingBlocks.Add(voteBlock); }
/// <summary> /// Inits the datastructures, later forces can be defined on the nodes. /// </summary> /// <param name="majorizer"></param> /// <param name="nodes"></param> /// <param name="nodePositions"></param> static void InitStressWithGraph(StressMajorization majorizer, Node[] nodes, Point[] nodePositions) { majorizer.Positions = new List<Point>(nodePositions); majorizer.NodeVotings = new List<NodeVoting>(nodes.Length); for (int i = 0; i < nodes.Length; i++) { var nodeVote = new NodeVoting(i); //add second block for separate weighting of the overlap distances var voteBlock = new VoteBlock(new List<Vote>(), 100); // nodeVote.VotingBlocks[0].BlockWeight = 0; nodeVote.VotingBlocks.Add(voteBlock); majorizer.NodeVotings.Add(nodeVote); } }