We propose algorithms that uses fast graph mining for resolving the network topology to a locally regulated area defined as a component of network topology. Though the IP backbone network should be reconfigured periodically in accordance with environmental changes, reconfiguration results in heavy workload, such as routing re-designs or testing these re-designs for network operators. If a network can be reconfigured within the component, however, we can drastically reduce the operation workload for network reconfiguration. For finding the components from the network topology, we should solve the subgraph isomorphism problem, which is NP-hard. We propose the heuristic graph mining algorithm that reduces the size of search space by considering network operating conditions. We visualize the results of components analysis, and show that the computation finishes within the practical time.