Also known as cut edge, cut arc, isthmus, graph bridge
edge of a graph whose deletion increases the graph's number of connected components; equivalently, an edge not contained in any cycle
via Wikidata · CC0
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).