寻找＆QUOT;强连通＆QUOT;在图形子图 [英] Finding "strongly connected" subgraphs in a Graph

问题描述

我想找到一个算法来寻找子图的无向连通图，其中的子图每个顶点有一个边子图中每个顶点。

I am trying to find an algorithm to find the sub graphs in a undirected connected graph, where each vertex in the subgraph has an edge to every other vertex in the subgraph.

我的真正的问题是，我无法分类的这个问题，让我可以研究可能的算法和解决方案。

My real problem is that I am having trouble classifying this problem, so that I can research possible algorithms or solutions.

请问谁知道这个问题被称为或是否有实现这一目标的任何现有的算法？

Would anyone know what this problem is called or is there any existing algorithms that achieve this?

推荐答案

我相信你指的是团问题。

这篇关于寻找＆QUOT;强连通＆QUOT;在图形子图的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！