A Comprehensive Study On Some Fundamental Problems In Graph Theory Using PYTHON

Article Sidebar

PDF
Published: Nov 24, 2023
DOI: https://doi.org/10.52783/tjjpt.v44.i3.2251
Keywords:
Eulerian Circuit - Hamiltonian path - Dijkstra’s Algorithm - Prim’s Algorithm - Minimum Spanning Tree.

Main Article Content

Dr. A.Venkatesan, Dr. S. Muthukumaran, Dr. A. Victoria Anand Mary, Dr. C. Christy

Abstract

In this paper some fundamental problems in graph theory such as finding the shortest path, Hamiltonian path, minimum weight of the spanning tree and determining whether a given graph is Eulerian are obtained by Python.

Article Details

Issue
Vol. 44 No. 3 (2023)
Section
Articles