From a6417c447af8f0ff203ffb8730e53e4a7dfafb23 Mon Sep 17 00:00:00 2001
From: kabirgh <15871468+kabirgh@users.noreply.github.com>
Date: Sat, 24 Feb 2024 02:40:42 +0000
Subject: [PATCH] fix(fast rebuild): handle added an deleted markdown correctly (#921)
---
quartz/depgraph.ts | 41 +++++++++++++++++++++++++++++++++++++++++
1 files changed, 41 insertions(+), 0 deletions(-)
diff --git a/quartz/depgraph.ts b/quartz/depgraph.ts
index 1efad07..3d048cd 100644
--- a/quartz/depgraph.ts
+++ b/quartz/depgraph.ts
@@ -39,12 +39,26 @@
}
}
+ // Remove node and all edges connected to it
removeNode(node: T): void {
if (this._graph.has(node)) {
+ // first remove all edges so other nodes don't have references to this node
+ for (const target of this._graph.get(node)!.outgoing) {
+ this.removeEdge(node, target)
+ }
+ for (const source of this._graph.get(node)!.incoming) {
+ this.removeEdge(source, node)
+ }
this._graph.delete(node)
}
}
+ forEachNode(callback: (node: T) => void): void {
+ for (const node of this._graph.keys()) {
+ callback(node)
+ }
+ }
+
hasEdge(from: T, to: T): boolean {
return Boolean(this._graph.get(from)?.outgoing.has(to))
}
@@ -92,6 +106,15 @@
// DEPENDENCY ALGORITHMS
+ // Add all nodes and edges from other graph to this graph
+ mergeGraph(other: DepGraph<T>): void {
+ other.forEachEdge(([source, target]) => {
+ this.addNode(source)
+ this.addNode(target)
+ this.addEdge(source, target)
+ })
+ }
+
// For the node provided:
// If node does not exist, add it
// If an incoming edge was added in other, it is added in this graph
@@ -112,6 +135,24 @@
})
}
+ // Remove all nodes that do not have any incoming or outgoing edges
+ // A node may be orphaned if the only node pointing to it was removed
+ removeOrphanNodes(): Set<T> {
+ let orphanNodes = new Set<T>()
+
+ this.forEachNode((node) => {
+ if (this.inDegree(node) === 0 && this.outDegree(node) === 0) {
+ orphanNodes.add(node)
+ }
+ })
+
+ orphanNodes.forEach((node) => {
+ this.removeNode(node)
+ })
+
+ return orphanNodes
+ }
+
// Get all leaf nodes (i.e. destination paths) reachable from the node provided
// Eg. if the graph is A -> B -> C
// D ---^
--
Gitblit v1.10.0