Package of CHR with dynamic rule priorities?

Help! Pack
,
28

(Nothing of Importance)

29

(Nothing of Importance)

30

OK.

Does the “area” argument still hold? i.e. the effort of Dijkstra and DFS are the same, when producing a shortest-path tree?

33

This is where your digression begins.

  1. You didn’t answer my question directly.

  2. You gave me many unrelated information.

    I never said “apply the argument to a tree”, the surprising things “tree” and “mesh” were introduced by you, which makes me overwhelmed. For the shortest path problem, we usually discuss directed graphs or undirected graphs.

    I don’t know why you suddenly introduce meshes? We are talking about graph, right?

    I don’t know what is single source distance modulo 10. No any explanation.

    You provide a lot of information and images, but without any precise context.

    It sounds like the flood fill you’re talking about (assuming it would produce a shortest path tree) still requires Dijkstra, right?

    The critical question is: if you do the same thing, but using DFS instead of Dijkstra, are their algorithmic complexity the same? Have you compared the two?

34

(Nothing of Importance)

35

I think we can stop the discussion.

36

There was never any sort of discussion, only various attempt to discredit me.
I hope you had fun! Even “scientific truth” didn’t stand your mocking. LoL
Shame on you! You even made fun of my visualization explanation:

Also because of your irrational behaviour you missed the oportunity
of working on day 21 of AoC 2023. Nevermind, the forum has other people,
and I am not repelled by your behaviour in doing it myself. I only wasted

an awful amount of time with explaining some trivialities.