That’s not what I got. In fact, stack overflow isn’t in any of my results. I got a lot of scholarly articles for various algorithms and none of them mention the Hungarian algorithm.
You are not logged in. However you can subscribe from another Fediverse account, for example Lemmy or Mastodon. To do this, paste the following into the search field of your instance: [email protected]
No game suggestions, friend requests, surveys, or begging.
No Let’s Plays, streams, highlight reels/montages, random videos or shorts.
No off-topic posts/comments, within reason.
Use the original source, no clickbait titles, no duplicates.
(Submissions should be from the original source if possible, unless from paywalled or non-english sources.
If the title is clickbait or lacks context you may lightly edit the title.)
Its so stupid, google “bipartie matching algorithm” and the second result is a stack overflow where the second answer is the Hungarian algorithm…
So every programmer would have found that immediately using the traditional methodology…
Yup, AI is frequently a worse way to do something we used to do, but with a crappy pretend to be a person responding veneer.
That’s not what I got. In fact, stack overflow isn’t in any of my results. I got a lot of scholarly articles for various algorithms and none of them mention the Hungarian algorithm.
Weird, google might know I only click on stackoverflow links lol
https://stackoverflow.com/questions/23059735/fast-maximum-matching-algorithm-for-bipartite-graphs