How to speed up this graph filtering algorithm?
5 次查看(过去 30 天)
显示 更早的评论
Hi,
The function pmfg() is fast as long as the graph is small (<= 100 nodes). However, I need to apply it to graphs with thousands of nodes and in this case the function runs for several hours. In order to improve the function's computation time I was thinking about converting the function to C. But according to the profiler the bottleneck is actually a child function, which is already implemented in C ('planar_test_mex', part of the MatlabBGL library).
What else could be done here to speed things up?
p.s.: The function pmfg() shows warnings about sparse indexing expressions, which might be slow. However, the algorithm is too involved for me to resolve these warnings on my own.
0 个评论
回答(0 个)
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!