#🔒 Problems with kruskals, prims and MST

5 messages · Page 1 of 1 (latest)

cedar scarabBOT
#

@solemn canyon

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.
solemn canyon
#

I have the following problem with this code:

Testing MST on a small graph (Graph01) containing 4 verticies....
Checking number of edges in MST ....
Checking total cost of MST ....
Checking edges in MST ....
Done testing MST on a small graph containing 4 vertices!

Testing MST on a graph (Graph02) containing 8 vertices ....
Checking amount of edges in MST ....
Checking total cost of MST ....
Checking weight of edges in MST ....
Done testing MST on graph containing 8 vertices!

Testing MST on a graph (Graph03) containing 9 vertices
Checking amount of edges in MST ....
Checking total cost of MST ....
Checking weight of edges in MST ....
Done testing MST on graph containing 9 vertices!

Testing MST on a small graph (Graph01) containing 4 verticies....
Checking number of edges in MST ....
Not correct amount of edges. Expected 3 but got 0
Testing Prims algoritm on a small graph did not give the correct result ....

cedar scarabBOT
#

@solemn canyon

Python help channel closed

This help channel has been closed and it's no longer possible to send messages here. If your question wasn't answered, 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.