Skip to content

Transitive Closure

Jump to bottom
Alex Aubé edited this page Apr 15, 2015 · 2 revisions

Transitive Closure

Graph constructed from an initial graph, which includes new arcs(edges) representing all the indirect paths that exists in the initial graph

Transitive-closure

  • Complexity => Θ(n4)
Tests
Oriented Object Achitecture
Solid Principles
Design Patterns
Clean Code
Data Structures
Algorithms
Graphs
Software Engineering Processes

Clone this wiki locally