In the bellman ford video he keeps saying maximum edges on a regular graph with no cycles is N-1 ?? What does that mean ? In graph theory a regular graph means a graph all of whose vertices have same degree.

Also this N-1 bound is for undirected graph right ? There is no reason for a directed cycle to exist if there are more than N-1 edges.