Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 1 year ago.
Improve this question
The MCMF problem is a standard problem where you have multiple sinks and sources where each source have some supply capacity and each sink node has some demand. Each source and sinks are connected with an edge with some capacity and some cost. You need to maximize the flow with minimum cost. how to solve MCMF problem? Is there any prewritten algo in any library?
Yes there are couple of algorithms like - capacity scaling, cost scaling, network simlex etc. You can find implementations in libraries like - Boost graph library, Networkx, LEMON.
Related
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 6 years ago.
Improve this question
I need to do some sort of priority-based search. Could someone point me to a priority queue implementation in ATS?
You can readily base a priority queue on a binomial heap.
There are two implementations of binomial heaps in ATS. Here are some use-cases:
https://github.com/githwxi/ATS-Postiats/blob/master/doc/EXAMPLE/ATSLIB/libats_linheap_binomial.dats
https://github.com/githwxi/ATS-Postiats/blob/master/doc/EXAMPLE/ATSLIB/libats_linheap_binomial2.dats
I came up with some unsafe C-based max-heap (based on somebody else's gist). I think that it does show that interfacing with C code in ATS, while generally unsafe, is very easy to do.
See the full sample at Glot.io
EDIT: here's another implementation, this time in ATS. It's a bit of a hassle to use, though (too many indexes in the type!), but the key salient feature of this code is that it is type-safe while also being extremely close to a typical C implementation in terms of runtime behavior.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 6 years ago.
Improve this question
Is there any probabilistic algorithm for calculating set cardinality taking into account that must support deleting elements from set? I've been using HyperLogLogs for calculating cardinalities of some sets and their unions but when necessity of deleting elements from set emerged my current solution became unappropriate. Maybe there are some researches or papers related to this topic you could advise.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 6 years ago.
Improve this question
I am trying to find a repository hosting input and output files of large Hamiltonian graphs to test how well my estimation algorithm works. Does anyone know such a place to get sample graphs with their Hamiltonian cycles to test against?
You can have a look at TSPLIB, which is a collection of sample instances for the Traveling Salesman Problem (and related problems) from various sources and of various types. It also has a section for Hamiltonian Cycle problems, with thousands of inputs and output files.
For example, the FHCP Challenge Set is a collection of 1001 instances of the Hamiltonian Cycle Problem, ranging in size from 66 vertices up to 9528 vertices, with an average size of just over 3000 vertices.
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 6 years ago.
Improve this question
I am looking for a high performance data structure on GPU (preferably over CUDA). The CUDPP is something cool but it does not satisfy my requirements because I want my key to be fixed size int array. I need to query 10k+ queries per second over a KEY-VALUE store of size 1M+. Is there any library already providing such type of functionality. I tried alternates on CPU but they are not that good for the purpose.
I haven't used it, though I have heard about a hashmap extension for CUDA Thrust. Present here:
Cuda-thrust-extensions library
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
We don’t allow questions seeking recommendations for books, tools, software libraries, and more. You can edit the question so it can be answered with facts and citations.
Closed 7 years ago.
Improve this question
I'm having a really hard time visualizing how the Bellman-Ford algorithm works purely through reading code. Does anyone know of an visual example (video, slideshow) that works through an actual graph with that algorithm? Thanks!
I think that this page might be what you are looking for. It does indeed run through the algorithm on a graph, and you may use the UI below to pause the visualization, or run through individual frames one at a time so that you can visualize it at your own pace.