The present disclosure relates to a method, apparatus and system for determining accessible paths between two nodes. According to the method of the present disclosure, an adjacency matrix of a graph, which includes a plurality of points and edges connecting the plurality of points, is first established; then, search is made for an accessible path that can reach a destination from a starting point based on the adjacency matrix. Especially, a termination condition for the searching is set based on an already-sought path during the searching, and the corresponding search is terminated in response to the termination condition being met during the searching. With the present disclosure, it may substantially reduce repeated traversal, obvious reduce the time taken to search for accessible paths between two nodes, and significantly improve the efficiency in searching for the accessible path.