Help implementing DJIKSTRA ALGORITHM
I have a Graph class that contains a Set of nodes,
I define a node to have a name and adjacent nodes.
The only thing im struggling with is:
lets say we have this:
A ---- B ---- C
|
|
D ---- E
Node D has name "D" and its adjacent nodes are E and A. How can I adapt my class to hold the distance to node E and A ? I have thought of modifying my node class to have a attribute distance to Parent, then Node E distance to parent is 1 but what if it has multiple parents as in what if a node F was connected to it
1 Reply
⌛ This post has been reserved for your question.
Hey @userexit! Please useTIP: Narrow down your issue to simple and precise questions to maximize the chance that others will reply in here./closeor theClose Postbutton above when your problem is solved. Please remember to follow the help guidelines. This post will be automatically closed after 300 minutes of inactivity.
💤 Post marked as dormant
This post has been inactive for over 300 minutes, thus, it has been archived.
If your question was not answered yet, feel free to re-open this post or create a new one.
In case your post is not getting any attention, you can try to use /help ping.
Warning: abusing this will result in moderative actions taken against you.