Added Depth First Search in Every Language Article

[mowies]

SOLUTION DESCRIPTION

This PR adds the article about depth first search in every language.

This PR resolves #327

[jrg94]

This is great! How would a program go about parsing the input? In the past, we used serialized adjacency matrices for graphs, and I was wondering if we could do something similar.

[mowies]

This is great! How would a program go about parsing the input? In the past, we used serialized adjacency matrices for graphs, and I was wondering if we could do something similar.

Yes, I thought about that and didn't really come to a nice solution except for the one I pushed...

Do you mean like in the minimum spanning tree project [1] or the dijkstra project [2] for example?

[1] https://github.com/TheRenegadeCoder/sample-programs-website/blob/master/projects/minimum-spanning-tree/index.md#requirements
[2] https://github.com/TheRenegadeCoder/sample-programs-website/blob/master/projects/dijkstra/index.md#requirements

[mowies]

One problem I see in the adjacency matrix is that there is no clear way of adding data to the vertices. In order for a search program to be run on the graph/tree we need some vertex values to look for of course. So this would need to be added to the adjacency matrix in some form.

[mowies]

One way to adress this problem would be to have an additional input to programs that is the list of vertex values in the same order as they appear in the matrix.

[mowies]

@jrg94 I updated the article with requirements including an adjacency matrix now, please have a look :)

[jrg94]

I'm trying to think if there is a cleaner way to represent the input, but this is probably as good as it's going to get from a parsing perspective (e.g. I'm thinking of lower level languages that might have to do a lot of work to process the input). If you're happy with this, I'll go ahead and merge it!

[jrg94]

Overall, I agree the adjacency matrix solution isn't great because it doesn't scale well. That said, the biggest issue is parsing, and I'm not sure there's a nice format beyond JSON or something like that.

Also, we want to avoid the requirement of nodes and whatnot for trees. Since most languages support a list-like structure, this is usually the safest bet.

[mowies]

I think I am happy with it so feel free to merge :)