Rewriting for my Dijkstra algorithm
Hey guys,
I'm currently trying to make a dijkstra algortithm (Which is basically a basic pathfinding algorithm) and I keep getting this type of error :
I don't really know what to do to fix it...
33 Replies
You won't get help without what type of error info
The best fix for the error would be to do I think
I'm sending the error
my bad
Line 113 :
Well, something is null
Those are warnings afaik
Yee ik
but my code stops and says unhandled exception
Probably
Depart with the funky eAre you sure these are errors ?
Or
FrontiereZfx#2474
Quoted by
<@!85903769203642368> from #Dijkstra Algorithm error with nullable (click here)
React with ❌ to remove this embed.
This looks an awful lot like an exception
Here's code btw
I mean, I think ye
This seems to be the culprit
You don't assign values to some stuff
So then I'd have to assign a random value to them
or like 0 or whatever?
For example
Or get it from somwhere
Idk, user input or something
It's hard to make heads or tails of code that's not in English
yee ik mbd
accents :/
accents shouldn't be an error normally it still works
but I can change it
In general, English is the language for IT
yeah but since my school is stupid, I have to write it in french
oof
kind of annoying ngl
Schools not being shit challenge (level impossible)
💀
So ye, I'm forced to actually type it in french
But wait, I think actually the nullable thingy shouldn't be the problem, but then I still don't know why my thing stops at 7 nodes found. (Noeuds is nodes in french)
non ascii characters are totally allowed, you can even use kanji for variable names
your error is because of the parameterless constructor
remove it and you should be good
I actually made it work
but now i'm wondering if there's a way to write this differently :
cuz I've never wrote like that my teamate did but we both don't know if the teacher will accept it