In this paper introduced solving Assignment problem in another way by using divided star graph directly with algorithm and solution steps. The edges are represented the cost of assigning person to task after divided method, the nodes are represented the tasks and persons after divided method. The solution will be by choosing the minimum cost (edge) from the costs (edges) and delete the selected edge as well as nodes associated with the corresponding edge, then delete all other edges associated with the nodes.