strongly-connected-components/CITATION.cff at master · GuidoBorrelli/strongly-connected-components · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
cff-version: 1.2.0
title: "Strongly Connected Components: Comparative Analysis of Tarjan, Nuutila, and Pearce Algorithms"
message: "If you use this software, please cite it using these metadata."
type: software
authors:
  - family-names: "Borrelli"
    given-names: "Guido"
    affiliation: "Politecnico di Milano"
abstract: "Implementation and performance comparison of three algorithms for finding strongly connected components in directed graphs: Tarjan's algorithm, Nuutila's algorithm, and Pearce's algorithm. Includes correctness testing, performance benchmarking, and memory analysis."
keywords:
  - "strongly connected components"
  - "graph algorithms"
  - "Tarjan algorithm"
  - "Nuutila algorithm"
  - "Pearce algorithm"
  - "performance analysis"
license: "MIT"
repository-code: "https://github.com/GuidoBorrelli/strongly-connected-components"
url: "https://github.com/GuidoBorrelli/strongly-connected-components"
date-released: 2018-06-01
version: 1.0.0