Breadth-First Search (BFS) Maintain a queue of vertices to explore ... Breadth-First Search. explore( Vertex v ) forall u Neighbors( v ) if (u.color() == white) ...
A way to represent relations between pairs of objects ... Two graphs, G1 and G2, are considered isomorphic ... Isomorphic graphs: Example. Isomorphic graphs: ...