brute force Structure code in c# for bus reservation : I'm working on bus ticket reservation system. I have a problem in the booking module.

Say we have bus a route starts from "A" to "D" via "B" & "C"

The bus starts from "A" then reach "B", then "C" and final destination is "D".

Assume some one is reserving seat no "1" for "B" to "C", this seat no should not be available for the person who is searching for a seat to travel from "A" to "D" or "B" to "D" but the same seat should be available for "A" to "B" or "C" to "D"

Example in Summary

Seat No 1 is Reserved for "B" to "C"

Seat No 1 should not be available for "A"-"D"
Seat No 1 should not be available for "B"-"D"
Seat No 1 should not be available for "B"-"C"
Seat No 1 should be available for "A" to "B"
Seat No 1 should be available for "C" to "D"
Could you please if there is already an algorithm or dotnet c# code to solve this problem.

Thanks in advance