Topological indices are numbers that are obtained from graph connectivity patterns and are used to summarize and compress the data that is included in those patterns. These indices are helpful in finding QSPR analysis. But the question here is that novel indices are introduced by senior graph theory experts and the indices are increase with the passage of time and it become very hard to find some of them with utmost accuracy only generalization is not a solution. What and how more sophisticated approach is to find all these with more efficient technique. Is it not a dire need to develop more versatile way to find standardized computational topological indices calculation with algorithmic approach? How the indices can find out with more accuracy, reliability and efficiently.