CsAuthors.net's algorithm finds the shortest co-authorsship path between two authors. A co-authorsship
path is defined as a list of authors such that each pair of neighboring authors on that list
co-authored at least a paper.
In cases where there exists different paths between two authors having a minimal length, the system will
select the path such that the sum of the logarithms of the number of collaborations between authors
is the highest.
In cases where no co-authorship path exists between two authors, the system reports an infinite
distance between them (denoted using the mathematical symbol "∞"). This situation is relatively rare
since currently 87.5% users are in the same connected
subset of the graph.