Animation of the combinatorial traverse of a graph. The process of browsing all possible subgraphs of a graph is a NP hard problem. The Combinatorial Subgraph Search (CSS) code solves this problem. Numerically it is prohibitive to go systematically through all possible combinations of vertices in a graph checking if they constitute a subgraph. Instead the CSS generates only combinations of vertices that are subgaphs. There could be quadrillions of such combinations, which is a lot, but for the first time it is possible to do such search.