Cluster computing

We will continue our discussion on Prims algorithm. We discussed that Prim's algorithm is a greedy method. We look for the minimum cost...

We continue our discussion on proof of correctness for Prims algorithm To prove lemma 1, we take the edges e and say there is a cycle and ...

We will now look at the proof of correctness for Prim algorithm. Prim's algorithm will produce different minimum spanning trees dependi...

Today we look at prim algorithm. This is also a greedy method. Here we take grow the tree by adding the minimum cost edge that connects to ...

Today we will look at Kruskal algorithm. This algorithm is a greedy method. It enumerates the edges in the order of ascending weights. The ...

I want to talk about Splunk saved searches and their visibility aka permissions. Splunk has the following permissions : A saved search cou...

In today's post, we continue our discussion on Splunk.  In addition to the discussion on search earlier, I wanted to bring up that sear...