关于「先修图与遗忘曲线:课程的骨架」,《诊学漏斗、掌握门控与持牌经济》给出的定量结论是什么?
结论:第二章把 12 个科目写成先修图,关键路径 98 学时,合法学习顺序 543,510 种;指数与幂律两种遗忘律给出几乎相同的间隔复习计划。
数据口径:书中以标注框区分证据、16 段可运行的 Python 程序、原典与假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 12, 543510, 98
order: astro lifa bazi chenggu liuyao meihua
numer qimen fengshui uranian xingming ziwei
critical path (98 h): lifa -> bazi -> qimen -> fengshui
total hours: 204
layer 1: astro lifa numer
layer 2: bazi chenggu liuyao uranian
layer 3: meihua qimen xingming ziwei
layer 4: fengshui
admissible study orders: 543,510 of 12! = 479,001,600
share of all orders : 0.0011
Reading: 12 edges remove all but a small share of the
orders, yet many admissible paths remain; the gate fixes
which subject may come next, not a single syllabus.查看完整验算程序
# Chapter 2. [p03] A 12-subject prerequisite graph: order, path, count.
# Subjects (hours of study): lifa calendar (12), numer numerology (6),
# astro western astrology (14), bazi four pillars (30), liuyao six lines
# (18), ziwei purple star (28), chenggu bone weight (4), meihua plum
# blossom (10), qimen (32), fengshui (24), xingming naming (10), uranian
# (16). An edge a -> b means a must be passed before b starts.
# Computed: a topological order (Kahn, alphabetical tie-break), the
# longest (critical) path in hours, the depth layers, and the exact
# number of admissible study orders (linear extensions) by a DP over
# the 2^12 subsets of passed subjects.
HOURS = {"lifa": 12, "numer": 6, "astro": 14, "bazi": 30, "liuyao": 18,
"ziwei": 28, "chenggu": 4, "meihua": 10, "qimen": 32,
"fengshui": 24, "xingming": 10, "uranian": 16}
EDGES = [("lifa", "bazi"), ("lifa", "ziwei"), ("lifa", "liuyao"),
("lifa", "chenggu"), ("liuyao", "meihua"), ("bazi", "qimen"),
("liuyao", "qimen"), ("qimen", "fengshui"), ("bazi", "ziwei"),
("numer", "xingming"), ("bazi", "xingming"), ("astro", "uranian")]
def topo(names, edges):
indeg = {n: 0 for n in names}
for a, b in edges:
indeg[b] += 1
ready = sorted(n for n in names if indeg[n] == 0)
order = []
while ready:
n = ready.pop(0)
order.append(n)
for a, b in edges:
if a == n:
indeg[b] -= 1
if indeg[b] == 0:
ready.append(b)
ready.sort()
return order
if __name__ == "__main__":
names = sorted(HOURS)
order = topo(names, EDGES)
print(" order: " + " ".join(order[:6]))
print(" " + " ".join(order[6:]))
finish, prev, depth = {}, {}, {}
for n in order:
pre = [a for a, b in EDGES if b == n]
best = max(pre, key=lambda a: finish[a]) if pre else None
finish[n] = HOURS[n] + (finish[best] if best else 0)
prev[n] = best
depth[n] = 1 + max((depth[a] for a in pre), default=0)
end = max(finish, key=finish.get)
path, n = [], end
while n:
path.append(n)
n = prev[n]
print(" critical path ({} h): {}".format(
finish[end], " -> ".join(reversed(path))))
print(" total hours: {}".format(sum(HOURS.values())))
for d in range(1, max(depth.values()) + 1):
print(" layer {}: {}".format(
d, " ".join(n for n in order if depth[n] == d)))
idx = {n: i for i, n in enumerate(names)}
need = [0] * len(names)
for a, b in EDGES:
need[idx[b]] |= 1 << idx[a]
ways = [0] * (1 << len(names))
ways[0] = 1
for m in range(1 << len(names)):
if ways[m]:
for i in range(len(names)):
if not m >> i & 1 and need[i] & m == need[i]:
ways[m | 1 << i] += ways[m]
full = ways[-1]
print(" admissible study orders: {:,d} of 12! = {:,d}".format(
full, 479001600))
print(" share of all orders : {:.4f}".format(full / 479001600))
print("\nReading: 12 edges remove all but a small share of the")
print("orders, yet many admissible paths remain; the gate fixes")
print("which subject may come next, not a single syllabus.")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《诊学一体转化漏斗、掌握度门控课程与持牌人网络经济学》第 2 章「先修图与遗忘曲线:课程的骨架」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090197
DOI: 10.5281/zenodo.24090197 · 阅读本章所在专著 · 5DL-B-074 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026074,
author = {Fan, Yafu},
title = {Diagnostic-to-Pedagogy Conversion Funnels, Mastery-Gated Curriculum Architecture and Certification Network Economics},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090197},
url = {https://doi.org/10.5281/zenodo.24090197}
}