Lilac
Lilac
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
okay then I will check out the tutorials
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
in only 1 lesson
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
but we were only briefly introduced with it
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
well we were required to use winfomrs
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
but we find it too hard to perform that right now
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
actually it would be better if my team can find routes with input values
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
I have not even started OOP yet
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
and I have no idea how to code with winforms right now
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
yes it's a school assignment
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
like this
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
Graph graph = new Graph(); // Create a new graph object
graph.AddVertex("v0"); graph.AddVertex("v1"); // Add vertices to the graph
graph.AddVertex("v2"); graph.AddVertex("v3");
graph.AddVertex("v4"); graph.AddVertex("v5");
graph.AddEdge(0, 1, 2); graph.AddEdge(0, 2, 3); // Add edges to the graph
graph.AddEdge(1, 2, 2); graph.AddEdge(1, 3, 1);
graph.AddEdge(1, 4, 3); graph.AddEdge(1, 5, 2);
graph.AddEdge(2, 4, 1); graph.AddEdge(3, 4, 2);
graph.AddEdge(3, 5, 1); graph.AddEdge(4, 5, 2);
Graph graph = new Graph(); // Create a new graph object
graph.AddVertex("v0"); graph.AddVertex("v1"); // Add vertices to the graph
graph.AddVertex("v2"); graph.AddVertex("v3");
graph.AddVertex("v4"); graph.AddVertex("v5");
graph.AddEdge(0, 1, 2); graph.AddEdge(0, 2, 3); // Add edges to the graph
graph.AddEdge(1, 2, 2); graph.AddEdge(1, 3, 1);
graph.AddEdge(1, 4, 3); graph.AddEdge(1, 5, 2);
graph.AddEdge(2, 4, 1); graph.AddEdge(3, 4, 2);
graph.AddEdge(3, 5, 1); graph.AddEdge(4, 5, 2);
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
I don't need to input the data or anything
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
I just want it to do the route finding process with the given data
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
into a winfoms program
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
how can I put all these codes of Dijkstra pathfinder
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
yeah, I took some reference from a cpp program
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
oh thanks for your help
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
No description
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
and this is my output
30 replies
CC#
Created by Lilac on 4/16/2024 in #help
✅ Problems with Dijkstra Algorithm
U -> V: 0 -> 1 wt 1
U -> V: 0 -> 2 wt 4
U -> V: 0 -> 3 wt 0
U -> V: 0 -> 4 wt 0
U -> V: 0 -> 5 wt 0
U -> V: 0 -> 1 wt 1
U -> V: 0 -> 2 wt 4
U -> V: 0 -> 3 wt 0
U -> V: 0 -> 4 wt 0
U -> V: 0 -> 5 wt 0
30 replies