Therefore, we propose a straightforward yet effective graph construction algorithm via path finding among mentioned concepts (C q ∪ C a ).
for each question concept c i ∈ C q and answer concept c j ∈ C a , we can efficiently find paths between them that are shorter than k concepts 4 .