Hello, I’ve read a lot of posts and gathered a wealth of information from this site that has been greatly useful. However, I’m now having issues with the speed of algorithm in one of my graphs and hoping the community can shed light or pose alternate solution to my problem, which is the speed of a search node I’m using from the Bakery package.
Essentially, I have a graph that reads a couple of Excel files, one for a list of needed components in a room, the other being a list of our library content. Then the content found (using Bakery’s Wildcard String Search One List in Another List (Faster)) is then placed in the room which was selected. The idea behind this is great and although slow, the graph works and does save the users considerable time, however… the graph is painfully slow and seems like it should be able to do this task much faster.
I realize I don’t have any files attached but hoping someone with a higher level experience than myself might be willing to provide me a suggestion or solution even. Thanks for reading, Greg