Skip to content

Implementation of data stream algorithm for dynamic connected components

Notifications You must be signed in to change notification settings

vsevolod-oparin/stream-dynamic-components

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Data stream algorithm for connected components

Problem. We have a graph on n vertices and a stream of updates. Each update is either to add or to remove an edge from the graph. Initially, the graph is empty. The goal is to restore all connected components after all updates with probability 0.99.

This is an implementation of the algorithm which solves the problem. I use this code as an example to this post (in Russian):

Sources

About

Implementation of data stream algorithm for dynamic connected components

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages