# name
Descomposició de grafs en components i blocs: anàlisi, simulacions i aplicacions

# metadata.dc.description[].value
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2019, Director: Antoni Benseny

# metadata.dc.description.abstract[].value
[en] A block of a graph is a connected subgraph which does not contain any articulation
point. A strongly connected component of a directed graph is a subraph in which every vertex is reachable from every other vertex in the subgraph through an oriented path. This project consists in applying extensions on search algorithms in order to detect blocks and strongly connected components in graphs and directed graphs respectively, and implement them in a computer program with a visual environment.

# metadata.dc.rights[].value
cc-by-nc-nd (c) Marc de San Martı́n Pons, 2019

# metadata.dc.source[].value
Treballs Finals de Grau (TFG) - Matemàtiques

# metadata.dc.title[].value
Descomposició de grafs en components i blocs: anàlisi, simulacions i aplicacions