An efficient Boggle solver using a trie

I like word games - classics such as Scrabble and Boggle, and contemporary ones such as Bananagrams and Wordle are often played or discussed ewith my family and friends. Playing these games over recent months I have observed and become interested in the distinct tactics between players and whether these

Computing earliest-arrival paths in temporal graphs

Shortest path is a frequently used tool, particularly regarding route planning. But in some graph problems, the edges change as time progresses and so we can not use popular algorithms such as Djikstra. Instead we must use a class of algorithms which consider the properties of temporal edges.