/////////////////////////////////////////////////////////// // SimplestGraph.cpp #include #include #include "simplestgraph.h" //#ifdef TEST_SIMPLESTGRAPH void main() { vertex vtx("Hi there",3); std::cout << "\n vertex value: " << vtx.value(); std::cout << "\n vertex id: " << vtx.id(); vtx.value() = "Why hello there!"; std::cout << "\n vertex value: " << vtx.value(); vertex::edge ed(vtx,"goodbye",11); std::cout << "\n edge value: " << ed.value(); std::cout << "\n edge id: " << ed.id(); std::cout << "\n myVertex id: " << ed.vert().id(); vertex vtx2("v2",2); vertex::edge ed2(vtx2,"goodbye",12); vtx.addEdge(ed); vtx.addEdge(ed2); std::cout << "\n vtx edges are:"; for(size_t i=0; i > gr; gr.addVertex(*new vertex("v1",1)); gr.addVertex(*new vertex("v2",2)); gr.addVertex(*new vertex("v3",3)); gr.addVertex(*new vertex("v3",4)); typedef vertex::edge vEdge; if(gr.size() > 3) { gr[0].addEdge(vEdge(gr[1],"e1",1)); // constructing edge in addEdge call gr[1].addEdge(vEdge(gr[2],"e2",2)); gr[2].addEdge(vEdge(gr[1],"e3",1)); gr[1].addEdge(vEdge(gr[3],"e4",3)); } for(size_t i=0; i >::iterator iter; iter = gr.findVertexWithValue("v3"); std::string value = (*iter)->value(); std::cout << "\n member finder found vertex value = " << value << '\n'; graph< std::string, std::string, Verbose >::PtrsToVerts ptrsToVerts; ptrsToVerts = gr.findVerticesWithValue("v2"); std::cout << "\n member collection finder found " << ptrsToVerts.size() << " vertices with value " << "v2"; std::cout << "\n"; ptrsToVerts = findVerticesWithValue(gr,"v3"); std::cout << "\n global collection finder found " << ptrsToVerts.size() << " vertices with value " << "v3"; std::cout << "\n\n"; } //#endif