Dijkstra algorithm helping find new space

Thread Rating:

Thread Modes

Dijkstra algorithm helping find new space

Gribouillis

Super Moderators

Posts: 4,598

Threads: 71

Joined: Jan 2018

Reputation: 341

Jul-28-2023, 08:30 AM (This post was last modified: Jul-28-2023, 09:28 AM by Gribouillis.)

(Jul-28-2023, 03:54 AM)deanhystad Wrote: Or this:
Output:X - - - -^ Z Z Z -
^ Z - - -
^ < < - -
- Z ^ < -

or this

Output:[['0' '1' '2' '3' '4']
 ['1' 'Z' 'Z' 'Z' '5']
 ['2' 'Z' '6' '7' '6']
 ['3' '4' '5' '6' '7']
 ['4' '5' 'Z' '7' '8']]

For this one, you need to run the Dijkstra starting from (0,0) and without target. The number is d[k].dist

Messages In This Thread

RE: Dijkstra algorithm helping find new space - by Gribouillis - Jul-28-2023, 08:30 AM

Possibly Related Threads…
Thread		Author	Replies	Views	Last Post
	from global space to local space	Skaperen	4	2,457	Sep-08-2020, 04:59 PM Last Post: Skaperen
	helping PyInstaller To Find files	Harshil	0	1,567	Aug-30-2020, 10:16 AM Last Post: Harshil
	FAST algorithm of checkSamecircularList(x, y) without L CircularList ref but find ref	lsepolis123	0	1,623	Aug-14-2019, 07:51 AM Last Post: lsepolis123
	Dijkstra code - trying to simplify it	grandpapa10	1	2,269	Jan-23-2019, 12:43 PM Last Post: Larz60+
	Helping understand classes	Miraclefruit	10	6,599	Nov-27-2017, 01:58 PM Last Post: Windspar

Users browsing this thread: 1 Guest(s)