Skip to main content
  • Home
  • Development
  • Documentation
  • Donate
  • Operational login
  • Browse the archive

swh logo
SoftwareHeritage
Software
Heritage
Archive
Features
  • Search

  • Downloads

  • Save code now

  • Add forge now

  • Help

Raw File Download
Permalink

To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.

  • content
content badge Iframe embedding
swh:1:cnt:20b3672a55e699638cc3af5b2da606f32e4ca8eb
Citations

This interface enables to generate software citations, provided that the root directory of browsed objects contains a citation.cff or codemeta.json file.
Select below a type of object currently browsed in order to generate citations for them.

  • content
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
"""This file is for a a future update...."""

from sage.all import Graph, InfinitePolynomialRing, PolynomialRing

class StrataGraph2(object):
    KappaRing = InfinitePolynomialRing(ZZ, "K")
    K = KappaRing.gen()

    PsiRing = PolynomialRing(ZZ,"psi")
    psi = PsiRing.gen()


    def __init__(self, strataG):
        #make the graph

        graphU = Graph()

        for v in range(1,strataG.num_vertices()):
            G.add_vertex(v)
            for expon, coef in strataG.M[v,0].dict().items():
                if expon[0] == 1:
                    genus = coef
                else:
                    pass





        self.decorations = dict()

        dec_items = self.decorations.items()
        dec_items.sort(lambda x: x[1])

        parts = []
        prev = None
        dec_list = []

        for a in dec_items:
            if a != prev:
                dec_list.append(a[1])
                parts.append(new_part)
                new_part = [a[0]]
            else:
                new_part.append(a[0])

        self.dec_list = tuple(dec_list)

        self.graph, cert = graphUncan.canoncial_labeling(parts).copy(immutable = True)

        self.parts = tuple(( tuple([cert[i] for i in part_j].sort) for part_j in parts))

    def __eq__(self,other):
        return self.parts == other.parts and self.dec_list == other.dec_list and self.graph == other.graph

    def __hash__(self):
        return hash(self.parts, self.graph, self.dec_list)










back to top

Software Heritage — Copyright (C) 2015–2025, The Software Heritage developers. License: GNU AGPLv3+.
The source code of Software Heritage itself is available on our development forge.
The source code files archived by Software Heritage are available under their own copyright and licenses.
Terms of use: Archive access, API— Contact— JavaScript license information— Web API