PoreMatMod.jl
PoreMatMod.jl copied to clipboard
search faster!
trafficstars
99% of search runtime is spent on
prune!. Up to half of that is spent on calls tocandidate_list.
Refactoring to use a Boolean matrix on the DFS stack for the candidate list could make searches much faster!
Could try VF2 algorithm implemented in Graphs.jl