{"spdxVersion":"SPDX-2.3","dataLicense":"CC0-1.0","SPDXID":"SPDXRef-DOCUMENT","name":"com.github.aladdinpersson/Algorithms-Collection-Python","documentNamespace":"https://spdx.org/spdxdocs/protobom/35c2a683-6bf3-4e91-877c-d041270856e7","creationInfo":{"creators":["Tool: protobom-v0.0.0-20251216165153-1f3f3060931e+dirty","Tool: GitHub.com-Dependency-Graph"],"created":"2025-12-25T11:56:55Z"},"packages":[{"name":"egcd","SPDXID":"SPDXRef-pypi-egcd-0.0.1.1-75c946","versionInfo":"0.0.1.1","downloadLocation":"NOASSERTION","filesAnalyzed":false,"licenseConcluded":"MIT","externalRefs":[{"referenceCategory":"PACKAGE-MANAGER","referenceType":"purl","referenceLocator":"pkg:pypi/egcd@0.0.1.1"}]},{"name":"numpy","SPDXID":"SPDXRef-pypi-numpy-1.18.1-75c946","versionInfo":"1.18.1","downloadLocation":"NOASSERTION","filesAnalyzed":false,"licenseConcluded":"BSD-3-Clause","copyrightText":"(c) Covert Chebyshev, (c) Multiply a Chebyshev, (c) Multiply a Hermite, (c) Multiply a Laguerre, (c) Multiply a Legendre, (c), False, False, False, True, (c), False, False, True, False, (c), True, True, False, False, Copyright (c) 1992-2013 The University of Tennessee and The University of Tennessee Research Foundation, Copyright (c) 1993 by Sun Microsystems, Inc., Copyright (c) 1995, 1996, 1997 Jim Hugunin, hugunin@mit.edu, Copyright (c) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura, Copyright (c) 2000-2013 The University of California Berkeley, Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013 Python Software Foundation, Copyright (c) 2003-2005, Jean-Sebastien Roy (js@jeannot.org), Copyright (c) 2004-2018 Max-Planck-Society author Martin Reinecke, Copyright (c) 2005-2015, NumPy Developers, Copyright (c) 2005-2017, NumPy Developers, Copyright (c) 2005-2019, NumPy Developers, Copyright (c) 2005, NumPy Developers, Copyright (c) 2006-2013 The University of Colorado Denver, Copyright (c) 2006, University of Georgia and Pierre G.F. Gerard-Marchant, Copyright (c) 2007, 2011 David Schultz \u003cdas@FreeBSD.ORG\u003e, Copyright (c) 2008 Ian Bicking and Contributors, Copyright (c) 2008 Stefan van der Walt \u003cstefan@mentat.za.net\u003e , Pauli Virtanen \u003cpav@iki.fi\u003e, Copyright (c) 2009-2019 Jeff Bezanson, Stefan Karpinski, Viral B. Shah, and other contributors, Copyright (c) 2010 by Mark Wiebe (mwwiebe@gmail.com) The University of British Columbia, Copyright (c) 2010-2011 by Mark Wiebe (mwwiebe@gmail.com) The University of British Columbia, Copyright (c) 2011 by Enthought, Inc., Copyright (c) 2011 by Mark Wiebe (mwwiebe@gmail.com) The University of British Columbia, Copyright (c) 2011 Enthought, Inc, Copyright (c) 2011 Kevin Dunn, Surya K, Pauli Virtanen, the Sphinx team, Copyright (c) 2012 Stephen Montgomery-Smith \u003cstephen@FreeBSD.ORG\u003e, Copyright (c) 2014 Ryan Juckett, Copyright (c) 2015 Melissa E. O'Neill, Copyright (c) 2015 Pauli Virtanen, Copyright (c) 2018 Melissa E. O'Neill, Copyright (c) 2019 Kevin Sheppard, Copyright (c) 2019 NumPy Developers, Copyright 1999 - 2011 Pearu Peterson, Copyright 1999 2011 Pearu Peterson, Copyright 1999-2004 Pearu Peterson, Copyright 1999, 2000, 2001 Regents of the University of California, Copyright 1999,2000 Pearu Peterson, Copyright 2000 Pearu Peterson, Copyright 2001-2005 Pearu Peterson, Copyright 2002 Pearu Peterson, Copyright 2006, Dean Edwards, Copyright 2007-2011 by the Sphinx team, Copyright 2007-2017 by the Sphinx team, Copyright 2007-2018 by the Sphinx team, copyright 2008-2019, The SciPy community, copyright 2010 David Wolever \u003cdavid@wolever.net\u003e, Copyright 2010-2012, D. E. Shaw Research, Copyright 2011 by Enthought, Inc, Copyright 2012 Twitter, Inc, Copyright 2014 Melissa O'Neill \u003coneill@pcg-random.org\u003e, Copyright 2014 PSF., Copyright 2015 Robert Kern \u003crobert.kern@gmail.com\u003e, Copyright Absoft Corporation, Copyright Absoft Corporation 1994-1998 mV2 Cray Research, Inc. 1994-1996 CF90, Copyright Absoft Corporation 1994-2002 Absoft Pro FORTRAN, copyright e (c), copyright u'2013, Surya Kasturi and Pauli Virtanen, copyright u'2017-2018, NumPy Developers, copyright u'2017, numpydoc","externalRefs":[{"referenceCategory":"PACKAGE-MANAGER","referenceType":"purl","referenceLocator":"pkg:pypi/numpy@1.18.1"}]},{"name":"bitarray","SPDXID":"SPDXRef-pypi-bitarray-1.2.1-75c946","versionInfo":"1.2.1","downloadLocation":"NOASSERTION","filesAnalyzed":false,"licenseConcluded":"PSF-2.0","copyrightText":"Copyright (c) 2008 - 2019, Ilan Schnell, Copyright (c) 2019, Ilan Schnell","externalRefs":[{"referenceCategory":"PACKAGE-MANAGER","referenceType":"purl","referenceLocator":"pkg:pypi/bitarray@1.2.1"}]},{"name":"sympy","SPDXID":"SPDXRef-pypi-sympy-1.5.1-75c946","versionInfo":"1.5.1","downloadLocation":"NOASSERTION","filesAnalyzed":false,"licenseConcluded":"BSD-2-Clause","copyrightText":"(c) , sin(a) cos, (c) (-1) cos, (c) + (sin(a) cos(b) + sin(b) cos(a)) cos, (c) + cos, (c) + cos(a) cos, (c) + sin(b) cos(a) cos, (c) A. B, (c) Copyright 2000-2003 Symbolic Computation Laboratory, University of Western Ontario, London, Canada N6A, (c) cos(b), -sin(b) sin(a) sin(b) cos, (c) Fix Qasm, (c) G PermutationGroup Permutation, (c) Matrix I, (c) tan(b) + a cos, (c) tan(b) a + sin(b) cos, (c), -sin(a) cos, (c), cos, (c), cot, (c), sin(a) sin(b) cos, CoprimeQ, Distribute, ProductLog, Floor, PolyGamma, Copyright (c) 2001, 2002 Vasil Yaroshevich, Copyright (c) 2006-2014 SymPy developers, Copyright (c) 2006-2017 SymPy Development Team, 2013-2017 Sergey B Kirpichev, Copyright (c) 2006-2019 SymPy Development Team, Copyright (c) 2008 Jens Rasch \u003cjyr2000@gmail.com\u003e, Copyright (c) 2008 The IPython Development Team, Copyright (c) 2014 Matthew Rocklin, Copyright 2007-2013 by the Sphinx team, Copyright 2014 by the SymPy Development Team, copyright 2015, SymPy Development Team, Copyright 2016, copyright 2019 SymPy Development Team","externalRefs":[{"referenceCategory":"PACKAGE-MANAGER","referenceType":"purl","referenceLocator":"pkg:pypi/sympy@1.5.1"}]},{"name":"unionfind","SPDXID":"SPDXRef-pypi-unionfind-0.0.10-75c946","versionInfo":"0.0.10","downloadLocation":"NOASSERTION","filesAnalyzed":false,"externalRefs":[{"referenceCategory":"PACKAGE-MANAGER","referenceType":"purl","referenceLocator":"pkg:pypi/unionfind@0.0.10"}]},{"name":"com.github.aladdinpersson/Algorithms-Collection-Python","SPDXID":"SPDXRef-github-aladdinpersson-Algorithms-Collection-Python-master-912eac","versionInfo":"master","downloadLocation":"git+https://github.com/aladdinpersson/Algorithms-Collection-Python","filesAnalyzed":false,"licenseDeclared":"MIT","externalRefs":[{"referenceCategory":"PACKAGE-MANAGER","referenceType":"purl","referenceLocator":"pkg:github/aladdinpersson/Algorithms-Collection-Python@master"}]}],"relationships":[{"spdxElementId":"SPDXRef-github-aladdinpersson-Algorithms-Collection-Python-master-912eac","relatedSpdxElement":"SPDXRef-pypi-numpy-1.18.1-75c946","relationshipType":"DEPENDS_ON"},{"spdxElementId":"SPDXRef-github-aladdinpersson-Algorithms-Collection-Python-master-912eac","relatedSpdxElement":"SPDXRef-pypi-bitarray-1.2.1-75c946","relationshipType":"DEPENDS_ON"},{"spdxElementId":"SPDXRef-github-aladdinpersson-Algorithms-Collection-Python-master-912eac","relatedSpdxElement":"SPDXRef-pypi-sympy-1.5.1-75c946","relationshipType":"DEPENDS_ON"},{"spdxElementId":"SPDXRef-github-aladdinpersson-Algorithms-Collection-Python-master-912eac","relatedSpdxElement":"SPDXRef-pypi-unionfind-0.0.10-75c946","relationshipType":"DEPENDS_ON"},{"spdxElementId":"SPDXRef-github-aladdinpersson-Algorithms-Collection-Python-master-912eac","relatedSpdxElement":"SPDXRef-pypi-egcd-0.0.1.1-75c946","relationshipType":"DEPENDS_ON"},{"spdxElementId":"SPDXRef-DOCUMENT","relatedSpdxElement":"SPDXRef-github-aladdinpersson-Algorithms-Collection-Python-master-912eac","relationshipType":"DESCRIBES"}]}