<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Connected_component</id>
	<title>Connected component - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Connected_component"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Connected_component&amp;action=history"/>
	<updated>2026-05-15T01:19:11Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=Connected_component&amp;diff=988959&amp;oldid=prev</id>
		<title>132.204.251.253 at 18:11, 22 February 2024</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Connected_component&amp;diff=988959&amp;oldid=prev"/>
		<updated>2024-02-22T18:11:03Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;#039;&amp;#039;&amp;#039;Connected component&amp;#039;&amp;#039;&amp;#039; may refer to:&lt;br /&gt;
&lt;br /&gt;
*[[Connected component (graph theory)]], a set of vertices in a graph that are linked to each other by paths&lt;br /&gt;
*[[Connected component (topology)]], a maximal subset of a topological space that cannot be covered by the union of two disjoint non-empty open sets&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Connected-component labeling]], an algorithm for finding contiguous subsets of pixels in a digital image&lt;br /&gt;
&lt;br /&gt;
{{mathdab}}&lt;/div&gt;</summary>
		<author><name>132.204.251.253</name></author>
	</entry>
</feed>