Hi, i'm Elías Jiménez. I'm computer science student (last semester), i'm from México City (that's why i speak/write english very badly, sorry).
My main programming language is java, i've done most of my data structures in this language and i've implemented BFS and DFS with the adjacency matrix representation's graphs. Unfortunately i don't find the files, but that's pretty easy to program again,
I'm familar with graphs, I passed a Theory of Graphs course, i've learned some algorithms, not implemented all of them, just the simple ones (algorithms on simple graphs without weights).
I'd like to know for what do you require this implementation, to decide the best representation of the graphs.
The matrix representation is very useful and illustrative but is expensive in memory if the graphs become bigger.
In this case the list of adjacency is more applicable even to multigraphs with more than one loop.
Well, the budget is just fine, i just arrived here to Freelancer plataform (2 days ago) and the important thing is help you. If i could, i won't charge you anything, but i've to do.
I like to program and i like the graphs.. and the challenges so i hope being useful to you.
Thanks. Good Night