U radu je dan osvrt na programsko rješavanje problema vezanog za particioniranje grafa G = (V, E). Budući je to problem koji pripada klasi NP–teških problema odabrane su strategije iz domene heuristike za njegovo rješavanje. U tu svrhu napravljen je programski modul u softverskom paketu Microsoft Visual Studio 2015. Implementirani modul programski (heuristika) pronalazi sub–optimalna rješenja, a nerijetko i korektno optimalno rješenje MBCP problema korisničkog grafa u razumnom vremenu. – The paper gives a review regarding the problem solving of the graph partitioning problem, for some graph G = (V, E). Since this is a problem belonging to the NP-Hard class, strategies from heuristic domain were chosen for solving such a problem. For this purpose, a software module was created in the Microsoft Visual Studio 2015 software package. The implemented module programmatically (heuristics) will find the sub–optimal solutions, but also finding of the correct optimum for MBCP problem of user’s graph in reasonable time is not rare.