Y by Mango247
Hi, I'm new to CrowdMath but find this really cool!
Is this problem the graphs with no edges?
No edges means if there are 2 vertices with no landmarks, they both have distance infinity to all others, so there can only be one vertex with no landmark.
This can be constructed with n vertices, n-1 of them have a landmark.
Case 1:
The robot's distance to some landmark is 0, so it knows where it is.
Case 2:
The robot's distance to every landmark is infinity, so it must be on the one node without a landmark.
Is this correct? I know this must be one of the simpler problems but during this pandemic I've really been missing my college problem solving group and I'd love to join this! : )
Is this problem the graphs with no edges?
No edges means if there are 2 vertices with no landmarks, they both have distance infinity to all others, so there can only be one vertex with no landmark.
This can be constructed with n vertices, n-1 of them have a landmark.
Case 1:
The robot's distance to some landmark is 0, so it knows where it is.
Case 2:
The robot's distance to every landmark is infinity, so it must be on the one node without a landmark.
Is this correct? I know this must be one of the simpler problems but during this pandemic I've really been missing my college problem solving group and I'd love to join this! : )