ui: graph showing neighbours

The graph view can now display the n1 neighbours of the active node, including connections between neighbours.

src/lib/component/controller/GraphController.cpp

@@ -22,6 +22,8 @@ void GraphController::handleMessage(MessageActivateToken* message)
 	if (view != NULL)
 	{
 		std::string name = m_graphAccess->getNameForNodeWithId(message->tokenId);
+		std::vector<std::pair<Id, Id> > rawEdges = m_graphAccess->getConnectedEdges(message->tokenId);
+		std::vector<Id> neighbourIds = m_graphAccess->getIdsOfNeighbours(message->tokenId);
 
 		DummyNode node(name, message->tokenId, Vec2i(0,0));
 
@@ -30,6 +32,48 @@ void GraphController::handleMessage(MessageActivateToken* message)
 
 		std::vector<DummyEdge> edges;
 
+		int offset = 20; // temporary
+
+		for(unsigned int i = 0; i < rawEdges.size(); i++)
+		{
+			edges.push_back(DummyEdge(rawEdges[i].first, rawEdges[i].second));
+
+			Id newId = 0;
+
+			if (rawEdges[i].first != message->tokenId)
+			{
+				name = m_graphAccess->getNameForNodeWithId(rawEdges[i].first);
+				newId = rawEdges[i].first;
+			}
+			else
+			{
+				name = m_graphAccess->getNameForNodeWithId(rawEdges[i].second);
+				newId = rawEdges[i].second;
+			}
+
+			nodes.push_back(DummyNode(name, newId, Vec2i(0, offset)));
+			offset += 20;
+		}
+
+		// find edges between neighbour nodes
+		for(unsigned int i = 1; i < nodes.size(); i++)
+		{
+			std::vector<std::pair<Id, Id>> newEdges = m_graphAccess->getConnectedEdges(nodes[i].tokenId);
+			for(unsigned int j = 0; j < newEdges.size(); j++)
+			{
+				if (std::find(neighbourIds.begin(), neighbourIds.end(), newEdges[j].first) != neighbourIds.end() &&
+					std::find(neighbourIds.begin(), neighbourIds.end(), newEdges[j].second) != neighbourIds.end())
+				{
+					DummyEdge newEdge(newEdges[j].first, newEdges[j].second);
+
+					if (std::find(edges.begin(), edges.end(), newEdge) == edges.end())
+					{
+						edges.push_back(newEdge);
+					}
+				}
+			}
+		}
+
 		view->rebuildGraph(nodes, edges);
 	}
 }