For a given file we can verify if each knowledge link works or is broken.

To verify if a link is broken, we construct a structure which is isomorphic to "directories" and "files" hierarchy which allows us to query if something exists. at a certain path, it's literally a tree where the knowlege are leaves. We can construct this by walking the files going through the content and using beautiful soup to extract the knowledge from the file.

For each broken link we can try to find knowledge with a matching Id, if there is exactly one match then we can replace it, if there is more than one match we do ask which one to replace with.

If there is no matching link tell the user that we were unable to find any exact matches for that link.