Implement fast version for graphs with “string vertices” #2
Description
Implement fast versions of flatten and search functions using a hash table to mark/check visited vertices. (Also, type of Vertex will be always string.)
{{ message }}
Implement fast versions of flatten and search functions using a hash table to mark/check visited vertices. (Also, type of Vertex will be always string.)