From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.6 (2021-04-09) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.6
Path: eternal-september.org!reader02.eternal-september.org!feeder1.feed.usenet.farm!feed.usenet.farm!aioe.org!Hx95GBhnJb0Xc8StPhH8AA.user.46.165.242.91.POSTED!not-for-mail
From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Newsgroups: comp.lang.ada
Subject: Re: Dijkstra and graphs
Date: Thu, 26 Aug 2021 14:48:49 +0200
Organization: Aioe.org NNTP Server
Message-ID: <sg82jh$1421$1@gioia.aioe.org>
References: <sg819f$lj1$1@dont-email.me>
Mime-Version: 1.0
Content-Type: text/plain; charset=windows-1252; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Info: gioia.aioe.org; logging-data="36929"; posting-host="Hx95GBhnJb0Xc8StPhH8AA.user.gioia.aioe.org"; mail-complaints-to="abuse@aioe.org";
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:78.0) Gecko/20100101
 Thunderbird/78.13.0
Content-Language: en-US
X-Notice: Filtered by postfilter v. 0.9.2
Xref: reader02.eternal-september.org comp.lang.ada:62544
List-Id: <comp.lang.ada>

On 2021-08-26 14:26, Björn Lundin wrote:

> In other words I'd like to dynamically change the weights.

Usually implementations of weighted graphs order outgoing edges 
according to their weights. E.g.

 
http://www.dmitry-kazakov.de/ada/components.htm#Generic_Directed_Weighted_Graph

Because you want to search edges by weights efficiently. So, changing 
weight is not possible. Though you always can remove the edge and add it 
again with another weight.

Alternatively, if you are OK with linear search, you simply take a 
directed graph and add an array of weights indexed by the child number 
to each node.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de