here to learn
MathJaxPolygon inputMultiple SankeysDrag to re-arrange (vertical edition)Dijkstra's algorithm (huge version)d3 quadtrees with more dataHexagonal World (coloring by country)DLA + CA rules!Fullscreen CanvasD3 ScatterplotD3 Log-Scaled HistogramTOCNotebook Visualizer (Firefox-compatible)Lazy DownloadDOM.download(callback) feature request [solved]Version Pinning for Notebooks
Dijkstra's algorithm (d3-delaunay version)
function dijkstra(pts) { // The unvisited set
const Q = new Set();
const dist = new Map();
const prev = new Map();
const prevEdge = new Map();
pts.forEach(pt => {
dist.set(pt, Infinity);
prev.set(pt, undefined);
Q.add(pt);
});
dist.set(pts[0], 0);
while (Q.size) {
// Find the node with least distance.
let u, minDistance = Infinity;
for (const candidate of Q) {
if (dist.get(candidate) < minDistance) {
minDistance = dist.get(candidate);
u = candidate;
}
}
// Remove it from the visited queue.
Q.delete(u);
for (const edge of u.edges) {
const v = edge.source === u ? edge.target : edge.source;
const alt = dist.get(u) + edge.distance;
if (alt < dist.get(v)) {
dist.set(v, alt);
prev.set(v, u);
prevEdge.set(v, edge);
}
}
}
return {dist, prev, prevEdge};
}
Purpose-built for displays of data
Observable is your go-to platform for exploring data and creating expressive data visualizations. Use reactive JavaScript notebooks for prototyping and a collaborative canvas for visual data exploration and dashboard creation.
