new routing algorithm
This commit is contained in:
1 parent
37598479cc
commit
acfb2719e2
11 files changed
+671
-351
No files matched your search
+5
-4
@@ -42,12 +42,13 @@ function [obj] = run(obj)
|
||||
% plotting purposes, the real partitioning is done by the agents)
|
||||
[obj.partitioning, obj.agents] = obj.agents{1}.partition(obj.agents, obj.domain.objective);
|
||||
|
||||
% Determine desired communications links: lesser-neighbor gives the
|
||||
% low-level connectivity topology; routing mode overlays bulk links
|
||||
% Determine desired communications links: the Capacity-Aware Lesser
|
||||
% Sink Neighbor algorithm replaces lesser-neighbor when selected
|
||||
if ~obj.useFixedTopology
|
||||
obj = obj.lesserNeighbor();
|
||||
if coder.target('MATLAB') && obj.useRoutingTopology
|
||||
obj = obj.routeTopology();
|
||||
obj = obj.lesserSinkNeighbor();
|
||||
else
|
||||
obj = obj.lesserNeighbor();
|
||||
end
|
||||
end
|
||||
|
||||
|
||||
Reference in new issue
Block a user