This goes out to all the Mathematica experts - I'm hoping to get some helpful comments, ideas or code for that matter.
In my attempts to maximize learning efficiency I had the idea to create an (undirected) graph of Wikipedia hyperlinks of a specific topic (e.g. probability theory).
This then could be used to identify central nodes/topics which are necessary (i.e. highly connected to other nodes) to understand the rest of the topic more easily, instead of more or less arbitrarily browsing through Wikipedia. For example would it be more efficient to start from a central node/topic since other topics are based on an understanding of this node/topic.
I have trouble reading out the hyperlinks from Wikipedia (e.g. up to a some depth) and I don't even know how to start with the graph, so any help (or examples) to get me started would be appreciated.