Once there was a Queen who got trapped on an island. You input to your program a map of island connected with bridges. Each bridge has a Toll and you must pay different amounts of toll to gain access to the bridge, but you also gain points by passing as many islands as possible. Create an algorithm which computes the total toll paid from a given initial position (which is always empty) to the destination (where queen is present) through every path and points gained suggest best possible path.

NOTE: Please code in C#.