Buy Me a Coffee at ko-fi.com

Connected component of a graph

maximal subgraph of a given node-link graph within which every two vertices may be connected by a path

Pronunciation
/kəˈnɛktəd kəmˈpoʊnənt əv ə ɡræf/
/kəˈnɛktɪd kəmˈpəʊnənt əv eɪ ɡrɑːf/