okstra 0.113.0 → 0.115.0

package/runtime/skills/okstra-inspect/SKILL.md

@@ -1,7 +1,7 @@
 ---
 name: okstra-inspect
 description: >-
-  Use this for everything that happens AFTER a single okstra task has already run — inspecting it or light bookkeeping on it, never launching new work. The tell is usually a named task id (PROD-1623, dev-9184), often dropped without the word "okstra." Reach for it when the user wants one task's: status, current/next phase, blockers, or approval gate; its final report — where it is or whether it passed (결론·통과); its elapsed time (소요 시간) or context/read cost (컨텍스트 비용); its run history, re-run, or resume; to mark it done / in-progress / blocked / todo; or a failed run's error logs gathered into a report (에러 리포트). Also bundles cross-project okstra errors into an anonymized feedback zip (에러 환류). Use it even for a bare "mark it done" or "where's the report." NOT for starting a run (okstra-run), rollups/schedules (okstra-rollup / okstra-schedule), a brief (okstra-brief), setup (okstra-setup), or cross-project management (okstra-manager).
+  Use this for everything that happens AFTER a single okstra task has already run — inspecting it or light bookkeeping on it, never launching new work. The tell is usually a named task id (PROD-1623, dev-9184), often dropped without the word "okstra." Reach for it when the user wants one task's: status, current/next phase, blockers, or approval gate; its final report — where it is or whether it passed (결론·통과); its elapsed time (소요 시간) or context/read cost (컨텍스트 비용); its run history, re-run, or resume; to mark it done / in-progress / blocked / todo; or a failed run's error logs gathered into a report (에러 리포트). Also bundles cross-project okstra errors into an anonymized feedback zip (에러 환류). Use it even for a bare "mark it done" or "where's the report." NOT for starting a run (okstra-run), rollups/schedules (okstra-rollup / okstra-schedule), a brief (okstra-brief-gen), setup (okstra-setup), or cross-project management (okstra-manager).
 ---
 
 # OKSTRA Inspect
@@ -682,7 +682,7 @@ stdout JSON 을 파싱해 보고:
 | 프로젝트 수 | `projectCount` |
 
 - `unreachableRuns > 0` 이면 표면화한다(침묵 누락 금지).
-- 끝에 다음 단계를 안내한다: "이 zip 으로 okstra 자신을 고치려면 `/okstra-brief` 의 error-feedback variant 로 brief 를 만든 뒤 `okstra-run --task-type error-analysis` 를 okstra 레포에서 실행하세요."
+- 끝에 다음 단계를 안내한다: "이 zip 으로 okstra 자신을 고치려면 `/okstra-brief-gen` 의 error-feedback variant 로 brief 를 만든 뒤 `okstra-run --task-type error-analysis` 를 okstra 레포에서 실행하세요."
 
 ---
 

package/runtime/templates/reports/brief.template.md

@@ -7,7 +7,7 @@ source-type: <file | linear | jira | github | notion | url | user-input>
 task-group: <task-group>
 depth: 0                                     # 0=parent/single, 1=child, 2=grandchild, ...
 created: <YYYY-MM-DD>
-generator: okstra-brief
+generator: okstra-brief-gen
 reporter-confirmations: <complete | partial | pending | skipped>  # set by Step 6.5
 # codebase-scan variant frontmatter (omit for reporter-input briefs):
 scope: <reporter-input | codebase>              # 'codebase' for codebase-scan variant; omit for reporter-input variant
@@ -19,7 +19,7 @@ candidate-cap: 8                                 # codebase-scan only: 1..12, de
 
 # Task Brief: <task_group>/<filename-without-ext>
 
-> Generated: okstra-brief · <YYYY-MM-DD>
+> Generated: okstra-brief-gen · <YYYY-MM-DD>
 > Source type: <file | linear | jira | github | notion | url | user-input>
 > Tracker key (if any): <LIN-1234 | PROJ-42 | gh-repo-123 | notion-abcdef12>
 > Parent brief (child briefs only): <relative path>

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

@@ -67,6 +67,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-brief.py

@@ -1,5 +1,5 @@
 #!/usr/bin/env python3
-"""Validate brief markdown files produced by the okstra-brief skill.
+"""Validate brief markdown files produced by the okstra-brief-gen skill.
 
 Checks performed per brief file:
 
@@ -34,7 +34,7 @@ Checks performed per brief file:
     non-empty and Priority Lenses lists 1–4 values from the lens whitelist
     (`scripts/okstra_ctl/improvement_lenses.py` SSOT).
 12. When present, `Related Task Graph` is a markdown table with the canonical
-    columns and relation/direction values from the okstra-brief contract.
+    columns and relation/direction values from the okstra-brief-gen contract.
 13. The requirement/objective section `## Desired Outcome` (required in every
     brief variant) exists and its body is not blank. `_(none)_` stays valid.
 
@@ -406,7 +406,7 @@ def check_requirement_section(text: str, errors: list[str]) -> None:
     """The requirement/objective section must exist and carry a non-blank body.
 
     `## Desired Outcome` is the "shape of success" required by every brief
-    variant (okstra-brief SKILL.md Step 5 §"Required sections by variant").
+    variant (okstra-brief-gen SKILL.md Step 5 §"Required sections by variant").
     Without this check a brief that drops the heading — or wipes its body —
     still passes, letting implementation-planning report 100% Requirement
     Coverage against an empty objective. `_(none)_` stays valid: it is the
@@ -464,9 +464,9 @@ def validate_brief(path: Path, briefs_root: Path) -> list[str]:
     if fm.get("type") != "brief":
         errors.append(f"frontmatter type must be 'brief', got {fm.get('type')!r}")
 
-    if fm.get("generator") != "okstra-brief":
+    if fm.get("generator") != "okstra-brief-gen":
         errors.append(
-            f"frontmatter generator must be 'okstra-brief', got {fm.get('generator')!r}"
+            f"frontmatter generator must be 'okstra-brief-gen', got {fm.get('generator')!r}"
         )
 
     if fm.get("reporter-confirmations") not in REPORTER_CONFIRMATION_VALUES:

package/runtime/validators/validate-brief.sh

@@ -1,6 +1,6 @@
 #!/usr/bin/env bash
 #
-# Validate brief markdown files produced by okstra-brief.
+# Validate brief markdown files produced by okstra-brief-gen.
 #
 # Usage:
 #   validators/validate-brief.sh <briefs-dir> [--briefs-root <dir>]

package/src/commands/lifecycle/uninstall.mjs

@@ -10,13 +10,14 @@ import {
 const FALLBACK_SKILL_NAMES = [
   "okstra",
   "okstra-setup",
-  "okstra-brief",
+  "okstra-brief-gen",
   "okstra-run",
   "okstra-memory",
   "okstra-inspect",
   "okstra-schedule",
   "okstra-container-build",
   "okstra-container",
+  "okstra-brief",
   "okstra-context-loader",
   "okstra-team-contract",
   "okstra-convergence",

package/src/lib/skill-catalog.mjs

@@ -6,7 +6,7 @@
 
 export const USER_SKILL_NAMES = Object.freeze([
   "okstra-setup",
-  "okstra-brief",
+  "okstra-brief-gen",
   "okstra-run",
   "okstra-manager",
   "okstra-memory",
@@ -29,6 +29,7 @@ export const OBSOLETE_SKILL_NAMES = Object.freeze([
   "okstra-report-writer",
   "okstra-coding-preflight",
   "okstra-container",
+  "okstra-brief",
 ]);
 
 export function userSkillNames() {

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