Curious question:
Can anyone show me how to describe shortest path problem using LFP + first order logic?
I am just getting lost on how to describe the problem, though I know that LFP + first-order logic matches to the complexity class $P$.
Thanks.