<span class="searchmatch">connected</span> <span class="searchmatch">graph</span> (plural <span class="searchmatch">connected</span> <span class="searchmatch">graphs</span>) (<span class="searchmatch">graph</span> theory) A <span class="searchmatch">graph</span> in which there is a route of edges and nodes connecting any two nodes. “<span class="searchmatch">connected</span> graph”...
<span class="searchmatch">connected</span> <span class="searchmatch">graphs</span> plural of <span class="searchmatch">connected</span> <span class="searchmatch">graph</span>...
strongly <span class="searchmatch">connected</span> component Wikipedia strongly <span class="searchmatch">connected</span> component (plural strongly <span class="searchmatch">connected</span> components) (<span class="searchmatch">graph</span> theory) Given a directed <span class="searchmatch">graph</span>, a maximal...
related, <span class="searchmatch">connected</span>, interrelated contiguous, continuous (mathematics, topology) <span class="searchmatch">connected</span> zusammenhängender Raum ― <span class="searchmatch">connected</span> space (mathematics, <span class="searchmatch">graph</span> theory)...
From tri- + <span class="searchmatch">connected</span>. triconnected (not comparable) (<span class="searchmatch">graph</span> theory) Of a <span class="searchmatch">connected</span> <span class="searchmatch">graph</span>: needing three vertices removed for it to become disconnected...
From bi- + <span class="searchmatch">connected</span>. biconnected (not comparable) (<span class="searchmatch">graph</span> theory) Describing a <span class="searchmatch">connected</span> <span class="searchmatch">graph</span> from which two vertices must be removed for it to become...
on: complete <span class="searchmatch">graph</span> Wikipedia complete <span class="searchmatch">graph</span> (plural complete <span class="searchmatch">graphs</span>) (<span class="searchmatch">graph</span> theory) A <span class="searchmatch">graph</span> where every pair of vertices is <span class="searchmatch">connected</span> by an edge. <span class="searchmatch">graph</span>...
Tarjan's algorithm (<span class="searchmatch">graph</span> theory) An algorithm for finding the strongly <span class="searchmatch">connected</span> components (SCCs) of a directed (<span class="searchmatch">connected</span>) <span class="searchmatch">graph</span> by using the depth-first...
<span class="searchmatch">connected</span> component (plural <span class="searchmatch">connected</span> components) (topology and <span class="searchmatch">graph</span> theory) A <span class="searchmatch">connected</span> subset that is, moreover, maximal with respect to being connected...
Blend of rectangle + <span class="searchmatch">graph</span> rectagraph (plural rectagraphs) (<span class="searchmatch">graph</span> theory) A triangle-free <span class="searchmatch">connected</span> <span class="searchmatch">graph</span> where any two vertices have 0 or 2 common neighbors...