Research Network Cut Map
loading graph engine

Trace the cut before you call it self-defeating.

A hypothetical collaboration graph makes the network mechanism inspectable. Declare nodes, edges, and a blocked partner, then compare what stays connected. No current policy or legal conclusion is inferred.

Network inputs

All institutions and restrictions are synthetic unless you supply your own sanitized data.

Each line is an undirected edge.

SAMPLE READY

Before and after

Load the sample and run the graph cut.

Baseline routes

Every declared edge remains.

Restricted routes

Removed edges are coral; disconnected nodes remain visible.

Removed direct edges

This list separates direct edge loss from full network fragmentation. Alternate routes can preserve a component.

How to interpret it

Components and reachable pairs are graph facts about the inputs you supplied. They are not a forecast of research output, a legal determination, or evidence that a quoted policy is current.

Source boundary

The source contains a commentary and a quoted claim, not a verified regulation or complete network. This tool intentionally uses synthetic names and makes the restriction explicit.

Super generates helpful tools and automates fact-checking across the internet proactively. If you enjoyed this tool, build your own with Super and share it with a friend.