Category Archives: Swift

Events Driven Architecture in iOS with MERLin

If you are not new to iOS development, you know how important is to correctly decouple app components for testability and overall flexibility. Each feature should work independently from the others. Ideally, each feature should be easily replaceable with another component providing the same functionality. To achieve this result we… Read more »

Bellman-Ford Algorithm in Swift

      2 Comments on Bellman-Ford Algorithm in Swift

Bellman-Ford algorithm is a very versatile algorithm for finding the shortest path on an edge weighted directed graph. It differs from Dijkstra’s algorithm in that it can handle the negative cycles on the graph. In this article we’ll implement the Bellman-Ford algorithm in swift and with it conclude our journey… Read more »

Enums like never before…

      No Comments on Enums like never before…

A big problem currently unresolved in the swift world is in regards to enums. Filtering and equating enums in swift is verbose and might require some extra helper function or computed var on the enum itself. In HBCDigital I’m currently working with my team to a new reactive framework that… Read more »

Detecting Directed Cycles In Edge Weighted Digraphs

Edge weighted digraphs can be used for a large number of things. In some cases we want to know if there’s a directed cycle between the nodes (or vertices). For example, if we’re working on a scheduling app, we would be interested to know if there’s a cycle on the… Read more »

Binary Search Trees in Swift

      No Comments on Binary Search Trees in Swift

Binary search trees are one of the most fundamental data structures in computer science. They are very efficient when inserting and searching for elements. And if you’re preparing for a technical interview it’s more than likely that you’ll be asked about them. In this article we’ll go over the theory… Read more »