Skip to main content
SpringerLink
Log in

Algorithmus 26 An algorithm for finding the transitive closure of a digraph

Ein Algorithmus für die transitive Hülle eines gerichteten Graphen

  • Algorithmus
  • Published:
Computing Aims and scope Submit manuscript

Abstract

The programme finds the transitive closure of a digraph by the method (b) of, Dzikiewicz which has been presented in the paper [1].

Zusammenfassung

Das Programm findet die transitive Hülle eines gerichteten Graphen mittels Methode (b) von Dzikeiwicz, die in [1] veröffentlicht ist.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Dzikiewicz, J., and M. M. Sysło, Computational experiences with some transitive closure algorithms. Computing15, 33–39 (1975).

    Google Scholar 

  2. Sysło, M. M.: Algorithm 36. Transitive closure of a graph, Zastosow. Matem.14, 477–480 (1974).

    Google Scholar 

  3. Tarjan, R. E.: Depth-first search and linear graph algorithms. SIAM J. Comput.1, 146–160 (1972).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Material Science and Technical Mechanics, Technical University of Wrocław, Smoluchowskiego 25, Wrocław, Poland

    J. Dzikiewicz

Authors
  1. J. Dzikiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dzikiewicz, J. Algorithmus 26 An algorithm for finding the transitive closure of a digraph. Computing 15, 75–79 (1975). https://doi.org/10.1007/BF02252839

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02252839

Keywords

Search

Navigation