Raku 语言 智慧物流 优化仓储管理与配送路径规划

method new($capacity) {
self.bless(:items(Hash.new), :capacity($capacity));
}

method add-item($item, $quantity) {
if $.items.exists($item) {
$.items{$item} += $quantity;
} else {
$.items{$item} = $quantity;
}
return self;
}

method remove-item($item, $quantity) {
if $.items.exists($item) && $.items{$item} >= $quantity {
$.items{$item} -= $quantity;
if $.items{$item} == 0 {
$.items.delete($item);
}
}
return self;
}

method list-items {
$.items.keys.sort;
}
}

method add-node($node) {
%.nodes{$node} = {};
}

method add-edge($from, $to, $weight) {
%.edges{$from}{$to} = $weight;
%.edges{$to}{$from} = $weight; Assuming undirected graph
}

method dijkstra($start) {
my %distances = %(.nodes).map(.key => Inf);
%distances{$start} = 0;
my %previous = %(.nodes).map(.key => None);

my @queue = %distances.keys.sort({ %distances{$_} });

while @queue {
my $current = @queue.shift;
for %(.edges{$current}).keys -> $neighbor {
my $alt = %distances{$current} + %.edges{$current}{$neighbor};
if $alt < %distances{$neighbor} {
%distances{$neighbor} = $alt;
%previous{$neighbor} = $current;
}
}
@queue = @queue.grep( ne $current).sort({ %distances{$_} });
}

return %distances, %previous;
}
}

my $graph = Graph.new;
$graph.add-node('A');
$graph.add-node('B');
$graph.add-node('C');
$graph.add-node('D');
$graph.add-edge('A', 'B', 1);
$graph.add-edge('B', 'C', 2);
$graph.add-edge('C', 'D', 3);
$graph.add-edge('A', 'D', 4);

method new(@nodes, @distances) {
self.bless(:nodes(@nodes), :distances(@distances));
}

method solve {
my @solution = @.nodes[0];
my $current = @solution[-1];
my @unvisited = @.nodes[1..];

while @unvisited {
my $next = @unvisited[0];
for @unvisited -> $node {
if %.distances{$current}{$node} < %.distances{$current}{$next} {
$next = $node;
}
}
@solution.push($next);
$current = $next;
@unvisited.splice(@unvisited.index($next), 1);
}
return @solution;
}
}

my @nodes = ;
my @distances = (
,
,
,
,
,