tmk::drc::ItemGraph Struct Reference

KiCad 10's item graph (pcbnew/connectivity, CN_VISITOR): items of any nets are linked when their copper touches on a common layer, except two items that cannot change net (pads, zone fills, free vias) on different nets. More...

#include <drc/connectivity.hpp>

Public Attributes
std::vector< std::vector< int > >	adj
	neighbours of each copper item, ascending (empty for items outside the graph)

Detailed Description

KiCad 10's item graph (pcbnew/connectivity, CN_VISITOR): items of any nets are linked when their copper touches on a common layer, except two items that cannot change net (pads, zone fills, free vias) on different nets.

Tracks, arcs, vias and board copper graphics can change net. Footprint graphics and copper text are not part of it. Pads of one net keep the stricter pad-to-pad rule of compute_connectivity (centre inside the other pad, or one footprint's overlapping pads). Zone fills are left out of adj: testing every item against every large fill polygon is slow, and only a few questions need them, so those ask zones_touching.

Definition at line 51 of file connectivity.hpp.

Member Data Documentation

adj

std::vector<std::vector<int> > tmk::drc::ItemGraph::adj

neighbours of each copper item, ascending (empty for items outside the graph)

Definition at line 52 of file connectivity.hpp.

---

The documentation for this struct was generated from the following file:

• drc/connectivity.hpp