#🔒 Finding a subgraph of a MST that passes by a point X that has maximized cost?

5 messages · Page 1 of 1 (latest)

sinful escarp
#

We are trying to solve a homework in our algo class, so far we have a MST and a point X and a budget BU. We need to return a subgraph that passes by point X with maximal costs but does not surpass BU. This is looking like a leetcode problem that I somehow missed, how should we think about a solution here?

spiral ravineBOT
#

@sinful escarp

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.
sinful escarp
#

!close

spiral ravineBOT
#
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.