Author Archives: Dejan Agostini

About Dejan Agostini

iOS developer@❤️ I’m just a guy passionate about technology who can’t wait to see what tomorrow brings.

Using Firebase Cloud Functions

      1 Comment on Using Firebase Cloud Functions

Some time ago I wrote on using realtime database from firebase and about Firebase Cloud Messaging. In this article we’ll talk about using Firebase Cloud Functions. With Firebase Cloud Functions you get to write your own functions that can execute on firebase servers. In this article we’ll cover three basic scenarios: sending an… 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 »

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 »

Dijkstra’s Algorithm in Swift

      2 Comments on Dijkstra’s Algorithm in Swift

Last week we’ve talked about edge weighted digraphs in swift. This week we’ll talk about a famous algorithm that’s using that data structure. Dijkstra’s algorithm is a simple and well-known algorithm for finding a shortest path between two points on a graph. In this article we’ll implement Dijkstra’s algorithm in… Read more »