Embed Notice

Paths refer a sequences of edges, each pair connected by a shared node, through the graph. If the start & end at the same node that's a "cycle".

Yesterday I mentioned Tries which treats keys-to-lookup as a path through a labelled tree. Doing the same for a general graph is called a Deterministic Finite Automaton (DFA), or Non-deterministic Finite Automaton (NFA) if there's redundant edges, & is how regular expressions work!

There's more graphconcepts, but I think those are the major ones!

3/4