C++ ☀️ 210 COURSEWORK 🍀

Manual c++ -> https://github.com/fffaraz/awesome-cpp

If same functions on the program dont work you need to give full permission to the files/folder

"sudo chmod -R 755"

BUGS FOUND

Development "Board"

Coursework Backlog

Coursework On-Board

3 GRAPH - implement a function isPath(v, w) ->(where v and w are vertices in the graph to check if there is a path between the two nodes. The path found will be printed to a text file as a sequence of integer numbers (the node values));

4 GRAPH - implement a function isConnected(G) to check whether or not the graph is strongly connected. The output should be simply 'yes' or 'no';

Adapt the previous graph

GRAPH - Dijkstra's Algorithm ;

Coursework Finish/Release

1 BST - from a suitable file format, such as .txt.;

1 BST - function bin_tree_find;

1 BST - extract words insert on tree;

1 BST - Printing the tree in in-order;

1 BST - function frequency of words;

1 BST - output the path traversed ;

1 BST - PRE_ORDER ;

2 BST - function delete_node;

GRAPH - USER INPUT HANDLE ('False');

GRAPH - ask how many vertices, handle the input 2d matrix;

GRAPH - addEdge;

GRAPH - isConnected (Vertice to Vertice);

GRAPH - isConnected (Strongly -> all vertices have a connection);

5 GRAPH - Implement BFS;

5 GRAPH - Implement DFS;

5 GRAPH - Save the nodes traversed in sequence to a text file;

GRAPH - path between Vertices;

6 GRAPH - structure to support weighted .

❗ ❗ Important for IPP/Viva 💻

Review

Algorithm

EXTRAS

Colour Output

Dinamic Output

Handle all Possible 'false' input

Author

João Maia

deoiveij/210_PROGRAMMING

About

Resources

Stars

Watchers

Forks

Releases

Languages