Dynamic connectivity
id:
dynamic-connectivity-243-11841107
title:
Dynamic connectivity
text:
In computing and graph theory, a dynamic connectivity structure is a data structure that dynamically maintains information about the connected components of a graph. The set V of vertices of the graph is fixed, but the set E of edges can change. The three cases, in order of difficulty, are: Edges are only added to the graph;
Edges are only deleted from the graph;
Edges can be either added or deleted. After each addition/deletion of an edge, the dynamic connectivity structure should adapt itself
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Dynamic_connectivity
date created:
date modified:
2024-02-29T18:38:30Z
main entity:
{"identifier":"Q20018775","url":"https://www.wikidata.org/entity/Q20018775"}
image:
fields total:
13
integrity:
13