News for hackers. Stuff that matters.
Re:Solving the minimum cut problem for undirected graphs by guiambros on Wednesday April 17, 2024 @11:59PM (#40072818)
Same! I felt it'd be above my IQ-level, so networkx-ed it.

Here's another obvious solution:

    pos = nx.spring_layout(G)
    nx.draw_networkx_nodes(G, pos)
    nx.draw_networkx_edges(G, pos)
    nx.draw_networkx_labels(G, pos, font_size=10, font_color="white")
    plt.show()
Thankfully it was my fastest solution (after day 1). After 25 days, I wasn't in the mood of spending hours post-xmas dinner solving convoluted riddles.

There are no comments on this comment yet.