Call for Paper - January 2024 Edition
IJCA solicits original research papers for the January 2024 Edition. Last date of manuscript submission is December 20, 2023. Read More

Representation and Analysis of Object Oriented Graph (OOG): A Graph Algorithmic Approach

International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 55 - Number 4
Year of Publication: 2012
Gitosree Khan
Sabnam Sengupta
Ananya Kanjilal

Gitosree Khan, Sabnam Sengupta and Ananya Kanjilal. Article: Representation and Analysis of Object Oriented Graph (OOG): A Graph Algorithmic Approach. International Journal of Computer Applications 55(4):30-37, October 2012. Full text available. BibTeX

	author = {Gitosree Khan and Sabnam Sengupta and Ananya Kanjilal},
	title = {Article: Representation and Analysis of Object Oriented Graph (OOG): A Graph Algorithmic Approach},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {55},
	number = {4},
	pages = {30-37},
	month = {October},
	note = {Full text available}


One of the primary concerns of the software industry lies in producing good quality software within estimated budget and time. With increased complexity of function rich software systems being developed and client's emphasis on quality and conformance, lot of effort is invested in testing of a software product. In Object Oriented Graph, the graph data is stored in the form of a 3 dimensional matrix, i. e. sparse matrix. To address that problem, an enhancement of Object Oriented Graph is done, where our result shows a more efficient and effective Data Structure called Hierarchical Graph Adjacency List i. e. HGAL in which for each vertex in the graph, a list of all other vertices which it has an edge to (that vertex's "adjacency list"). In this paper, we have proposed three algorithm called Implementation of Hierarchical Graph into Adjacency List i. e. , IHGAL for representation of an OOG to adjacency list and Identifying Constructs of Hierarchical Graph i. e. ICHG to identify different constructs and analyze the OOG ,Test Path Search (TPS) and Traversal of Trace Path i. e. TTP . On the basis of HGAL data structure our result shows all best possible paths with minimum test cases and detect minimum no. of independent paths in line with the definition of McCabe's Cyclomatic complexity and measure the number of test path of different nodes in the OOG for finding the traceability among different phases of SDLC.


  • Ananya Kanjilal, Sabnam Sengupta, Swapan Bhattacharya, "A Graph Model for Analysis of OO Systems", Horizons of Computer Research, Vol 1, Nova Publishers, 2008.
  • Ananya Kanjilal, Goutam Kanjilal, Swapan Bhattacharya, "Integration of Design in Distributed Development using D-Scenario Graph", Third International Conference on Global Software Engineering (ICGSE?08), Bangalore, India, pp 141-150, August 17-20, 2008.
  • Swapan Bhattacharya and Ananya Kanjilal "Code Based Analysis of Object Oriented Systems", Journal of Computer Science & Technology JCST, Vol 21, No. 6, pp 965-972, November 2006.
  • Paolo Baldan, Andrea Corradini and Fabio Gadducci Specifying and Verifying UML Activity Diagrams Via Graph Transformation Lecture Notes in Computer Science Springer Berlin / Heidelberg 18-33Volume 3267/2005.
  • Ananya Kanjilal, Goutam Kanjilal and Swapan Bhattacharya, "Extended Control Flow graph: An empirical approach", Proceedings of CIT'03, Sixth International Conference on Information Technology, Bhubaneswar, India, December 22-25, 2003, page 151-156.
  • Dong Xu Wei Liu Zongtian Liu Philbert, N. , "Tool Support to Deriving Test Scenarios from UML Activity Diagrams", International Symposium on Information Science and Engineering (ISISE, 2008) '08, pp 73-76, 20-22 Dec. 2008.
  • Dong Xu, Philbert, N. , Zongtian Liu, Wei Liu, "Towards Formalizing UML Activity Diagrams in CSP", International Symposium on Computer Science and Computational Technology, 2008. ISCSCT '08, pp. 450 - 453 20-22 Dec. 2008
  • Eshuis, R. Wieringa, R. , Tool support for verifying UML activity diagrams IEEE Transactions on Software Engineering, Volume: 30 , Issue: 7 pp437 - 447 July 2004
  • Debasish Kundu, Monalisa Sarma, Debasis Samanta, "A Novel Approach to System Testing and Reliability Assessment Using Use Case Model", 1st Indian Software Engineering Conference (ISEC), Hyderabad, India, Feb 20-21, 2008
  • Monalisa Sarma, Debasish Kundu, Rajib Mall, "Automatic Test Case generation from UML Sequence diagrams", Proceedings of International Conference on Advanced Computing and Communications, ADCOM 2007, Guwahati, India, pp 60-67, December 18-21, 2007.
  • Robert Binder, "Testing Object-Oriented Systems: Models, Patterns and Tools", Addison-Wesley, pp 582-583, 1999.
  • W. J Lloyd, M. B Rosson, J. D Arthur, "Effectiveness of elicitation techniques in distributed requirement engineering", Proceedings of IEEE Joint International Conference on Requirements Engineering", Essen, Germany, pp. 311-318, September 9-13, 2002.
  • A. Bertolino, M. Marre , "Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs"", IEEE Transactions on Software Engineering, pp. 885-899, December 1994.
  • Sabnam Sengupta, Ananya Kanjilal, Swapan Bhattacharya: Measuring complexity of component based architecture: a graph based approach. ACM SIGSOFT Software Engineering Notes 36(1): 1-10, 2011.
  • Ananya Kanjilal, Sabnam Sengupta, Swapan Bhattacharya: Scenario path identification for distributed systems: A graph based approach. International Symposium on Rapid System Prototyping 2010: 1-8.