okstra 0.114.0 → 0.116.0

package/runtime/templates/reports/final-report.template.md

@@ -43,6 +43,19 @@ implementation-option: {{ frontmatter.implementationOption | yaml_scalar }}
 {{ t("sectionIntro.clarificationCarryIn") }}
 
 - Source file: `{{ clarificationCarryIn.sourceFile }}`
+{% if implementationPlanning and implementationPlanning.incrementalDecision %}
+{% set incrementalDecision = implementationPlanning.incrementalDecision %}
+### 0.1 Incremental Re-Verification Scope
+
+- Decision mode: `{{ incrementalDecision.mode }}`
+- Reason: {{ incrementalDecision.reason }}
+{% if incrementalDecision.mode == 'incremental' %}
+- Re-verified stages: {% for s in incrementalDecision.reverifyStages %}`stage-{{ s }}`{% if not loop.last %}, {% endif %}{% else %}(none){% endfor +%}
+- Carried-forward stages: {% for s in incrementalDecision.carryStages %}`stage-{{ s }}` carried-forward (unchanged){% if not loop.last %}, {% endif %}{% else %}(none){% endfor +%}
+
+Carried-forward plan items retain their prior verdicts verbatim; each such item carries a `carriedForwardFromSeq` tag pointing at the run it was verified in.
+{% endif %}
+{% endif %}
 
 {% endif %}
 ## Summary of the Problem or Verification Target
@@ -67,6 +80,20 @@ implementation-option: {{ frontmatter.implementationOption | yaml_scalar }}
 | Approval Required? | `{% if verdictCard.approvalRequired %}yes — {{ t("verdictCard.approvalRequiredSuffix") }}{% else %}no{% endif %}` |
 | Next Step | {{ verdictCard.nextStep | mdcell }} |
 
+{% if readerSummary %}
+## {{ t("readerSummary.heading") }}
+
+{{ t("sectionIntro.readerSummary") }}
+
+| {{ t("readerSummary.tableHeaderItem") }} | {{ t("readerSummary.tableHeaderValue") }} |
+|------|----|
+| {{ t("readerSummary.decisionLabel") }} | {{ readerSummary.decision | mdcell }} |
+| {{ t("readerSummary.humanActionRequiredLabel") }} | {{ readerSummary.humanActionRequired | mdcell }} |
+| {{ t("readerSummary.blockingItemsLabel") }} | {{ readerSummary.blockingItems | mdcell }} |
+| {{ t("readerSummary.safeToSkipLabel") }} | {{ readerSummary.safeToSkip | mdcell }} |
+| {{ t("readerSummary.recommendedCommandLabel") }} | `{{ readerSummary.recommendedCommand | mdcell }}` |
+
+{% endif %}
 ## {{ t("rationale.heading") }}
 
 {{ t("rationale.intro") }}

package/runtime/templates/reports/i18n/en.json

@@ -44,13 +44,14 @@
   },
   "sectionIntro": {
     "verdictCard": "At-a-glance verdict card — a summary that mirrors the values in `## 7. Final Verdict` and `## 3. Recommended Next Steps`.",
-    "clarificationCarryIn": "Unresolved `Clarification Items` from the prior report, re-examined against new evidence and carried in with updated status.",
-    "ticketCoverage": "Summary of the core problems, requirements, and verification targets this run covered.",
-    "executionStatus": "At-a-glance table of each worker's status, assigned model, and key findings.",
-    "sourceItemsRule": "The `Source items` column shows which worker items each consensus row was synthesised from, as `<worker>:<item-id>` pairs.",
-    "planBodyVerification": "Per-item cross-verification of each plan-body item (option, stage, step, dependency, validation, rollback, requirement coverage) for whether it is executable as written and internally consistent. Whether each option actually *solves* the problem (requirement satisfaction) is judged separately under Requirement Coverage, not here.",
-    "clarificationItems": "Items that need your answer or supporting material before the next step."
-  },
+      "clarificationCarryIn": "Unresolved `Clarification Items` from the prior report, re-examined against new evidence and carried in with updated status.",
+      "ticketCoverage": "Summary of the core problems, requirements, and verification targets this run covered.",
+      "executionStatus": "At-a-glance table of each worker's status, assigned model, and key findings.",
+      "sourceItemsRule": "The `Source items` column shows which worker items each consensus row was synthesised from, as `<worker>:<item-id>` pairs.",
+      "planBodyVerification": "Per-item cross-verification of each plan-body item (option, stage, step, dependency, validation, rollback, requirement coverage) for whether it is executable as written and internally consistent. Whether each option actually *solves* the problem (requirement satisfaction) is judged separately under Requirement Coverage, not here.",
+      "clarificationItems": "Items that need your answer or supporting material before the next step.",
+      "readerSummary": "The shortest reader path: what was decided, what a human must do next, and which audit details can wait until a deeper review."
+    },
   "tokenSummary": {
     "heading": "Token Usage Summary",
     "tableHeaderItem": "Item",
@@ -62,11 +63,21 @@
   "verdictCard": {
     "tableHeaderLabel": "Item",
     "tableHeaderValue": "Value",
-    "approvalRequiredSuffix": "frontmatter `approved` must be `true` to enter `implementation`",
-    "rationaleLabel": "Rationale summary",
-    "nextStepLabel": "Next step"
-  },
-  "rationale": {
+      "approvalRequiredSuffix": "frontmatter `approved` must be `true` to enter `implementation`",
+      "rationaleLabel": "Rationale summary",
+      "nextStepLabel": "Next step"
+    },
+    "readerSummary": {
+      "heading": "Reader Summary",
+      "tableHeaderItem": "Item",
+      "tableHeaderValue": "Value",
+      "decisionLabel": "Decision",
+      "humanActionRequiredLabel": "Human action required",
+      "blockingItemsLabel": "Blocking items",
+      "safeToSkipLabel": "Safe to skip on first read",
+      "recommendedCommandLabel": "Recommended command"
+    },
+    "rationale": {
     "heading": "Background and Rationale",
     "intro": "Why this work, what it changes, and why the chosen approach is sound — written so a reviewer can follow it. Each item cites its evidence (path:line, report ID, etc.).",
     "motivationLabel": "Why this work",

package/runtime/templates/reports/i18n/ko.json

@@ -44,13 +44,14 @@
   },
   "sectionIntro": {
     "verdictCard": "한눈에 보는 결과 카드 — `## 7. Final Verdict` 와 `## 3. Recommended Next Steps` 의 값을 그대로 옮긴 요약입니다.",
-    "clarificationCarryIn": "이전 보고서의 미해결 `Clarification Items` 를 새 증거로 재검토해 해소·갱신한 뒤 이어받은 항목입니다.",
-    "ticketCoverage": "이 run 이 다룬 핵심 문제·요구사항·검증 대상 요약입니다.",
-    "executionStatus": "각 worker 의 상태·배정 모델·핵심 finding 을 한눈에 보는 표입니다.",
-    "sourceItemsRule": "`Source items` 열은 이 합의 항목이 어느 워커의 어느 항목에서 합성됐는지를 `<worker>:<item-id>` 형식으로 표기합니다.",
-    "planBodyVerification": "계획 본문의 각 항목(옵션·스테이지·스텝·의존성·검증·롤백·요구사항 커버리지)이 적힌 대로 실행 가능하고 서로 모순이 없는지 워커들이 항목별로 교차 검증한 결과입니다. 각 옵션이 '문제를 실제로 푸는지'(요구사항 충족)는 여기가 아니라 Requirement Coverage 에서 별도로 판정합니다.",
-    "clarificationItems": "다음 진행 전에 사용자의 답변이나 자료 첨부가 필요한 항목입니다."
-  },
+      "clarificationCarryIn": "이전 보고서의 미해결 `Clarification Items` 를 새 증거로 재검토해 해소·갱신한 뒤 이어받은 항목입니다.",
+      "ticketCoverage": "이 run 이 다룬 핵심 문제·요구사항·검증 대상 요약입니다.",
+      "executionStatus": "각 worker 의 상태·배정 모델·핵심 finding 을 한눈에 보는 표입니다.",
+      "sourceItemsRule": "`Source items` 열은 이 합의 항목이 어느 워커의 어느 항목에서 합성됐는지를 `<worker>:<item-id>` 형식으로 표기합니다.",
+      "planBodyVerification": "계획 본문의 각 항목(옵션·스테이지·스텝·의존성·검증·롤백·요구사항 커버리지)이 적힌 대로 실행 가능하고 서로 모순이 없는지 워커들이 항목별로 교차 검증한 결과입니다. 각 옵션이 '문제를 실제로 푸는지'(요구사항 충족)는 여기가 아니라 Requirement Coverage 에서 별도로 판정합니다.",
+      "clarificationItems": "다음 진행 전에 사용자의 답변이나 자료 첨부가 필요한 항목입니다.",
+      "readerSummary": "가장 짧은 읽기 경로입니다. 무엇이 결정됐는지, 사람이 다음에 무엇을 해야 하는지, 어떤 감사 세부사항은 나중에 봐도 되는지 먼저 보여줍니다."
+    },
   "tokenSummary": {
     "heading": "토큰 사용량 요약",
     "tableHeaderItem": "항목",
@@ -62,11 +63,21 @@
   "verdictCard": {
     "tableHeaderLabel": "항목",
     "tableHeaderValue": "값",
-    "approvalRequiredSuffix": "frontmatter `approved` 가 `true` 여야 `implementation` 진입 가능",
-    "rationaleLabel": "근거 요약",
-    "nextStepLabel": "다음 단계"
-  },
-  "rationale": {
+      "approvalRequiredSuffix": "frontmatter `approved` 가 `true` 여야 `implementation` 진입 가능",
+      "rationaleLabel": "근거 요약",
+      "nextStepLabel": "다음 단계"
+    },
+    "readerSummary": {
+      "heading": "Reader Summary",
+      "tableHeaderItem": "항목",
+      "tableHeaderValue": "값",
+      "decisionLabel": "Decision",
+      "humanActionRequiredLabel": "Human action required",
+      "blockingItemsLabel": "Blocking items",
+      "safeToSkipLabel": "Safe to skip on first read",
+      "recommendedCommandLabel": "Recommended command"
+    },
+    "rationale": {
     "heading": "작업 배경과 근거",
     "intro": "이 작업을 왜·무엇을·왜 그렇게 하는지 검토자가 따라갈 수 있도록 정리한다. 각 항목은 근거(파일:줄, 보고서 ID 등)를 인용한다.",
     "motivationLabel": "왜 이 작업을 하는가",

package/runtime/templates/reports/report.css

@@ -73,6 +73,61 @@ nav.toc li.toc-h3 { padding-left: 1.2em; font-size: 0.92em; }
 nav.toc a { color: inherit; text-decoration: none; }
 nav.toc a:hover { text-decoration: underline; }
 
+.reader-dashboard {
+  margin: 0 0 1.5rem;
+  padding: 0.9rem 1rem;
+  border: 1px solid color-mix(in srgb, Highlight 45%, transparent);
+  border-radius: 6px;
+  background: color-mix(in srgb, Highlight 8%, Canvas);
+}
+.reader-dashboard-head {
+  display: flex;
+  align-items: center;
+  justify-content: space-between;
+  gap: 1rem;
+  margin-bottom: 0.8rem;
+}
+.reader-dashboard h2 {
+  margin: 0;
+  border-bottom: none;
+  padding-bottom: 0;
+}
+.reader-mode-controls {
+  display: flex;
+  flex-wrap: wrap;
+  gap: 0.35rem;
+}
+.reader-mode-controls button[aria-pressed="true"] {
+  background: Highlight;
+  color: HighlightText;
+  border-color: Highlight;
+}
+.reader-summary-grid {
+  display: grid;
+  grid-template-columns: minmax(12ch, 0.28fr) 1fr;
+  gap: 0.45rem 0.9rem;
+  margin: 0;
+}
+.reader-summary-grid dt {
+  font-weight: 600;
+  color: color-mix(in srgb, CanvasText 72%, transparent);
+}
+.reader-summary-grid dd { margin: 0; }
+
+html[data-reader-mode="action"] main > [data-reader-section="audit"],
+html[data-reader-mode="action"] main > [data-reader-section="detail"] {
+  display: none;
+}
+html[data-reader-mode="audit"] main > [data-reader-section="detail"] {
+  display: none;
+}
+
+@media (max-width: 70ch) {
+  .reader-dashboard-head { align-items: flex-start; flex-direction: column; }
+  .reader-summary-grid { grid-template-columns: 1fr; }
+  .reader-summary-grid dt { margin-top: 0.45rem; }
+}
+
 h1, h2, h3, h4, h5, h6 { line-height: 1.25; margin-top: 1.6em; margin-bottom: 0.4em; }
 h1 { font-size: 1.7rem; }
 h2 { font-size: 1.35rem; border-bottom: 1px solid GrayText; padding-bottom: 0.2em; }

package/runtime/templates/reports/report.js

@@ -230,6 +230,50 @@
     showDismiss(false);
   }
 
+  function readerSectionKind(text) {
+    if (/Reader Summary|Verdict Card|Clarification Items|Recommended Next Steps|Follow-up Tasks/.test(text)) {
+      return "action";
+    }
+    if (/Evidence|Cross Verification|Execution Status|Token Usage|Plan Body Verification|Round History/.test(text)) {
+      return "audit";
+    }
+    return "detail";
+  }
+
+  function markReaderSections() {
+    var main = document.querySelector("main");
+    if (!main) return;
+    var current = "action";
+    var nodes = main.children;
+    for (var i = 0; i < nodes.length; i++) {
+      var node = nodes[i];
+      if (node.classList && node.classList.contains("reader-dashboard")) {
+        node.setAttribute("data-reader-section", "action");
+        current = "action";
+        continue;
+      }
+      if (/^H[12]$/.test(node.tagName || "")) {
+        current = readerSectionKind(node.textContent || "");
+      }
+      node.setAttribute("data-reader-section", current);
+    }
+  }
+
+  function setReaderMode(mode) {
+    if (mode !== "action" && mode !== "audit" && mode !== "full") {
+      mode = "action";
+    }
+    document.documentElement.setAttribute("data-reader-mode", mode);
+    var buttons = document.querySelectorAll('button[data-action="set-reader-mode"]');
+    for (var i = 0; i < buttons.length; i++) {
+      var btn = buttons[i];
+      btn.setAttribute(
+        "aria-pressed",
+        btn.getAttribute("data-reader-mode") === mode ? "true" : "false"
+      );
+    }
+  }
+
   function bind() {
     var clickables = document.querySelectorAll("button[data-action]");
     for (var i = 0; i < clickables.length; i++) {
@@ -241,8 +285,15 @@
         btn.addEventListener("click", copyUserResponse);
       } else if (action === "dismiss-user-response") {
         btn.addEventListener("click", dismissUserResponse);
+      } else if (action === "set-reader-mode") {
+        btn.addEventListener("click", function (event) {
+          setReaderMode(event.currentTarget.getAttribute("data-reader-mode"));
+        });
       }
-
+    }
+    markReaderSections();
+    if (document.querySelector('button[data-action="set-reader-mode"]')) {
+      setReaderMode("action");
     }
     bindOtherInputToggle();
   }
@@ -259,6 +310,7 @@
       collectEntries: collectEntries,
       collectApproval: collectApproval,
       exportUserResponse: exportUserResponse,
+      setReaderMode: setReaderMode,
     };
   }
 

package/runtime/validators/validate-run.py

@@ -744,6 +744,14 @@ _EMPTY_CARRY_IN_SOURCE_RE = re.compile(
     re.MULTILINE,
 )
 
+# Section 0 incremental audit sub-block. When the data.json records an
+# `implementationPlanning.incrementalDecision` with `mode == "incremental"`,
+# the rendered report MUST expose the decision so a reader can audit which
+# stages were re-verified vs carried forward unchanged.
+_INCREMENTAL_AUDIT_HEADING_RE = re.compile(
+    r"^###[ \t]+0\.1[ \t]+Incremental Re-Verification Scope\b", re.MULTILINE
+)
+
 # Deprecated section headings removed by the report-format readability
 # pass. Each entry is (regex, human-readable remedy). The regexes are
 # line-anchored to avoid false positives from inline references in prose
@@ -971,6 +979,44 @@ def _validate_conformance(report_path: Path, failures: list[str],
             )
 
 
+def _check_incremental_audit_block(
+    report_path: Path, content: str, failures: list[str]
+) -> None:
+    """Enforce the Section 0 incremental audit block.
+
+    When the data.json records an `implementationPlanning.incrementalDecision`
+    with `mode == "incremental"`, the rendered markdown MUST carry the
+    `### 0.1 Incremental Re-Verification Scope` block naming the re-verified
+    and carried-forward stages — otherwise the narrowed re-run is silently
+    un-auditable. Non-incremental (`full`) runs and reports without the
+    decision are exempt, so this never conflicts with the empty-Section-0
+    stub rule (that fires only when NO carry-in was provided at all).
+    """
+    data = _load_final_report_data(report_path)
+    planning = data.get("implementationPlanning")
+    if not isinstance(planning, dict):
+        return
+    decision = planning.get("incrementalDecision")
+    if not isinstance(decision, dict) or decision.get("mode") != "incremental":
+        return
+    if _INCREMENTAL_AUDIT_HEADING_RE.search(content) is None:
+        failures.append(
+            "final report data.json records an `incremental`-mode "
+            "implementationPlanning.incrementalDecision, but the markdown is "
+            "missing the `### 0.1 Incremental Re-Verification Scope` audit "
+            "block under Section 0. Re-render from the data.json so the "
+            "re-verified / carried-forward stages are visible."
+        )
+        return
+    for needle in ("Re-verified stages", "Carried-forward stages"):
+        if needle not in content:
+            failures.append(
+                f"final report's Section 0 incremental audit block is missing "
+                f"the `{needle}` line — an `incremental`-mode run must list "
+                "both the re-verified and the carried-forward stages."
+            )
+
+
 def validate_report(
     report_path: Path,
     required_agent_status_entries: list[str],
@@ -1064,6 +1110,10 @@ def validate_report(
             "and body — do NOT emit a placeholder stub."
         )
 
+    # Incremental audit block — an `incremental`-mode re-run must expose its
+    # scope decision in Section 0 so the narrowed re-verification is auditable.
+    _check_incremental_audit_block(report_path, content, failures)
+
     # Deprecated section headings — pre-1.0 hard removal.
     for pattern, remedy in _DEPRECATED_FINAL_REPORT_PATTERNS:
         if pattern.search(content) is not None:

package/src/cli-registry.mjs

@@ -305,6 +305,20 @@ export const COMMAND_REGISTRY = [
     category: "introspection",
     summary: ["Append run error events to the run error log"],
   },
+  {
+    name: "incremental-scope",
+    module: "./commands/execute/incremental-scope.mjs",
+    export: "run",
+    category: "introspection",
+    summary: ["Decide re-verify vs carry-forward scope for a clarification re-run"],
+  },
+  {
+    name: "incremental-carry",
+    module: "./commands/execute/incremental-carry.mjs",
+    export: "run",
+    category: "introspection",
+    summary: ["Merge carried-forward plan-item verdicts into an incremental re-run"],
+  },
   {
     name: "memory",
     module: "./commands/memory/memory.mjs",

package/src/commands/execute/incremental-carry.mjs

@@ -0,0 +1,20 @@
+import { runInstalledScript } from "../../lib/python-helper.mjs";
+
+const USAGE = `okstra incremental-carry — merge carried-forward plan-item verdicts into an incremental re-run's data.json
+
+Wraps the python helper (\`okstra-incremental-carry.py\`) installed under
+\`~/.okstra/bin/\` so the report-writer worker calls \`okstra incremental-carry\`
+instead of emitting a \`python3 "$HOME/..."\` invocation (which breaks
+\`Bash(okstra:*)\` permission matching and prompts on every call).
+
+Usage:
+  okstra incremental-carry --prev-data <path> --cur-data <path> \\
+    --prev-seq <str> [--carry-stages <csv>] --out <path>
+
+Writes the merged data.json to --out. Exits non-zero on schema drift
+(\`CarryError\`) so the caller's shell can fall back to a full re-run.
+`;
+
+export async function run(args) {
+  return runInstalledScript({ scriptName: "okstra-incremental-carry.py", args, usage: USAGE });
+}

package/src/commands/execute/incremental-scope.mjs

@@ -0,0 +1,20 @@
+import { runInstalledScript } from "../../lib/python-helper.mjs";
+
+const USAGE = `okstra incremental-scope — decide the re-verify vs carry-forward scope for a clarification re-run
+
+Wraps the python helper (\`okstra-incremental-scope.py\`) installed under
+\`~/.okstra/bin/\` so the lead prompt calls \`okstra incremental-scope\`
+instead of emitting a \`python3 "$HOME/..."\` invocation (which breaks
+\`Bash(okstra:*)\` permission matching and prompts on every call).
+
+Usage:
+  okstra incremental-scope --prev-data <path> --cur-base-sha <sha> \\
+    --prev-base-sha <sha> [--impacted <csv>] [--option <name>]
+
+Prints a JSON decision {mode, reverify_stages, carry_stages, reason} to stdout.
+All arguments are forwarded verbatim to the python helper.
+`;
+
+export async function run(args) {
+  return runInstalledScript({ scriptName: "okstra-incremental-scope.py", args, usage: USAGE });
+}

package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_approx_clust_coeff.py

@@ -1,41 +0,0 @@
-import networkx as nx
-from networkx.algorithms.approximation import average_clustering
-
-# This approximation has to be exact in regular graphs
-# with no triangles or with all possible triangles.
-
-
-def test_petersen():
-    # Actual coefficient is 0
-    G = nx.petersen_graph()
-    assert average_clustering(G, trials=len(G) // 2) == nx.average_clustering(G)
-
-
-def test_petersen_seed():
-    # Actual coefficient is 0
-    G = nx.petersen_graph()
-    assert average_clustering(G, trials=len(G) // 2, seed=1) == nx.average_clustering(G)
-
-
-def test_tetrahedral():
-    # Actual coefficient is 1
-    G = nx.tetrahedral_graph()
-    assert average_clustering(G, trials=len(G) // 2) == nx.average_clustering(G)
-
-
-def test_dodecahedral():
-    # Actual coefficient is 0
-    G = nx.dodecahedral_graph()
-    assert average_clustering(G, trials=len(G) // 2) == nx.average_clustering(G)
-
-
-def test_empty():
-    G = nx.empty_graph(5)
-    assert average_clustering(G, trials=len(G) // 2) == 0
-
-
-def test_complete():
-    G = nx.complete_graph(5)
-    assert average_clustering(G, trials=len(G) // 2) == 1
-    G = nx.complete_graph(7)
-    assert average_clustering(G, trials=len(G) // 2) == 1

package/runtime/python/okstra_vendor/networkx/algorithms/approximation/tests/test_clique.py

@@ -1,112 +0,0 @@
-"""Unit tests for the :mod:`networkx.algorithms.approximation.clique` module."""
-
-import networkx as nx
-from networkx.algorithms.approximation import (
-    clique_removal,
-    large_clique_size,
-    max_clique,
-    maximum_independent_set,
-)
-
-
-def is_independent_set(G, nodes):
-    """Returns True if and only if `nodes` is a clique in `G`.
-
-    `G` is a NetworkX graph. `nodes` is an iterable of nodes in
-    `G`.
-
-    """
-    return G.subgraph(nodes).number_of_edges() == 0
-
-
-def is_clique(G, nodes):
-    """Returns True if and only if `nodes` is an independent set
-    in `G`.
-
-    `G` is an undirected simple graph. `nodes` is an iterable of
-    nodes in `G`.
-
-    """
-    H = G.subgraph(nodes)
-    n = len(H)
-    return H.number_of_edges() == n * (n - 1) // 2
-
-
-class TestCliqueRemoval:
-    """Unit tests for the
-    :func:`~networkx.algorithms.approximation.clique_removal` function.
-
-    """
-
-    def test_trivial_graph(self):
-        G = nx.trivial_graph()
-        independent_set, cliques = clique_removal(G)
-        assert is_independent_set(G, independent_set)
-        assert all(is_clique(G, clique) for clique in cliques)
-        # In fact, we should only have 1-cliques, that is, singleton nodes.
-        assert all(len(clique) == 1 for clique in cliques)
-
-    def test_complete_graph(self):
-        G = nx.complete_graph(10)
-        independent_set, cliques = clique_removal(G)
-        assert is_independent_set(G, independent_set)
-        assert all(is_clique(G, clique) for clique in cliques)
-
-    def test_barbell_graph(self):
-        G = nx.barbell_graph(10, 5)
-        independent_set, cliques = clique_removal(G)
-        assert is_independent_set(G, independent_set)
-        assert all(is_clique(G, clique) for clique in cliques)
-
-
-class TestMaxClique:
-    """Unit tests for the :func:`networkx.algorithms.approximation.max_clique`
-    function.
-
-    """
-
-    def test_null_graph(self):
-        G = nx.null_graph()
-        assert len(max_clique(G)) == 0
-
-    def test_complete_graph(self):
-        graph = nx.complete_graph(30)
-        # this should return the entire graph
-        mc = max_clique(graph)
-        assert 30 == len(mc)
-
-    def test_maximal_by_cardinality(self):
-        """Tests that the maximal clique is computed according to maximum
-        cardinality of the sets.
-
-        For more information, see pull request #1531.
-
-        """
-        G = nx.complete_graph(5)
-        G.add_edge(4, 5)
-        clique = max_clique(G)
-        assert len(clique) > 1
-
-        G = nx.lollipop_graph(30, 2)
-        clique = max_clique(G)
-        assert len(clique) > 2
-
-
-def test_large_clique_size():
-    G = nx.complete_graph(9)
-    nx.add_cycle(G, [9, 10, 11])
-    G.add_edge(8, 9)
-    G.add_edge(1, 12)
-    G.add_node(13)
-
-    assert large_clique_size(G) == 9
-    G.remove_node(5)
-    assert large_clique_size(G) == 8
-    G.remove_edge(2, 3)
-    assert large_clique_size(G) == 7
-
-
-def test_independent_set():
-    # smoke test
-    G = nx.Graph()
-    assert len(maximum_independent_set(G)) == 0