hello all, i was recently trying to solve a BFS problem where each node is represented by a different arrangement of elements in an array but am unable to come with a data structure to keep track of the visited nodes. generally nodes are different strings so we can just use map and set visited nodes to 1 but what can i use in the above case?
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/anThAhS9D8sJ. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
