Count simple paths whose labels match a prefix
Every node of a graph carries a label. Count the simple paths (paths that never repeat a node) whose sequence of labels matches a given prefix string. Explain how you prune the search and what the worst case costs.
No answer yet. Write the first one; the best answer gets endorsed.
