vaibhavst

 Profile Answers by vaibhavst Questions by vaibhavst

• Dec 11th, 2010

 

Definition of Searchability Matrix
The notion of searchability for a given matrix P, source and destination nodes s and t, and a number d, we say that G(n,P) is dsearchable using a deterministic memoryless algorithm A if the expected length of the path defined by A on G(n,P) is at most d. Note that this definition requires that the algorithm find a path from s to t with probability 1.

Now interms of testing.
Its nothing but the probabilities (number of test cases) that can come in searching the required element out of given set of elements.
its almost similar to the searching techniques used in linked list and binery trees in C language