Saravanan666/pypi-org huggingface dataset:
Package: uuid25
Uuid25: 25-digit case-insensitive UUID encodingUuid25 is an alternative UUID representation that shortens a UUID string to just
25 digits using the case-insensitive Base36 encoding. This library provides
functionality to convert from the conventional UUID formats to Uuid25 and vice
versa.fromuuid25importUuid25# convert from/to stringa=Uuid25.parse("8da942a4-1fbe-4ca6-852c-95c473229c7d")asserta.value=="8dx554y5rzerz1syhqsvsdw8t"asserta.to_hyphenated()=="8da942a4-1fbe-4ca6-852c-95c473229c7d"# convert from/to 128-bit byte arrayb=Uuid25.from_bytes(bytes([0xFF]*16))assertb.value=="f5lxx1zz5pnorynqglhzmsp33"assertall([x==0xFFforxinb.to_bytes()])# convert from/to other popular textual representationsc=[Uuid25.parse("e7a1d63b711744238988afcf12161878"),Uuid25.parse("e7a1d63b-7117-4423-8988-afcf12161878"),Uuid25.parse("{e7a1d63b-7117-4423-8988-afcf12161878}"),Uuid25.parse("urn:uuid:e7a1d63b-7117-4423-8988-afcf12161878"),]assertall([x.value=="dpoadk8izg9y4tte7vy1xt94o"forxinc])d=Uuid25.parse("dpoadk8izg9y4tte7vy1xt94o")assertd.to_hex()=="e7a1d63b711744238988afcf12161878"assertd.to_hyphenated()=="e7a1d63b-7117-4423-8988-afcf12161878"assertd.to_braced()=="{e7a1d63b-7117-4423-8988-afcf12161878}"assertd.to_urn()=="urn:uuid:e7a1d63b-7117-4423-8988-afcf12161878"# convert from/to standard uuid module's UUID valueimportuuiduuid_module=uuid.UUID("f38a6b1f-576f-4c22-8d4a-5f72613483f6")e=Uuid25.from_uuid(uuid_module)asserte.value=="ef1zh7jc64vprqez41vbwe9km"asserte.to_uuid()==uuid_module# generate UUIDv4 in Uuid25 format (backed by uuid module)importuuid25print(uuid25.gen_v4())# e.g. "99wfqtl0z0yevxzpl4hv2dm5p"LicenseLicensed under the Apache License, Version 2.0.
Package: uuid64
This is a simple script that generates a 64bit UUID. The normal type of UUID
(e.g. those available in the uuid module) are 128bit, which provides
substantially greater ability to avoid collision between generated values.
However, it is sometimes convenient to have a smaller UUID, e.g. if the number
of generated values is not terribly large or will not be generated in large
batches. Or, perhaps, due to a lack of support for 128bit integers.The algorithm used to generate these UUIDs is very simple. The UUID consists of
two 32bit parts. The first part is base upon the current time (seconds since the
beginning of epoch). When UUIDs are not generated in batches, i.e. all at the
same time, the time acts as an incrementing value so that UUID generate many
seconds apart are almost certain to be different (note that clock timing on
different machines means that this is not a guarantee).The second part is a 32bit random number taken from the system that the script
is running on, e.g. on linux the value is taken from /dev/urandom rather than a
pseudo-random generator.
Package: uuid7
This module implements the version 7 UUIDs, proposed by Peabody and Davis inhttps://www.ietf.org/id/draft-peabody-dispatch-new-uuid-format-02.htmlas an extension to RFC4122.Version 7 has the nice characteristic that the start of a UUID encodes
the time with a chronological sort order and potentially ~50ns time
resolution, while the end of the UUID includes sufficient random bits to
ensure consecutive UUIDs will remain unique.Implementation notesThe 128 bits in the UUID are allocated as follows:36 bits of whole seconds24 bits of fractional seconds, giving approx 50ns resolution14 bits of sequential counter, if called repeatedly in same time tick48 bits of randomnessplus, at locations defined by RFC4122, 4 bits for the uuid version (0b111) and 2 bits for the uuid variant (0b10).0                   1                   2                   3
         0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
        +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
t1      |                 unixts (secs since epoch)                     |
        +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
t2/t3   |unixts |  frac secs (12 bits)  |  ver  |  frac secs (12 bits)  |
        +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
t4/rand |var|       seq (14 bits)       |          rand (16 bits)       |
        +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
rand    |                          rand (32 bits)                       |
        +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+Indicative timings:uuid.uuid4()- 2.4usuuid7()- 3.7usuuid7(as_type=’int’)- 1.6usuuid7(as_type=’str’)- 2.5usInstallation>pipinstalluuid7Usage>>> from uuid_extensions import uuid7, uuid7str
>>> uuid7()
UUID('061cb26a-54b8-7a52-8000-2124e7041024')

>>> uuid7(0)
UUID('00000000-0000-0000-0000-00000000000')

>>> for fmt in ('bytes', 'hex', 'int', 'str', 'uuid', None):
...     print(fmt, repr(uuid7(as_type=fmt)))
bytes b'\x06\x1c\xb8\xfe\x0f\x0b|9\x80\x00\tjt\x85\xb3\xbb'
hex '061cb8fe0f0b7c3980011863b956b758'
int 8124504378724980906989670469352026642
str '061cb8fe-0f0b-7c39-8003-d44a7ee0bdf6'
uuid UUID('061cb8fe-0f0b-7c39-8004-0489578299f6')
None UUID('061cb8fe-0f0f-7df2-8000-afd57c2bf446')

>>> uuid7str() # Shorthand for uuid7(as_type='str')
'061cb26a-54b8-7a52-8000-2124e7041024'LicenceFree software: MIT licenseHistory0.1.0 (2021-12-28)First release on PyPI.
Package: uuid-by-string
uuid-by-stringGenerate the RFC-4122 Name-Based UUID. Supports 3 (md5) and 5(sha1) versions of UUID. Referenced fromdanakt/uuid-by-string: Generates the RFC-4122 Name-Based UUID.Install$pipinstalluuid-by-stringUsagefromuuid_by_stringimportgenerate_uuiduuid=generate_uuid("a string")# 555d01e6-c832-56b3-a9f9-2bd811905370uuid_v3=generate_uuid("❤️",version=3)# 080c1417-9a0e-3386-a131-a7fa8dbe2c51uuid_v5=generate_uuid("❤️",5)# f11c13f0-5595-551d-bdee-e6c2e43fd2a9
Package: uuid-cbr
Реализация SWIG интерфейса библиотеки uuid от ЦБ РФ для PythonБиблиотека uuid загружена с официального сайта ЦБ РФ (https://cbr.ru/ckki/assignment_unique_id/)Установка:С помощью pip installpip install uuid_cbrПример использования:>>>  import uuid_cbr as uuuid
>>>  print(uuuid.uuid())
e4028fe0-2c49-11eb-98b1-6d42da06be14-6
Package: uuid-shortener-py
uuid_shorteneruuid_shorteneris a library for shortening UUIDs into an alphanumerical format suitable for usage in URLs.The alphanumerical format is Flicker base 58 encoding.InstallationfromPypi:pip install uuid-shortener-pyModule usageTheUuidShortenerobject can be created with/without a prefix.Example 1: without prefixfromuuid_shortenerimportUuidShortenerfromuuidimportuuid4if__name__=="__main__":print('******** Without prefix')shortener=UuidShortener()uuid_4=uuid4()short_uuid=shortener.shorten(uuid_4)unshortened_uuid=shortener.unshorten(short_uuid)print(f'Uuid to shorten:{uuid_4}')print(f'shortened uuid:{short_uuid}')print(f'unshortened uuid(original uuid):{shortener.unshorten(short_uuid)}')Output 1:******** Without prefix
Uuid to shorten: 177d1b53-77d5-42b2-8b8f-8d86579deb52
shortened uuid: 3Ueemi554rN46ioLFw3dZG
unshortened uuid(original uuid): 177d1b53-77d5-42b2-8b8f-8d86579deb52Example 2: with prefixfromuuid_shortenerimportUuidShortenerfromuuidimportuuid4if__name__=="__main__":print('******** With prefix')shortener=UuidShortener('meow')uuid_4=uuid4()short_uuid=shortener.shorten(uuid_4)unshortened_uuid=shortener.unshorten(short_uuid)print(f'Uuid to shorten:{uuid_4}')print(f'shortened uuid:{short_uuid}')print(f'unshortened uuid (original uuid):{shortener.unshorten(short_uuid)}')Output 2:******** With prefix
Uuid to shorten: 2bea23d4-2b96-485d-8788-0c606ab93319
shortened uuid: meow-6qwbaCZnHtxJsj4uJTKJSV
unshortened uuid (original uuid): 2bea23d4-2b96-485d-8788-0c606ab93319As an easy, one-way generatorfromuuid_shortenerimportShortUuidGeneratorfromuuidimportuuid4if__name__=="__main__":print('******** Generator')uuid_gen=ShortUuidGenerator(prefix='meow',uuid=uuid4)print('Shortened uuid 1:{}'.format(uuid_gen()))print('Shortened uuid 2:{}'.format(uuid_gen()))Output 3:******** Generator
Shortened uuid 1: meow-9ubC52uXU1MM9PcrUMaNNc
Shortened uuid 2: meow-wqTnxvHfWzrPvREcVi5RAfLicenseMIT
Package: uuidt
UUIDTTimestamp-orderable UUIDs for Python, written in Rust.InstallationpipinstalluuidtUsageimportuuidt# Create a new UUIDTu=uuidt.new('my-namespace')# Print the UUIDT propertiesprint(u.namespace)print(u.timestamp)print(u.hostname)print(u.random_chars)# Convert to a stringprint(str(u))# Extract the timestamp from a UUIDT stringprint(uuidt.extract_timestamp("cr3su3qh-4ium-00bk-00ip-vqlpgpomk3dv"))# 1678562753992474990MotivationUUIDs are great for generating unique identifiers, but they are not
necessarily time-orderable. This is a problem if you want to generate a UUID
for a new record in a database, and then use that UUID to order the records
by creation time.Many databases avoid this problem using auto-incrementing integer IDs, but
this isn't possible in distributed databases likeCockroachDB, so a UUID is typically used as
the primary key instead.This library generates UUIDs that are time-orderable. The first 12 alphanumeric
characters of the UUID are a nanosecond-precision timestamp which has been
base-36 encoded, so they can be sorted lexicographically. The remaining 20
characters are a combination of a namespace, the hostname of the machine that
generated the UUID, and a random string.Technically, UUID1s are also time-orderable, but they are not guaranteed to
be ordered by creation time, and it can be difficult to extract the
timestamp from a UUID1.Why Rust?Mostly as a learning opportunity for me, though also for speed. The Rust
implementation is significantly faster than the Python implementation, which
used Numpy to convert to base-36.What if I don't want the Rust implementation?UUIDT should be installable as a wheel on most systems, but if you hate Ferris
and want to use the Python implementation instead, here's some equivalent
code:importrandomimportsocketimporttimeimportnumpyasnpBASE=36DIVISOR=BASE-1CHARACTERS=list('0123456789abcdefghijklmnopqrstuvwxyz')[:BASE]classUUIDT:def__init__(self,namespace:str,timestamp:int,hostname:str,random_chars:str):self.namespace=namespaceself.timestamp=timestampself.hostname=hostnameself.random_chars=random_charsdef__str__(self):hostname_enc=sum(self.hostname.encode('utf-8'))namespace_enc=sum(self.namespace.encode('utf-8'))timestamp_str=np.base_repr(self.timestamp,36).lower()hostname_str=np.base_repr(hostname_enc,36).lower()namespace_str=np.base_repr(namespace_enc,36).lower()return(f'{timestamp_str[:8]}-{timestamp_str[8:]}-{hostname_str:0>4}-'f'{namespace_str:0>4}-{self.random_chars}')defnew(namespace:str)->UUIDT:timestamp=time.time_ns()hostname=socket.gethostname()random_chars=''.join(random.choices(CHARACTERS,k=4))returnUUIDT(namespace,timestamp,hostname,random_chars)LicenseMITUsing UUIDT in your projectWhile UUIDT is MIT licensed, I'm really curious to seeing the projects that
use it! If you use UUIDT in your project, I'd love to hear about it! Please
let me know by either opening an issue or sending me an email at the address
in thepyproject.tomlfile.ContributingContributions are welcome! Just open an issue or a pull request.
Package: uuidtools
UUIDToolsUUIDTools is a tiny toolkit for working with uuids inside pandas dataframes or series,
this toolkit will help you to extract uuids from string (normalized and not normalized) databases,
and also permutate the ids into new ones preserving all the relations between diffrent tables.Requierments:Python 3
uuidInstallation:pip install UUIDToolsUsage and use case:The usecase of this tool is mainly to copy SQL based tables with relations,
having two tables that you want to copy and export or reinsert but with different ids:IDparent ID2d452c66-7ede-403e-8b72-fe02d8bd24edd009237f-1899-421a-b2d1-21fa3f7c31032d452c66-7ede-403e-8b72-fe02d8bd24ededb66645-fef8-4359-b0e8-097868ed07479d044ff0-1c81-4bb8-b15b-33e60abfcc9cf22fd493-fcd5-46ac-9014-3a4b1a96b4f2ID (Parent)Named009237f-1899-421a-b2d1-21fa3f7c3103Person 1edb66645-fef8-4359-b0e8-097868ed0747Person 2f22fd493-fcd5-46ac-9014-3a4b1a96b4f2Person 3If you need to generate new ids but you want to preserve the relations you can not
generate new random ids, this library will use the previous id as a seed for the next id generationIDsd009237f-1899-421a-b2d1-21fa3f7c3103, something that is not id, d009237f-1899-421a-b2d1-21fa3f7c3103d980ce44-c8c3-4eb6-8e4c-1dbaed891c21f22fd493-fcd5-46ac-9014-3a4b1a96b4f2, d4b8fb9f-c048-4a60-8860-9b0edff0d838, bla blaUsing this tool you can easily get the uuids contained:IDs{d009237f-1899-421a-b2d1-21fa3f7c3103}{d980ce44-c83c-4eb6-8e4c-1dbaed891c21}{f22fd493-fcd5-46ac-9014-3a4b1a96b4f2,d980ce44-c8c3-4eb6-8e4c-1dbaed891c21}Which is the set of the uuids above.
Package: uuid-utils
Python UUID UtilsPython UUID implementation using Rust's UUID library.
This will makeuuid4function around 10x faster.This package can be a drop-in replacement to the standard library UUID
which implements existing UUID versions like V4 in Rust
and also adds draft UUID versions like V6.Avaialble UUID versions:uuid1- Version 1 UUIDs using a timestamp and monotonic counter.uuid3- Version 3 UUIDs based on the MD5 hash of some data.uuid4- Version 4 UUIDs with random data.uuid5- Version 5 UUIDs based on the SHA1 hash of some data.uuid6- Version 6 UUIDs using a timestamp and monotonic counter.uuid7- Version 7 UUIDs using a Unix timestamp ordered by time.uuid8- Version 8 UUIDs using user-defined data.Please note that UUID versions 6, 7 and 8 are still in draft RFC.Installation$pipinstalluuid-utilsExample>>>importuuid_utilsasuuid

>>># make a random UUID>>>uuid.uuid4()UUID('ffe95fcc-b818-4aca-a350-e0a35b9de6ec')>>># make a random UUID using a Unix timestamp which is time-ordered.>>>uuid.uuid7()UUID('018afa4a-0d21-7e6c-b857-012bc678552b')>>># make a UUID using a SHA-1 hash of a namespace UUID and a name>>>uuid.uuid5(uuid.NAMESPACE_DNS,'python.org')UUID('886313e1-3b8a-5372-9b90-0c9aee199e5d')>>># make a UUID using an MD5 hash of a namespace UUID and a name>>>uuid.uuid3(uuid.NAMESPACE_DNS,'python.org')UUID('6fa459ea-ee8a-3ca4-894e-db77e160355e')BenchmarksBenchmarkMinMaxMeanMin (+)Max (+)Mean (+)UUID V10.0580.0590.0580.005 (12.0x)0.005 (11.9x)0.005 (12.0x)UUID V30.0630.0640.0630.008 (7.9x)0.008 (8.1x)0.008 (8.0x)UUID V40.0410.0410.0410.004 (11.1x)0.004 (10.8x)0.004 (10.9x)UUID V50.0640.0660.0650.008 (8.1x)0.008 (8.1x)0.008 (8.1x)UUID from hex0.0240.0250.0240.004 (6.7x)0.004 (6.6x)0.004 (6.6x)UUID from bytes0.0240.0250.0240.004 (6.7x)0.004 (6.6x)0.004 (6.7x)UUID from int0.0240.0250.0240.004 (6.6x)0.004 (6.7x)0.004 (6.6x)UUID from fields0.0280.0280.0280.009 (3.1x)0.009 (3.1x)0.009 (3.1x)How to develop locally$makebuild
$maketestOr:$RUSTFLAGS="--cfg uuid_unstable"maturindevelop--release
Package: uuid-v7
UUID v7 and v6This package extends the built-inuuidmodule to include UUID v7 and v6.Install it from PyPIpipinstalluuid_v7Usagefromuuid_v7importuuidv7,uuidv6print(uuidv7())print(uuidv6())$python
>>>fromuuid_v7importuuidv7,uuidv6
>>>print(uuidv7())>>>print(uuidv6())DevelopmentRead theCONTRIBUTING.mdfile.Special Thanks to@oittaaThe author of UUID v7 and v6 implementation in Python.Add UUIDv6 and UUIDv7@rochacbrunofor theproject template
Package: uuid-v9
UUID v9Fast, lightweight, and dependency-free implementation of the UUID version 9 proposal for Python.The v9 UUID supports both time-based sequential and random non-sequential UUIDs with an optional prefix, an optional checksum, and sufficient randomness to avoid collisions. It uses the UNIX timestamp for sequential UUIDs and CRC-8 for checksums. A version digit can be added if desired, but is omitted by default.InstallationInstall UUID v9 from PyPI.python3-mpipinstalluuid-v9Usagefromuuid_v9importuuidv9,is_valid_uuidv9ordered_id=uuidv9()prefixed_ordered_id=uuidv9('a1b2c3d4')# up to 8 hexadecimal charactersunordered_id=uuidv9('',False)prefixed_unordered_id=uuidv9('a1b2c3d4',False)ordered_id_with_checksum=uuidv9('',True,True)ordered_id_with_version=uuidv9('',True,True,True)ordered_id_with_compatibility=uuidv9('',True,False,False,True)constis_valid=validate_uuidv9(ordered_id)# build-in UUID validatorconstis_valid_with_checksum=validate_uuidv9(ordered_id_with_checksum,True)constis_valid_with_version=validate_uuidv9(ordered_id_with_version,True,True)constis_valid_with_compatibility=validate_uuidv9(ordered_id_with_compatibility,True,'1')Command Line Usagepython3uuid_v9.py
python3uuid_v9.py--prefix'a1b2c3d4'# add a prefixpython3uuid_v9.py--unordered# omit the timestamppython3uuid_v9.py--checksum# add a CRC-8 checksumpython3uuid_v9.py--version# add a version 9 digitpython3uuid_v9.py--backcompat# compatibility mode (see below)CompatibilitySome UUID validators check for specific features of v1 or v4 UUIDs. This causes some valid v9 UUIDs to appear invalid. Three possible workarounds are:Use the built-in validator (recommended)Use compatibility mode*Bypass the validator (not recommended)*Compatibility mode adds version and variant digits to immitate v1 or v4 UUIDs based on whether or not you have a timestamp.FormatHere is the UUID v9 format:xxxxxxxx-xxxx-9xxx-8xxx-xxxxxxxxxxyyx = prefix/timestamp/random, y = checksum (optional), 9 = version (optional), 8 = variant (compatibility mode)LicenseThis project is licensed under theMIT License.
Package: uule-grabber
uule_grabberGenerates UULE codes for Google SearchInstallationYou can install the package from PyPI by using pip:$pipinstalluule_grabberUsage>>>importuule_grabber>>>>>>city="Lezigne,Pays de la Loire,France">>>uule_grabber.uule(city)"w+CAIQICIfTGV6aWduZSxQYXlzIGRlIGxhIExvaXJlLEZyYW5jZQ"Latest Geo TargetsYou can directly download the data from Google AdWords API:https://developers.google.com/adwords/api/docs/appendix/geotargetingCreditsPorted to Python based on:Google UULE parameter:https://valentin.app/uule.html
Package: uulm-mensa
#Mensaplan[![GitHubrelease](https://img.shields.io/github/release/qubyte/rubidium.svg)]()[![GitHub license](https://img.shields.io/github/license/mashape/apistatus.svg)]()A python script for viewing the menu of the canteens of the Studierendenwerk Ulm in Ulm. The supported canteens are:- Mensa University- CafeteriaB- Southside Burgerbar- Bistro- Cafeteria West- WestSideDiner- Mensa Hochschule##UsageAfter making the mensaplan.py executable with `chmod +x mensaplan.py` you have the following options:```./mensaplan.py placePrint the todays menu at the place../mensaplan.py place [mon, thu, wed, thur, fri]Print the menu at the place of the given weekday.Supported places are:Mensa University:    mensaBistro:              bistroBurgerbar Southside: burgerbarCafeteriaB:          cafeteriabCafeteria West:      westWest Side Diner:     westsideMensa Hochschule:    hochschule```## CreditsThanks a lot at [Thomas Lukaseder](https://github.com/seder) and his [Mensaplan Parser](https://github.com/seder/mensaplan-parser).## LicenseMIT License
Package: u-umetrics
ExamplefromumetricsimportCorefEvaluatorfromumetricsimportMacroMetricsfromumetricsimportMicroMetricsfromumetricsimportMultiLabelClassMacroF1Metric# macrofromumetricsimportMacroMetricsfromsklearn.metricsimportclassification_report,f1_score,precision_score,recall_scoreimportrandomy_trues=[random.randint(0,10)foriinrange(10000)]y_preds=[random.randint(0,10)foriinrange(10000)]labels=list(set(y_preds)&set(y_trues))p_score=round(precision_score(y_trues,y_preds,labels=labels,zero_division=0,average='macro'),5)r_score=round(recall_score(y_trues,y_preds,labels=labels,zero_division=0,average='macro'),5)f_score=round(f1_score(y_trues,y_preds,labels=labels,zero_division=0,average='macro'),5)y_trues_chunk=[y_trues[i:i+3]foriinrange(0,len(y_trues),3)]y_preds_chunk=[y_preds[i:i+3]foriinrange(0,len(y_preds),3)]m=MacroMetrics(labels=labels)fory_true_chunk,y_pred_chunkinzip(y_trues_chunk,y_preds_chunk):m.step(y_trues=y_true_chunk,y_preds=y_pred_chunk)assertp_score==round(m.precision_score(),5)assertr_score==round(m.recall_score(),5)assertf_score==round(m.f1_score(),5)The Package MissionCompared with sklearn already provides good and mature functions, For example:precision_scorerecall_scoref1_scoreclassification_reportWhy write such a project?For example in forecasting:fromsklearn.metricsimportprecision_scorey_true=[]y_pred=[]precision_score(y_true=y_true,y_pred=y_pred)Assuming that the amount of data iny_trueory_predis very large, then just storing these data will already consume a lot of memory, let alone calculations.此包存在的目的相比sklearn已经提供好的并且很成熟的函数，例如:precision_scorerecall_scoref1_scoreclassification_report为什么还要写这么一个项目？例如在预测:fromsklearn.metricsimportprecision_scorey_true=[]y_pred=[]precision_score(y_true=y_true,y_pred=y_pred)假设y_true或者y_pred的数据量非常大的时候，那么光是存这些数据就已经要消耗大量内存，更别提计算了。发布pythonsetup.pybdist_wheel
Package: uunet
This is the Python version of themultinetlibrary for the analysis of multilayer networks, first released for the R framework in January 2017 on CRAN.multinetis developed by the Uppsala University Information Laboratory (UU InfoLab -https://uuinfolab.github.io)Tutorial:https://github.com/uuinfolab/py_multinet/tree/master/tutorialSource:https://github.com/uuinfolab/py_multinetR version:https://github.com/uuinfolab/r_multinetC++ library:https://github.com/uuinfolab/uunetBug reports:https://github.com/uuinfolab/py_multinet/issuesA simple exampleFind the degree of an actor on two layers:>>> import uunet.multinet as ml
>>> m = ml.data("aucs")
>>> ml.degree(m, actors = ['U54'], layers = ['leisure', 'facebook'])
[18]InstallInstall the latest version of uunet:$ python -m pip install uunetNotes:Python >= 3.8 is requiredThe package is not compatible with condaCreditsThis library was originally based on the book: Multilayer Social Networks, by Dickison, Magnani & Rossi, Cambridge University Press (2016). The methods contained in the library and described in the book have been developed by many different authors: extensive references are available in the book, and in the documentation of each function we indicate the main reference we have followed for the implementation. For some methods developed after the book was published we give references to the corresponding literature.The package uses functions from eclathttps://borgelt.net/eclat.html, for association rule mining, Infomaphttps://www.mapequation.org, for the Infomap community detection method, and Howard Hinnant's date and time libraryhttps://github.com/HowardHinnant/date. The code from these libraries has been included in our source package, and may not be the latest version released by the authors.LicenseReleased under the GNU General Public Licence.Contact: Matteo Magnani <matteo.magnani@it.uu.se>