Request New Subject
Home
Computer Science Engineering (CSE)
Discrete Mathematics
Q. If a node v is reachable from node u then the path of minimum length u to v is called _____. (Solved)
1. reachability
2. node base
3. geodesic
4. accessibility
c. geodesic
Related Topics
→ Computer Architecture and Organization
→ Microprocessor and Interfacing Technique
→ Computer Networks
→ Data Structure and Algorithms (DSA)
→ Operating System (OS)
→ Artificial Intelligence and Robotics (AIR)
→ Software Project Management (SPM)
→ Computer Fundamentals
→ High Performance Computing (HPC)
→ Data Communication and Computer Network
Subscribe Now
Get All Updates & News
Subscribe