/// <summary>
/// Starting run algorithm with specific source topology and K-diameter cut,
/// and this round process will generate scope topology to scop_net_topo,
/// and will add the deployment node to deployNodes structure.
/// Finally, it will return the remain network topology with this process.
/// </summary>
/// <param name="src_net_topo">The source network topology</param>
/// <param name="K">The K-diameter cut value</param>
/// <param name="scope_net_topo">This round process that generte scope topology</param>
/// <param name="deployNodes">The result of the deployment node id</param>
/// <returns>The remain network topology after process the algorithm.</returns>
private NetworkTopology startAlgorithm(NetworkTopology src_net_topo, int K, ref NetworkTopology scope_net_topo, ref List <int> deployNodes)
{
double max_hop_count = double.MinValue;
while (max_hop_count < K)
{
int minDegree = int.MaxValue;
int selectNode = -1;
// to finding the neighbor node with minimum degree
foreach (var scopeNode in scope_net_topo.Nodes)
{
foreach (int neighbor in src_net_topo.GetNeighborNodeIDs(scopeNode.ID))
{
if (!scope_net_topo.Nodes.Exists(x => x.ID == neighbor))
{
if (minDegree > src_net_topo.Nodes.Find(n => n.ID == neighbor).Degree)
{
minDegree = src_net_topo.Nodes.Find(n => n.ID == neighbor).Degree;
selectNode = neighbor;
}
}
}
}
// if nothing found, break the loop.
if (selectNode == -1)
{
break;
}
// adding the node to the scope set, and computing the max hop count.
else
{
scope_net_topo.Nodes.Add(src_net_topo.Nodes.Find(n => n.ID == selectNode));
foreach (var scopeNode in scope_net_topo.Nodes)
{
scope_net_topo.Edges.AddRange(src_net_topo.Edges.Where(e =>
e.Node1 == scopeNode.ID && e.Node2 == selectNode ||
e.Node1 == selectNode && e.Node2 == scopeNode.ID)
.ToList());
}
scope_net_topo.ComputingShortestPath();
foreach (var node1 in scope_net_topo.Nodes)
{
foreach (var node2 in scope_net_topo.Nodes)
{
int hop_count = scope_net_topo.GetShortestPath(node1.ID, node2.ID).Count;
if (max_hop_count < hop_count)
{
max_hop_count = hop_count;
}
}
}
}
}
List <int> tmp = new List <int>();
NetworkTopology remain_topo;
// Handling the neighbor nodes of each node in the scope network topology.
foreach (var scopeNode in scope_net_topo.Nodes)
{
tmp.AddRange(src_net_topo.GetNeighborNodeIDs(scopeNode.ID).Except(scope_net_topo.Nodes.Select(x => x.ID)));
}
tmp = tmp.Distinct().ToList();
// During above process the tmp list will be deployment nodes, and add to deployNodes list.
deployNodes.AddRange(tmp);
// Adding deploy nodes to the scope network topology.
foreach (int id in tmp)
{
scope_net_topo.Nodes.AddRange(src_net_topo.Nodes.Where(x => x.ID == id).ToList());
}
// Adding deploy nodes's edge to the scope network topology.
foreach (var scopeNode in scope_net_topo.Nodes)
{
scope_net_topo.Edges.AddRange(src_net_topo.Edges.Where(x => x.Node1 == scopeNode.ID || x.Node2 == scopeNode.ID).ToList());
}
scope_net_topo.Edges = scope_net_topo.Edges.Distinct().ToList();
// Computing the complement set between source and scope network topology.
remain_topo = src_net_topo - scope_net_topo;
// Computing the complement set's shortest path.
//remain_topo.ComputingShortestPath();
// Removing deployment nodes and edges from scope network topology.
foreach (int id in tmp)
{
scope_net_topo.Nodes.RemoveAll(x => x.ID == id);
scope_net_topo.Edges.RemoveAll(x => x.Node1 == id || x.Node2 == id);
}
return(remain_topo);
}
