minimum and maximum path

[ema897]

Hi!
I have an oriented graph made with

  class myClass{
  public:
  myClass* left(){return a;}
  myClass* right(){return b;}
  protected:
  private:
     myClass* a;
     myClass* b;
}

I made a graph with this class and now i have to find min and max path.
I wanted to use BFS to find min path, but I don't understand how to do it with c++ or if there are implemented algorithm in library

[kbw]

You could search ...
https://coldfunction.com/mgen/p/3i
or more generally:
https://www.bing.com/search?q=graph+MIN+PATH+bfs+&pc=MOZI&form=MOZTSB

If you're still stuck, let us know.

[ema897]

Sorry, but I don't understand how to adapt the code to mine