79377965

Date: 2025-01-22 14:02:32
Score: 0.5
Natty:
Report link

This looks like a problem of finding a Minimum Cut of a graph, requiring that minimum cut contains only 2 edges. There is for example Karger's algorithm which has complexity as

enter image description here

where n - number of nodes

Reasons:
  • Probably link only (1):
  • Low length (1):
  • Has code block (-0.5):
  • High reputation (-1):
Posted by: Renat