Add searching algorithms on Implicit Graphs

[Korra15]

Description of the problem

Algorithms like A* search and others in this paper work really well for Implicit graphs. So, once Implicit graphs are in, we should also define these algorithms on them.

#224 is relevant here.

[czgdp1807]

Hi @Korra15 . The idea seems interesting. Could you please provide references (like research papers, blog posts, university lecture notes) so that we can discuss more?

[Korra15]

Yeah sure @czgdp1807, following is the link of the pdf that explains more about these algorithms.
http://i-rep.emu.edu.tr:8080/jspui/bitstream/11129/4714/1/algasikhaled.pdf

[czgdp1807]

I see. So, these are from artificial intelligence domain. Well, in general all the algorithms in paper are very well applicable on implicit graphs. More like, you know the current node and you also know a function to generate the neighbours of the current node. So, only these two pieces of information are used in these algorithms. Hence, I would recommend, first adding an implicit graph data structure (see #224) and then defining these algorithms on them (the ones you suggested above).

[Korra15]

okay,
So the working on the adjaceny list and matrix data strucutre to create the graph should be my next task?

[czgdp1807]

We should add a new data structure, ImplicitGraph. (Read #224).

[Korra15]

okay

[Korra15]

@Abhinavcode13 you can contact the maintainers of this repo regarding the same