#breadth-first search

This post covers Chapter 6 of Grokking Algorithms, which introduces the graph data structure and the breadth-first search algorithm. Shortest Path Imagine you’re going on vacation and you need someone to watch your pet gecko while you’re gone. His name is Gordon and he’s very picky about who takes care of him. His preference would be to have one of your friends watch him. But if none of them…

Advanced Algorithms In Java

Graph algorithms, breadth-first search, depth-first search, shortest path, arbitrage, strongly connected components What you’ll learn

Learn about the applications of data structures

Implement advanced algorithms efficiently

Able to move towards advanced topics such as machine learning or big data analysis

Get a good grasp of algorithmic thinking

Get to know graph algorithms: BFS, DFS,…

So I was like ‘ok wtf do I do then’

And younger sibling was like- you do this. You choose one. Whichever you have time for. If you have time for both, choose one over the other for arbitrary reasons. No thinking further. No comparing potential results or efficiency. Just the two choices, compared on a completely surface level perspective.

Then. THE OTHER OPTION IS GONE. Now you move on to the next. Make the decision equally based on an equally arbitrary reason, your first instinct of what is best.

So when you’re trying to decide what to do with your day, you find the first things to choose between, choose quickly, and just do it until it is finished.

Motion detection and objects tracking algorithm implementation

This article briefly describes our successful experience of implementation “tracking of moving objects” algorithm as a part of intelligent video analysis solution. It contains high level instructions how to “convert” a video stream into a list of tracks of moving objects.

Introduction to motion recognition

Motion recognition is very important in automated surveillance systems. In this article we…

Various Graph Search Algorithms Using Java

If you’ve been keeping up with my blog, I’ve made a topic regarding Binary Search Trees, but another very important topic in computer science and software engineering is in regards to Graphs.

Graphs via Wikipedia:

A graph data structure consists of a finite (and possibly mutable) set of nodes or vertices, together with a set of ordered pairs of these nodes (or, in some cases, a set of unordered…