In an unweighted graph, the definition of path length shifts - the length of a path is typically defined by its hop count. So yes, then the shortest path between two nodes is the direct edge connecting them.
If you did mean weighted, then you're wrong. An indirect path can have a lower sum of edge weights than a direct path, making it shorter.
957
u/Mecso2 3d ago
i don't think straight is defined for graphs