Skip to main content
SpringerLink
Log in

A Comparative Analysis of New Approach with an Existing Algorithm to Detect Cycles in a Directed Graph

  • Conference paper
ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India- Vol II

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 249))

Abstract

In various applications such as discovering infinite loops in computer programs, periodic scheduling, communication systems etc. there are always requirement for cycle detection. Graph theories and algorithms are very helpful for this type of problems. In this paper, we proposed our new SUS_CycleDetection algorithm for detecting cycle in any directed graph, with the help of linked list. This algorithm has the ability to count total number of cycles in the graph along with displaying the set of vertices responsible for the formation of each cycle. A comparison is also made between the proposed algorithm and an existing algorithm in terms of their modes of execution. Informer, space is allocated during runtime and nodes are stored using linked list which is more efficient in terms of memory utilization while in the latter, space is allocated before execution and nodes are stored using queue.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Puczynski, P.: The cycle detection algorithms, Wroclaw University of Technology, Faculty of Management

    Google Scholar 

  2. Van Gelder, A.: Efficient loop detection in Prolog using the tortoise-and-hare technique. Journal of Logic Programming 4(1), 23–31 (1987), doi:10.1016/0743-1066(87)90020-3.

    Article  MATH  Google Scholar 

  3. Silberschatz, A., Galvin, P., Gagne, G.: Operating System Concepts, p. 260. John Wiley & Sons, Inc. (2003) ISBN 0-471-25060-0

    Google Scholar 

  4. Nivasch, G.: Cycle detection using a stack. Information Processing Letters 90(3), 135–140 (2004), doi:10.1016/j.ipl.2004.01.016.

    Article  MathSciNet  MATH  Google Scholar 

  5. Rozenfeld, H.D., et al.: Statistics of cycles: how loopy is your network? J.Phys. A: Math.Gen. 38, 4589 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Medard, M., Lumetta, S.S.: Network reliability and fault tolerance. In: Proakis, J. (ed.) Wiley Encyclopaedia of Engineering

    Google Scholar 

  7. Liu, H., Wang, J.: A new way to enumerate cycles in graph., Tsinghua University, State Key Lab of Intelligent Technology and System Department of Computer Science and Technology

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CSE Department, ABES Engineering College, Ghaziabad, U.P., India

    Shubham Rungta, Samiksha Srivastava, Uday Shankar Yadav & Rohit Rastogi

Authors
  1. Shubham Rungta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Samiksha Srivastava
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Uday Shankar Yadav
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rohit Rastogi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shubham Rungta .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Anil Neerukonda Institute of Technology and Sciences, Vishakapatnam, India

    Suresh Chandra Satapathy

  2. College of Engineering(A), Andhra University, Vishakapatnam, India

    P. S. Avadhani

  3. University of Hyderabad, Hyderabad, India

    Siba K. Udgata

  4. CSIR-National Institute of Oceanography, Visakhapatnam, India

    Sadasivuni Lakshminarayana

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Rungta, S., Srivastava, S., Yadav, U.S., Rastogi, R. (2014). A Comparative Analysis of New Approach with an Existing Algorithm to Detect Cycles in a Directed Graph. In: Satapathy, S., Avadhani, P., Udgata, S., Lakshminarayana, S. (eds) ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India- Vol II. Advances in Intelligent Systems and Computing, vol 249. Springer, Cham. https://doi.org/10.1007/978-3-319-03095-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03095-1_5

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03094-4

  • Online ISBN: 978-3-319-03095-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation