Thinking·OS

Graph explorer

Explore the knowledge graph

Array data structure is a Data structure. Activate to inspect this relation.Stack is a Data structure. Activate to inspect this relation.Tree is a Data structure. Activate to inspect this relation.Graph data structure is a Data structure. Activate to inspect this relation.Linked list is a Data structure. Activate to inspect this relation.Queue is a Data structure. Activate to inspect this relation.Hash table is a Data structure. Activate to inspect this relation.Sorting algorithm applies to Array data structure. Activate to inspect this relation.Vertex is part of Graph data structure. Activate to inspect this relation.Edge is part of Graph data structure. Activate to inspect this relation.Shortest path applies to Graph data structure. Activate to inspect this relation.Connectivity applies to Graph data structure. Activate to inspect this relation.Critical path applies to Graph data structure. Activate to inspect this relation.Edge depends on Vertex. Activate to inspect this relation.Shortest path depends on Edge. Activate to inspect this relation.Shortest path requires Connectivity. Activate to inspect this relation.Connectivity depends on Edge. Activate to inspect this relation.Linked listData structureArray data structureStackTreeGraph data structureQueueHash tableSorting algorithmVertexEdgeShortest pathConnectivityCritical path
Relationship types
Legend
  • Focused concept
  • Connected concept
  • Arrow points from cause / source to effect / target
  • A line with no arrow is a two-way relationship
  • Node colour marks the concept’s primary discipline
14 concepts17 relationships7 disciplines3 relation families

Linked list

Open concept →

At a glance

In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory.

Disciplines
Computer Science · Data Structures
Role in the graph
Leaf concept
Relationships
1 · 1 relation families

Insights from this view

Structural observations about the concepts shown here — descriptions of this graph, not claims about the world.

  • This view connects 7 disciplines: Algorithms, Computer Science, Data Structures, Graph Theory, Management, Mathematics, Project Management.
  • Linked list is a bridge concept — viewed here through Computer Science, Data Structures.
  • The connections here span 3 relation families.
  • Networks explains 2 concepts in this view (Computer Science, Data Structures).

Relationships as a list

The focused concept’s relationships. Pick another concept in the graph above to update this list.

Explore through a different lens

A lens is a deterministic projection of the graph. Pick a discipline, thinking pattern or journey to reframe the whole view.

By discipline

ChemistryBiologyPhysicsMathematicsComputer ScienceGeologyMineralogyEconomics

By thinking pattern

Bayesian updatingCause and effectCompoundingConservationConstraintsDefense in depthDiffusion & spreadEmergenceEnergy transformationEntropy & irreversibilityEquilibriumFeedback loopIncentivesInformationLevels & hierarchyModularityNetworksOptimizationOscillationProbabilityRecursion & self-similarityScaleSignal vs noiseSource–pathway–receptorStocks and flowsSymmetry & invarianceThresholds & tipping pointsTrade-offsTriangulationVariation & selectionWaves

By journey

From a Leaf to the ClimateWhy Music Moves UsHow Machines LearnReasoning about a Leaf and the Climate

Concept collections

Concept collections are curated lenses onto the fabric — themed sets of ideas that recur across disciplines. They are not journeys; they are a way to read the graph.

About this view

What this is

Start from one concept and expand outward. The view never shows everything at once — click a node to refocus, filter by relationship type, or switch to an accessible list.

One fabric

3750 concepts and 5051 typed relations form one connected component — no isolated silo.

How to read it

Focus a concept, or apply a lens (discipline, mental model, journey) to see only the threads that matter.