graph

Classes to work with a graph. Currently, there is only one class: connectedComponentsLabeler. This class makes it possible to identifiy the connected components of an undirected graph. This little beamer presentation will enable you to understand how the algorithm work. This algorithm is, for example, used in the kad-clustering project to cluster parcels.

Created on Wed Dec 23 15:11:11 2020

@author: Youri.Baeyens

class graph.connectedComponentsLabeler(edges)[source]

A tool to identify the connected components of an undirected graph.

connectedComponentIdentifier(node)[source]: Identifies the connected component of a specific node.

link(nodeA, nodeB)[source]

Link two buildings.

If building A is linked with B, then they belong to the same connected component.

If connectedComponentIdentifier(A) != connectedComponentIdentifier(B) then we have to correct connectedComponentIdentifier().

This function actually “corrects” connectedComponentIdentifier

simplifyForest()[source]

Transform the forest into a list.

Function simplifyForest is used to store the connectedComponentIdentifier of every node in forest.