We could make sure the shortest path of each pair of correlatively known gene of lung cancer and genes on the path by Dijkstra's algorithm: calculating optimal path of one node to all the other nodes, moreover, arraying these genes by Betweenness value that stood for internal nodes of certain gene contained all optimal paths found.