How to deal with the optimal transportation problem

[JiYuanFeng]

Dear Sirs, Thank you for your nice work. I am a student in the field of computer vision and I am new to this field.
I try to apply backbox solver to solve the optimal transportation problem in my project. Specify, I need to match the feature vectors of two groups. They can only have a maximum one to one matching or no matching. And I want to ask such a problem can be seen as an instance of the Graph matching? So I can refer to their implementation. Thank you very much and sincerely wish your reply.