In this post we are going to look at two of the most simple but useful graph algorithms, connectivity and bipartiteness check.
Graph Theory | How to traverse graphs with DFS & BFS
In the previous post we introduced how to save graphs in memory and loading them from files, now we need to do something with these graph. There are different things we can do, the most basic is the graph traversal.
Computer Vision | Introduction to Computer Vision
When you look at an image, your brain can immediately figure out who is a familiar face, who is a stranger, who is a man or a woman, who is a child or an adult, and roughly someone’s ethnicity. You can also see the clothing people are wearing, and what time of day it is or season depending on the foreground and lighting
Graph Theory | How to represent graphs in memory
In the previous post we started talking about graphs, in this article we’ll look at different graph representations.
There are different ways to represent a graph, each one with its advantages and disadvantages.
First, we’ll talk about adjacency list, in my opinion the best way to save a graph in memory, then we’ll continue with the adjacency matrix, less used because its slowness and memory consumption, and finally with the edge list.
Graph Theory | Introduction to graphs
Let’s start, what is a graph?
If you love programming but never heard of a graph, be warned: you’ll end up either loving them or hating them.
What is a graph?
We are not referring to charts, diagrams or things like that, a graph is a mathematical structure to model pairwise relations between objects.
A graph is made up of vertices, nodes or points which are connected by edges, arcs or lines and it is often represented as G=(V,E). Continue Reading