How do Figma vector networks differ from traditional vector paths?

WHAT THIS TESTS: This question probes whether you understand the data model beneath the UI. Traditional vector tools treat a path as an ordered linked list of segments. Figma treats it as an undirected graph. The interviewer wants to hear you articulate the structural difference and translate it into a concrete designer workflow advantage.

A GOOD ANSWER COVERS: First, define the structural contrast. In Illustrator or SVG, a path is a sequence: each node has at most two neighbors, one forward and one backward. In Figma's vector network, a node is a vertex in a graph and can have any number of incident edges. Second, explain the editing consequence. Because edges are independent entities that reference shared vertices, you can have three or more lines originate from the exact same point without creating separate path objects. Third, give the scenario. A complex icon like a lightning bolt or circuit diagram has a central hub with multiple branches. In a traditional tool you would draw separate paths and snap their endpoints to the same coordinate; moving the hub later means selecting and nudging multiple endpoints. In Figma you select the single shared node and drag it, and every connected branch updates because they all reference the same vertex ID. Fourth, mention serialization nuance. Figma must flatten this graph into SVG path elements for export, which involves duplicating vertices at branch points because SVG does not natively support the network model.

COMMON WRONG ANSWERS: Calling vector networks a marketing term for standard Bezier curves. Describing the feature as merely grouping multiple paths together. Claiming that traditional pen tools already allow this through anchor-point manipulation, which confuses adding points along a single sequence with true branching topology. Saying it is about performance or rendering speed rather than data structure.

LIKELY FOLLOW-UPS: How would you export a vector network to SVG given that SVG uses paths? How do fill rules behave when multiple closed loops share an edge? What happens to stroke caps when more than two edges meet at a node? How would you implement boolean operations on a graph-based vector model instead of a path-based one?

ONE CONCRETE EXAMPLE: Imagine designing a settings cog icon where eight spokes radiate from a central ring. In a traditional vector tool each spoke is an independent path whose inner endpoint is merely co-located with the ring. If you later decide to thicken the ring and need to reposition the attachment point, you must select eight separate endpoints. In Figma you draw the ring and spokes as one vector network. The attachment point is a single node with eight incident edges. Dragging that node repositions every spoke simultaneously. If an interviewer asks for a scenario, this is the gold-standard answer because it highlights shared-vertex semantics, non-destructive editing, and the limitation of traditional linear paths in a single visual.