I am working on a university task in C++. I need to write a function that determines whether a given graph is bipartite or not. The graph can be either directed or undirected, and the weights of the edges can be any value. I am struggling with the implementation for directed graphs and would appreciate any tips.

I have successfully implemented the function for undirected graphs using the two-coloring method, but I haven’t managed to find a solution for directed graphs.