A linked list is a linear data structure where each element is a separate object. Each element (we will call it a node) of a list is comprising of two items - the data and a reference to the next node. The last node has a reference to null. The entry point into a linked list is called the head of the list. It should be noted that head is not a separate node, but the reference to the first node. If the list is empty then the head is a null reference.
Linked Open Vocabularies (LOV)
Your entry point to high quality and reusable Vocabularies to describe Linked Data.
LinkML – Bring structure to your data.
An open framework that simplifies authoring, validating, and sharing data — providing an accessible platform for interdisciplinary collaboration and a reliable way to define and share data semantics.
Beginner's Guide to Linkers
A typical example of what triggers this explanation is when I help someone who has a link error like:
Peerlist | The Professional Network for builders to show and tell!
Peerlist is a professional network where you can showcase your proof of work, and get hired by the best companies.
Connected Places - Links Collections
Collection (abstract data type)
In computer programming, a collection is an abstract data type that is a grouping of items that can be used in a polymorphic way.
Kernel (linear algebra)
In mathematics, the kernel of a linear map, also known as the null space or nullspace, is the part of the domain which is mapped to the zero vector of the co-domain; the kernel is always a linear subspace of the domain. That is, given a linear map L : V → W between two vector spaces V and W, the kernel of L is the vector space of all elements v of V such that L(v) = 0, where 0 denotes the zero vector in W, or more symbolically:
Linked Data is a Political Agenda
Categorical Data Structures for Technical Computing
Many mathematical objects can be represented as functors from finitely-presented categories $\mathsf{C}$ to $\mathsf{Set}$. For instance, graphs are functors to $\mathsf{Set}$ from the category with two parallel arrows. Such functors are known informally as $\mathsf{C}$-sets. In this paper, we describe and implement an extension of $\mathsf{C}$-sets having data attributes with fixed types, such as graphs with labeled vertices or real-valued edge weights. We call such structures "acsets," short for "attributed $\mathsf{C}$-sets." Derived from previous work on algebraic databases, acsets are a joint generalization of graphs and data frames. They also encompass more elaborate graph-like objects such as wiring diagrams and Petri nets with rate constants. We develop the mathematical theory of acsets and then describe a generic implementation in the Julia programming language, which uses advanced language features to achieve performance comparable with specialized data structures.
brianpetro/obsidian-smart-connections
Find related notes and excerpts while writing. Your link building copilot displays relevant content in graph + list view. A local embedding model powers semantic search. Zero setup. No API key.
i made linkring.lol. it's a place to put your links in lists, because they sure weren't going to organize themselves in my 47 open tabs. on the atmosphere, with stickers.
working on this today 😎. we chose veryyyyy different formats for storing information semble & margin make sense the direction they've chosen. you can organize links into multiple buckets, where on linkring there is a single link<>list relationship. should show up at the very least soon tho!
