susannadiv Goto Github PK

activitypub

amz_model_tuning

Basic React.JS dashboard template for model tuning.

asl2

bash-shell-posix-implementation

client-server-tcp-udp-ping

decision-tree

C++ Decision Tree Implementation - Terminal Interface

eth_mlh

full-featured-facerecognition

Full Featured Image Recognition Web app – JavaScript, SQL • Front-end: React.Js, basic HTML and CSS. • Back-end: used Node.Js and Express.Js to write server-side JavaScript – this project uses the Clarifai Face Recognition API. • PostgreSQL is used for the database handling of the user’s authentication information.

gnusocial-network

GNU social's landing page in Hugo. With i18n and News section. This encompasses the GNU social Proof of Concept for GSoC 2020.

gnusocial-pleroma-fe

Pleroma FE-like client webapp in React - GSoC 2020 Susanna Di Vita's final evaluation project for GNU social.

gnusocial.network

GNU social landing page | GSoC Proof of Competence, chosen as official landing page of the GNU social project by community vote.

graphql-local-storage

graphqlcart-apollo

The compose function and the graphql function from react-apollo is used to handle multiple mutations of the local state. This is a side project complementary to Fully_Functional_ECommerce_Site_React (not yet uploaded).

javaconcurrency-semaphore

matrix-multiplication-in-ellpack-format

mlh2023

nmr

Local version

nmr-to-structure

Prediction molecular structure from NMR spectra

plots2

a collaborative knowledge-exchange platform in Rails; we welcome first-time contributors! :balloon:

shoppingportal

simil-apache-server-http-1.0-1.1

susannadiv

Config files for my GitHub profile.

susannadiv.github.io-old

suschat-python-chat-with-file-sending

CLI Python Chat program with user registration in MySQL and ability to transfer any files between 2 users

undirected-weighted-graph---adjacency-list-implementation-in-c-

This project is a simulator for a satellite navigator, that could be used by a salesman to plan trips between the cities in which he trades. Among the many functions that the navigator must offer the user is also to search for and suggest a route that, from any city of departure, leads to another city of arrival. Normally the path to look for would be that of minimum length, but for simplicity we limit ourselves to any path as long as it is acyclic, that is to say that a same location is visited at most once. The navigator is able to load, from files or standard input, the maps of the regions in which the user moves. The following actions can be carried out at the choice of the user: 1. Creation of the graph by acquiring information on vertices and arcs from standard input, expressed in the following format: origin1 destination1 dist1 origin2 destination2 dist2 .... originN destinationN distN 0 2. Creation of the graph acquiring from file the information on the vertices and on the arcs (the format is the same as for the acquisition from standard input) 3. Textual display of the graph, which shows the list of vertices with the respective labels and, for each vertex, the relative adjacency list with string weights. 4. Insertion of a new vertex in the graph, whose label is provided by input. 5. Insertion of a new arc in the graph, assuming that the labels of its vertices are supplied as input. 6. Determination of the number of vertices. 7. Determination of the number of arcs. 8. Determination of the degree of a vertex, whose label is provided by input. 9. Verificance adjacency between two vertices, whose labels are provided as input. 10. Display of the adjacency list associated with a vertex, whose label is provided as an input. 11. Search for an acyclic path between origin and destination and display on standard output of the path found, in vertex: source format1 vertex2 .... vertexN destination - and overall length.