Deletion of Ndoiskas Algorithm

Comment: as a . I think this page was created by a young computer science student named Ndoiskas. The (not really described) algorithm is the same as the classic depth-first search except that it takes the unnecessary step of accumulating all of the paths (there could be exponentially many) before choosing the shortest. Therefore it is can't really be "extremely useful for small graphs." &mdash;&nbsp
Stance: delete
Cited policy: Wikipedia:Wikipedia is not for things made up one day (WP:NFT)