Call for Paper - November 2022 Edition
IJCA solicits original research papers for the November 2022 Edition. Last date of manuscript submission is October 20, 2022. Read More

Shortest Paths between two Points in Space for Self Managed Digital Systems

Print
PDF
International Journal of Computer Applications
© 2014 by IJCA Journal
Volume 100 - Number 13
Year of Publication: 2014
Authors:
Manoj Kumar
10.5120/17582-8284

Manoj Kumar. Article: Shortest Paths between two Points in Space for Self Managed Digital Systems. International Journal of Computer Applications 100(13):1-3, August 2014. Full text available. BibTeX

@article{key:article,
	author = {Manoj Kumar},
	title = {Article: Shortest Paths between two Points in Space for Self Managed Digital Systems},
	journal = {International Journal of Computer Applications},
	year = {2014},
	volume = {100},
	number = {13},
	pages = {1-3},
	month = {August},
	note = {Full text available}
}

Abstract

In this paper, It has been proved that there can be more than one shortest path between two different points in space for self managed digital systems with finite memory space. Also, a formula has been given, that can be used to find total number of different paths between given two points.

References

  • Donald Hearn and M. Pauline Baker. Computer Graphics C version. Dorling Kindersley (India) Pvt. Ltd. , Licensees of Pearson Education in South Asia, 2008.
  • Edgar A. Kraut. Fundamentals of Mathematical Physics. Dover Publications, 2007.
  • V. Rajaraman and T. Radhakrishnan. An Introduction to Digital Computer Design. Prentice-Hall of India Private Limited New Delhi, fourth edition, June 1998.
  • James A. Storer and John H. Reif. Shortest paths in the plane with polygon obstacles. Journal of the Association for Computing Machinery, 41, No. 5:982–1012, september 1994.