Most Reliable Path in a Probabilistic Graph

snapchat

Problem

You are given a graph representing a spider web.

  • The spider starts at node S and wants to reach node T.
  • Each edge e has a probability of breaking p(e) (0 <= p(e) <= 1).
    • If...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: