list.md

Vertex

1. Write test for constructor -Ivan
2. implement constructor -Mina
3. Write test for getters and setters -Ivan
4. Implement getters and setters - Mina
5. Implement desctructor - Ivan

Edges

1. Write test for constructor -Ivan
2. implement constructor -Mina
3. Write test for getters and setters -Ivan
4. Implement getters and setters -Mina
5. Implement desctructor -Ivan
6. Make sure an edge always gets initiated with 2 pointers
7. [] Write test for copy constructor
8. [] Solve issue: Destructor using delete keywords results in error "munmap_chunk(): invalid pointer"
9. [] solve issue: make an edge does not have one vertex

DirectedGraph

1. Write test for default constructor -Ivan
2. Implement default constructor -Ivan
3. Write test for copy constructor
4. [] Implement copy construcor
5. Write test for add vertex method
6. Implement add vertex method
7. write test for remove_vertex()
8. implement remove_vertex()
9. write test for add_edge()-Ivan
10. implement for add_edge()-Mina
11. write test for remove_edge()
12. implement remove_edge() -Mina
13. write test for search_vertex()
14. implement search_vertex() -Mina
15. write test for search_edge() -Mina
16. implement search_edge()
17. implement diplay()
18. [] write test for to_string()
19. [] implement to_string()
20. write test for clean()
21. [] implement clean() -
22. [] resolve issue , clean how constructor should be called

//bonus questions

1. [] write test for add_vertices()
2. [] implement test add_vertices
3. [] write test for add_edges()
4. [] implement for add_edges()
5. [] write test for display_path()
6. [] implement display_path()

//graph

• tesst operator ==
• implement operator ==
• implement assignment operator
• test operator =
• test operatt +(both)
• [] implement operator ++
• write test for []
• write test for cout
• write test for string

why does == not work when constant are involved?