Click on a keyword to filter my blog content + then scroll down to have a read.

October 1, 2017

Traversing, or searching, a tree involves visiting each node of ...

April 15, 2016

An Eulerian walk through a graph visits each edge exactly once.

April 1, 2016

A strongly connected component is a maximal subgraph of a directed graph, where each pair of vertices is connected by an edge.

Please reload

Please reload

See posts from

PhDomics by Fatima