1

I have two articles A and B, and I want to find any articles in the path from A to B. Is there a tool to do this?

There are several tools to list the shortest path, such as WikiDistrict, but I would like to have more paths, maybe three shortest ones.

Improve this question

1 Answer 1

Reset to default
1

I would know how to do this - in awk. But have other priorities. If you want, the fundamentals of retrieving the backlinks can be found in the Media Wiki Awk API. https://github.com/greencardamom/MediaWikiAwkAPI .. then create an algo to traverse backlinks X layers deep. Keep in mind this could end up querying millions of API backlink calls, it could be significantly time consuming and expensive. But if it was kept to 2 or 3 layers deep max like in the diagram that would help.

Improve this answer
2
  • would this be a quick method? I'm familiar with Linux, but I don't have it at hand. Also, how much time would it take for coding Awk specifically?
    – Ooker
    Commented Jul 17, 2015 at 9:21
  • Program speed is I/O bound so C or whatever won't help. Awk is probably the easiest language to learn, I don't know how long it would take depends on your skill level. Maybe a couple days 5-10 hours? A lot of the work is already done with this API and backlinks.awk .. just need add the algo logic to recurse through the pages and check for matches efficiently.
    – Green Cardamom
    Commented Jul 17, 2015 at 17:30

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.