Abstract: Many current practical problems in many areas (such as bioinformatics, social networks, science databases, etc.,) can be solved through using graph algorithm which is consisting of vertices (nodes) and edges interconnecting these vertices. Although, the graph is formally very well described, some problems over the graphs have not yet been formalized or their solution is a NP-hard problem. These problems also include the process of identification of clusters in a graph. The following text provides a way to use the method of ant colonies optimization algorithm for the identification of clusters in the graph.