Create test.c
Delete test.c
Create graphDFS_BFS.c

un-directed graph implementation + dfs + bfs
Create 08_minimumSpanningTree.c

laboratory 08, mst implementation using Prim's algorithm

reads the graph from a file with a structure like this:
6
0 4 0 0 0 2
4 0 6 0 0 3
0 6 0 3 0 1
0 0 3 0 2 0
0 0 0 2 0 4
2 3 1 0 4 0
Rename 04_04_binSearchTree2 to 04_binSearchTree
Rename graphDFS_BFS.c to 07_graphDFS_BFS.c
Rename 06_hashTableChain to 06_hashTableChain.c
Rename 04_binSearchTree to 04_binSearchTree.c
Merge pull request #99 from calintamas/master

07_graphBFS_DFS Tamas Calin