#🔒 Guess least cost for path from v to w in weighted graph

8 messages · Page 1 of 1 (latest)

meager sapphire
#

I have a computer lab about A* algorithms, but I can't figure out any way I should guess the distance from v to w, does anyone have any ideas? A* is also mentioned ZERO times in the course literature. Setting up Dijkstras algorithm was pretty easy, but this is sooo much harder and I don't even know where to begin.

little dragonBOT
#

@meager sapphire

Python help channel opened

Remember to:

  • Ask your Python question, not if you can ask or if there's an expert who can help.
  • Show a code sample as text (rather than a screenshot) and the error message, if you've got one.
  • Explain what you expect to happen and what actually happens.

:warning: Do not pip install anything that isn't related to your question, especially if asked to over DMs.

Closes after a period of inactivity, or when you send !close.
meager sapphire
#

Also, I don't have any info about the nodes except the nodes themselves and their neighbours

meager sapphire
#

(no coordinates etc)

dusk void
#

What sorts of graphs do you have, what are they based on?

pure granite
#

and I don't even know where to begin.
If you really have no resources on it, Wikipedia is often a good start.

little dragonBOT
#
Python help channel closed for inactivity

This help channel has been closed. Feel free to create a new post in #1035199133436354600. To maximize your chances of getting a response, check out this guide on asking good questions.