Service Dependency Shortest Latency Path

Examples Example 1 Example 2 Requirements Create a shortest-path routine for a graph of service dependencies. The input may be represented in this normalized form: Your implementation should: Convert the service-latency entries into an adjacency-list representation. Treat each connection as a one-way dependency: from_service calls to_service, so latency is paid only in that direction (in the interview, confirm this with the interviewer rather than assuming two-way channels).…