Please turn JavaScript on
header-image

Useful code

Receive updates from Useful code for free, starting right now.

We can deliver them by email, via your phone or you can read them from a personalised news page on follow.it.

This way you won't miss any new article from Useful code. Unsubscribe at any time.

Site title: Useful code – Programming with VBA, C# and Python

Is this your feed? Claim it!

Publisher:  Unclaimed!
Message frequency:  0.72 / week

Message History

Searching through 399 documents or 40 web pages (the numbers are not random) can be a tough task if you rely on standard tools like ctrl+f. When the data grows, you need a dedicated search engine that understands relevance, handles…Read more ›


Read full story

In our previous article, we explored the A* (A-Star) Algorithm. It is the gold standard for pathfinding as it is optimal – it always finds the shortest path. But in the real world (chess engines, LLM) it might be too…Read more ›


Read full story

A* is probably my favourite graph search algorithm. Some 10+ years ago, I have implmented it with Excel and after that I have written a few more implementations. Just, not to repeat myself, I will not discuss it here. The reason…Read more ›


Read full story

In the previous articles, we have presented graphs with BFS and DFS. The BFS is actually good to find the path with the fewest nodes. But if the path with the fewest nodes is actually the most expensive, then we…Read more ›


Read full story

BFS, DFS, A-Star – these sound like magic spells from a Harry Potter book! And actually, these are magical (especially the A-Star) as far as they are well-defined algorithms, that explore a graph. In our previous article, we have explored…Read more ...


Read full story