Home › Code › largest_connected_components

largest_connected_components

Syntologyentry name in harvested coderead from the graph 2026-09-24

largest_connected_components appears in the code Syntology harvested for 11 papers, as 8 distinct code bodies found in 11 places (a place is one code body under one paper). At least one of them ran in 2 of the papers; 0 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named largest_connected_components do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 2 of the 8 distinct code bodies named largest_connected_components; 6 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
0ran · our draft was wrong
0ran · fixture could not drive it
2ran
6unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 2 of the 11 places are pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page.

Papers

11 papers shown of 11, newest first; 11 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Deceptive Fairness Attacks on Graphs via Meta Learning 24 Oct 2023 jiank2/fate/src/baseline_attack.py bd1ae6a71dec779d ran no licence file found · pointer only
SAILOR: Structural Augmentation Based Tail Node Representation Learning 13 Aug 2023 jie-re/sailor/dataset.py fa55782ae86522c2 ran no licence file found · pointer only
Graph topology inference benchmarks for machine learning 16 Jul 2020 cadurosar/benchmark_graphinference/generate_graph.py a9c1bf34eaa3d811 unverified MIT (permissive)
Graph Random Neural Network for Semi-Supervised Learning on Graphs 22 May 2020 junzhuang-code/lindt/src/baselines/nettack/utils.py f18b6a502c85b70f unverified MIT (permissive)
Scalable Attack on Graph Data by Injecting Vicious Nodes 22 Apr 2020 wangjh-github/AFGSM/utils.py 11c8a4ad13f75fe4 unverified Apache-2.0 (permissive)
Adaptive Propagation Graph Convolutional Network 24 Feb 2020 spindro/AP-GCN/sparsegraph.py f696fb0f5b7895f8 unverified MIT (permissive)
Graph Universal Adversarial Attacks: A Few Bad Actors Ruin Graph Learning Models 12 Feb 2020 chisam0217/Graph-Universal-Attack/GUA/utils.py 11c8a4ad13f75fe4 unverified MIT (permissive)
Fisher-Bures Adversary Graph Convolutional Networks 11 Mar 2019 stellargraph/FisherGCN/gcn/data_io.py 88a77fd6e7ad9f83 unverified MIT (permissive)
Adversarial Attacks on Graph Neural Networks via Meta Learning 22 Feb 2019 danielzuegner/gnn-meta-attack/metattack/utils.py 11c8a4ad13f75fe4 unverified MIT (permissive)
Adversarial Attacks on Neural Networks for Graph Data 21 May 2018 danielzuegner/nettack/nettack/utils.py f18b6a502c85b70f unverified MIT (permissive)
NetGAN: Generating Graphs via Random Walks 2 Mar 2018 danielzuegner/netgan/netgan/utils.py 134a930a34a58173 unverified MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections