<commit_before># Depth First Search

Class Dfs implements Depth First Search using adjacency list representation of graph

Methods/ Operations implemented: 

	Dfs(int n, int m, std::vector<std::vector<int>> edges) - Constructs Dfs object - Initializes vertices and adjacency list

	void traverse() - Traverses in depth first fashion and prints traversal

	bool isCyclic() - Returns true if graph is cyclic

	void topologicalSort() - Prints topological sort order of vertices if graph is acyclic<commit_msg>Update read me for dfs<commit_after># Depth First Search

Class Dfs implements Depth First Search using adjacency list representation of graph

Methods/ Operations implemented: 

	Dfs(int n, int m, std::vector<std::vector<int>> edges) - Constructs Dfs object - Initializes vertices and adjacency list

	void traverse() - Traverses in depth first fashion and prints traversal

	bool isCyclic() - Returns true if graph is cyclic

	void topologicalSort() - Prints topological sort order of vertices if graph is acyclic

	Dfs::~Dfs() - Deallocate Vertices
{'fraction_non_alphanumeric': 0.06054872280037843, 'fraction_numerical': 0.0, 'mean_word_length': 4.877777777777778, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 7, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '2824121', 'n_tokens_mistral': 295, 'n_tokens_neox': 269, 'n_words': 132}