IndexArrayPtr PGL::determine_faces_from_edges(const Point2ArrayPtr& points, const std::vector<std::pair<uint32_t, uint32_t> >& edges)
{
typedef Wm5::PlanarGraph<Vector2> Graph;
Graph graph;
int i = 0;
for (Point2Array::const_iterator it = points->begin(); it != points->end(); ++it)
graph.InsertVertex(*it,i++);
for (std::vector<std::pair<uint32_t, uint32_t> >::const_iterator itedge = edges.begin(); itedge != edges.end(); ++itedge)
graph.InsertEdge(itedge->first,itedge->second);
std::vector<Graph::Primitive*> mPrimitives;
graph.ExtractPrimitives(mPrimitives);
IndexArrayPtr result(new IndexArray());
for (std::vector<Graph::Primitive*>::const_iterator itPrim = mPrimitives.begin(); itPrim != mPrimitives.end(); ++itPrim){
if ((*itPrim)->Type == Graph::PT_MINIMAL_CYCLE){
Index lresult;
for (std::vector<std::pair<Vector2,int> >::const_iterator itSequence = (*itPrim)->Sequence.begin(); itSequence != (*itPrim)->Sequence.end(); ++itSequence)
lresult.push_back(itSequence->second);
result->push_back(lresult);
}
}
return result;
}
int main()
{
_CrtSetDbgFlag(_CRTDBG_ALLOC_MEM_DF | _CRTDBG_LEAK_CHECK_DF);
Graph<string, string> g;
g.InsertVertex("Anchorage");
g.InsertVertex("Eagle River");
g.InsertVertex("Old Glenn - AK HWY 1 - AK HWY 3 JCT");
g.InsertVertex("Wasilla");
g.InsertVertex("Palmer");
g.InsertVertex("Talkeetna");
g.InsertVertex("Fairbanks");
g.InsertEdge("Anchorage", "Eagle River", "Old Glenn Hwy", 16);
g.InsertEdge("Eagle River", "Old Glenn - AK HWY 1 - AK HWY 3 JCT", "Old Glenn", 19);
g.InsertEdge("Old Glenn - AK HWY 1 - AK HWY 3 JCT", "Palmer", "HWY 1", 6);
g.InsertEdge("Old Glenn - AK HWY 1 - AK HWY 3 JCT", "Wasilla", "HWY 3", 8);
g.InsertEdge("Wasilla", "Talkeetna", "HWY 3", 70);
g.InsertEdge("Talkeetna", "Fairbanks", "HWY 3", 300);
/*try
{
g.InsertEdge("Anchorage", "Eagle River", "Old Glenn Hwy", 16);
}
catch (Exception e)
{
cout << e << endl;
}*/
/*Graph<string, string> copy(g);
Graph<string, string> equal;
equal = g;*/
cout << "Depth:" << endl;
g.DepthFirst(&Print);
cout << "\nBreadth:" << endl;
g.BreadthFirst(&Print);
g.DeleteVertex("Fairbanks");
try {
cout << "Invalid Delete" << endl;
g.DeleteVertex("Fairbanks");
}
catch (Exception e) {
cout << e << endl;
}
cout << "\nBreadth after Delete Vertex Fairbanks:" << endl;
g.BreadthFirst(&Print);
g.DeleteEdge("Old Glenn - AK HWY 1 - AK HWY 3 JCT", "Wasilla", "HWY 3", 8);
cout << "\nDepth after Delete Edge:" << endl;
g.DepthFirst(&Print);
return 0;
}
int main()
{
Graph head;
std::cout << &head << std::endl;
std::cout << head.InsertVertex('a')->GetName() << std::endl;
std::cout << head.InsertVertex('b')->GetName() << std::endl;
std::cout << head.InsertVertex('c')->GetName() << std::endl;
std::cout << head.InsertVertex('d')->GetName() << std::endl;
std::cout << head.GetFirstVertex()->GetName() << std::endl;
std::cout << head.InsertEdge('a', 'b')->GetName() << std::endl;
std::cout << head.InsertEdge('a', 'c')->GetName() << std::endl;
std::cout << head.InsertEdge('a', 'd')->GetName() << std::endl;
std::cout << head.InsertEdge('b', 'a')->GetName() << std::endl;
std::cout << head.DeleteEdge('b', 'a') << std::endl;
std::cout << head.DeleteEdge('a', 'b') << std::endl;
std::cout << head.DeleteEdge('a', 'c') << std::endl;
std::cout << head.DeleteEdge('a', 'd') << std::endl;
std::cout << head.DeleteVertex('b') << std::endl;
std::cout << head.DeleteVertex('c') << std::endl;
std::cout << head.DeleteVertex('d') << std::endl;
return 0;
}
int main()
{
Test b;
b.Run();
Graph<char, int> a;
a.InsertNode('A');
a.InsertNode('B');
a.InsertNode('C');
a.InsertNode('D');
a.InsertNode('E');
a.InsertEdge('A','B',4,1);
a.InsertEdge('A','C',3,1);
a.InsertEdge('B','C',1,1);
a.InsertEdge('D','A',6,1);
a.InsertEdge('B','A',4,1);
a.InsertEdge('C','E',10,1);
a.InsertEdge('E','D',2,1);
a.Print();
Dijkstra(a,'A','E');
return 0;
}
int main(int argc, char** argv)
{
Graph graph;
graph.InsertEdge("A", "B");
graph.InsertEdge("A", "C");
graph.InsertEdge("B", "D");
graph.Print();
Search search;
search.Initialize(graph);
search.Bfs(graph, "A");
for (unordered_map<string, string>::iterator item = search.parents_.begin();
item != search.parents_.end(); ++item)
cout << item->first << ":" << item->second << endl;
search.Initialize(graph);
search.Dfs(graph, "A");
for (unordered_map<string, string>::iterator item = search.parents_.begin();
item != search.parents_.end(); ++item)
cout << item->first << ":" << item->second << endl;
return 0;
}
/**********************************************************************
* Purpose: Reads file and inserts info into Graph graph
* Primes all the data. If success, return true.
* Entry: string file, Graph<string, string> & graph
* Exit: returns true if successful.
************************************************************************/
bool ReadFile(const string & file, Graph<string, string> & graph)
{
ifstream map(file.c_str());
bool valid = false;
if (map.is_open())
{
valid = true;
while (!map.eof())
{
string orig, dest, hwy;
int weight = 0;
getline(map, orig, ',');
getline(map, dest, ',');
getline(map, hwy, ',');
map >> weight;
map.get(); // for end line
try
{
graph.InsertVertex(orig);
}
catch (Exception e)
{
//cout << e << endl;
}
try
{
graph.InsertVertex(dest);
}
catch (Exception e)
{
//cout << e << endl;
}
graph.InsertEdge(orig, dest, hwy, weight);
}
map.close();
}
void InsertEdges(Graph<string, string>& g)
{
try {
g.InsertEdge("Anchorage", "Eagle River", "Old Glenn Hwy", 16);
g.InsertEdge("Eagle River", "Old Glenn - AK HWY 1 - AK HWY 3 JCT", "Old Glenn", 19);
g.InsertEdge("Old Glenn - AK HWY 1 - AK HWY 3 JCT", "Palmer", "HWY 1", 6);
g.InsertEdge("Old Glenn - AK HWY 1 - AK HWY 3 JCT", "Wasilla", "HWY 3", 8);
g.InsertEdge("Wasilla", "Talkeetna", "HWY 3", 70);
g.InsertEdge("Talkeetna", "Fairbanks", "HWY 3", 300);
}
catch (Exception e)
{
cout << e;
}
}
void Load(Graph& mGraph, vector<Graph::Primitive*>& mPrimitives)
{
// std::string path = Environment::GetPathR("tri.txt");
//std::ifstream inFile(path.c_str());
ifstream inFile("./PlanarGraph.txt");
//ofstream verify;
//verify.open("verify.txt",ios::out|ios::app);
int numVertices;
inFile >> numVertices;
//verify<< numVertices<<"\n";
int i;
for (i = 0; i < numVertices; ++i)
{
double x, y;
inFile >> x;
inFile >> y;
// verify<< x <<"\t"<< y <<"\n";
//y = GetHeight() - 1 - y;
mGraph.InsertVertex(Vec2(x, y), i);
}
int numEdges;
inFile >> numEdges;
//verify<< numEdges<<"\n";
for (i = 0; i < numEdges; ++i)
{
int v0, v1;
inFile >> v0;
inFile >> v1;
// verify<< v0 <<"\t"<< v1 <<"\n";
mGraph.InsertEdge(v0, v1);
}
#ifdef EXTRACT_PRIMITIVES
mGraph.ExtractPrimitives(mPrimitives);
#endif
}
