Abstract: Rough graph theory is a new theory tools in knowledge discovery and knowledge mining.This paper makes further research on rough graph.The definition of directed rough graphs is given,and both the rough network and their expression form are also given.Furthermore,an algorithm of exploring class maximum flow in the rough network is presented,which generalizes the classical algorithm of exploring maximum flow.Finally,this paper successfully solves a new kind of relationship mining problem by using the algorithm.