Public
Edited
Aug 30, 2023
5 forks
Importers
31 stars
DruidJS workerNatural breaksWord Tour: 40k words and their friendsHead/tail breaksHello, kmeans-engineHello, jsgeoda!n-dimensions binning?Ternary binningGeometric MedianUMAP SleepwalkDisc TransportSelf-Organizing Maps meet DelaunayHello, AutoencoderCumulative binningPlateau detectionSpherical smallest-circle problemFrida Kahlo’s paletteMean shift clustering with flatbushMean shift clusteringMean shift clustering with kd-treeManhattan Voronoi IIH3 odditiesProtein MatrixUMAP-o-MaticUMAP in A-FrameUMAP of temperatures in Minneapolis/Saint-PaulUMAP Simple TopologiesUMAP & a personalized distance functiont-SNE VoronoiTravelling salesperson approximation with t-SNEtsne.js & workertsne.jsHello tfjs-tsneTravelling salesperson approximation on the globe, with UMAP-jsUMAP-js, worker versionHello UMAP (via Algorithmia)MNIST & UMAP-jsHello UMAP-js
Hello, Reorder.js
current = setup.update(permutations[sorting]())
// note: here the graph expect source and target to be 0-based and correspond to existing nodes.
graph = FileAttachment("miserables.json").json()
permutations = orders(graph, {distance})
orders = ({ nodes, links }, { distance = "manhattan" }) => {
const n = nodes.length;
const graph = reorder.graph().nodes(nodes).links(links).init();
let dist_adjacency;
const leafOrder = reorder
.optimal_leaf_order()
.distance(reorder.distance[distance]);
function computeLeaforder() {
const adjacency = reorder.graph2mat(graph);
return leafOrder(adjacency);
}
function computeLeaforderDist() {
if (!dist_adjacency) dist_adjacency = reorder.graph2valuemats(graph);
return reorder.valuemats_reorder(dist_adjacency, leafOrder);
}
function computeBarycenter() {
const barycenter = reorder.barycenter_order(graph),
improved = reorder.adjacent_exchange(
graph,
barycenter[0],
barycenter[1]
)[0];
const b = new Map(improved.map((lo, i) => [i, lo]));
return d3.range(improved.length).map((i) => b.get(i));
}
function computeRCM() {
return reorder.reverse_cuthill_mckee_order(graph);
}
function computeSpectral() {
return reorder.spectral_order(graph);
}
const orders = {
none: () => d3.range(n),
name: () =>
d3.range(n).sort((a, b) => d3.ascending(nodes[a].name, nodes[b].name)),
count: () => d3.range(n).sort((a, b) => nodes[b].count - nodes[a].count),
group: () =>
d3
.range(n)
.sort(
(a, b) =>
d3.ascending(nodes[a].group, nodes[b].group) ||
d3.ascending(nodes[a].name, nodes[b].name)
),
leafOrder: computeLeaforder,
leafOrderDist: computeLeaforderDist,
barycenter: computeBarycenter,
rcm: computeRCM,
spectral: computeSpectral
};
return orders;
}
orderingsOptions = [
"none",
"name",
"count",
"group",
"leafOrder",
"leafOrderDist",
"barycenter",
"rcm",
"spectral"
]
distanceOptions = ({
euclidean: "Euclidean (L2)",
manhattan: "Manhattan (L1)",
minkowski: "Minkowski",
chebyshev: "Chebyshev",
hamming: "Hamming",
jaccard: "Jaccard",
braycurtis: "Braycurtis"
})
reorder = require("reorder.js@2.2.6")
One platform to build and deploy the best data apps
Experiment and prototype by building visualizations in live JavaScript notebooks. Collaborate with your team and decide which concepts to build out.
Use Observable Framework to build data apps locally. Use data loaders to build in any language or library, including Python, SQL, and R.
Seamlessly deploy to Observable. Test before you ship, use automatic deploy-on-commit, and ensure your projects are always up-to-date.