Can Someone Please explain this Last line? I need to eventually determine if two vertexes are connected.
include <boost/fusion/adapted/std_pair.hpp>
include <boost/spirit/include/qi.hpp>
include <boost/graph/edge_list.hpp>
include <fstream>
typedef std::pair<int,int> Edge;
typedef std::vector<Edge> EdgeList;
typedef boost::edge_list<EdgeList::iterator> Graph;
namespace qi = boost::spirit::qi;
int main()
{
std::ifstream ifs("Graph.txt");
ifs >> std::noskipws;
//std::cout << ifs;
boost::spirit::istream_iterator f(ifs), l;
std::vector<Edge> edges;
bool parse_ok = qi::phrase_parse(f, l, (qi::int_ >> qi::int_) % qi::eol, qi::blank, edges);
Can some please explain this last line?:
bool parse_ok = qi::phrase_parse(f, l, (qi::int_ >> qi::int_) % qi::eol, qi::blank, edges);