|
InfoVis 2013
1.0
Information Visualisation project - "Mapping Text with Phrase Nets"
|
#include <NodeGraphManager.h>
Public Member Functions | |
| NodeGraphManager (Application *application) | |
| ~NodeGraphManager () | |
| void | createNewNodeGraphStructure () |
| void | retrieveMostFrequentNodeConnections (GraphNodeList &graphNodeList) |
| void | addHighestNeighbourEdgeWeights (GraphNodeList &graphNodeList) |
| void | createGraphWindows (GraphNodeList &mostFrequentGraphNodes, GraphNodeSet &graphNodeSet, UIManager *uiManager) |
| void | positionGraphNodes (GraphNodeList &graphNodes, const GraphNodeSet &graphNodeSet, const GraphNodeListEntryMap &graphNodeListEntryMap) |
| void | positionRelatedWindows (const GraphNodeListEntry *curListEntry, const GraphNodeListEntryMap &graphNodeListEntryMap, std::set< CEGUI::Window * > &positionedWindows, const GraphNodeSet &graphNodeSet, std::set< const CEGUI::Window * > &connectedWindows) |
| void | positionSubsequentWindows (const GraphNodeListEntry *curListEntry, const GraphNodeListEntryMap &graphNodeListEntryMap, std::set< CEGUI::Window * > &positionedWindows, const GraphNodeSet &graphNodeSet, float2 windowCenter, std::set< const CEGUI::Window * > &connectedWindows) |
| void | positionPreviousWindows (const GraphNodeListEntry *curListEntry, const GraphNodeListEntryMap &graphNodeListEntryMap, std::set< CEGUI::Window * > &positionedWindows, const GraphNodeSet &graphNodeSet, float2 windowCenter, std::set< const CEGUI::Window * > &connectedWindows) |
| void | findAndSetFreePosition (std::set< CEGUI::Window * > &positionedWindows, CEGUI::Window *currentWindow, std::set< const CEGUI::Window * > &connectedWindows, bool isInitialWindow, float2 startPos=float2(), CEGUI::Window *placeAroundWindow=0) |
| void | createGraphNodeSetFromList (const GraphNodeList &mostFrequentGraphNodes, GraphNodeSet &graphNodeSet) |
| void | setMaxReturnedNodes (int maxReturnedNodes) |
| int | getMaxReturnedNodes () const |
| void | createGraphNodeConnectionPairs (const GraphNodeList &mostFrequentGraphNodes, const GraphNodeListEntryMap &graphNodeListEntryMap, std::set< GraphNodePair > &graphNodePairs) |
| void | fillGraphNodeListEntryMap (const GraphNodeList &graphNodeListEntries, GraphNodeListEntryMap &graphNodeListEntryMap) |
| void | createNodeGraphArrows (const std::set< GraphNodePair > &graphNodePairs, std::vector< Arrow > &arrows) |
| void | setIsUsingStopWords (bool isUsingStopWords) |
| GraphNode * | getGraphNodeByWord (const std::string &word) |
Static Public Member Functions | |
| static void | addNodeConnection (GraphNode *first, GraphNode *second) |
| NodeGraphManager::NodeGraphManager | ( | Application * | application) |
| NodeGraphManager::~NodeGraphManager | ( | ) |
| void NodeGraphManager::addHighestNeighbourEdgeWeights | ( | GraphNodeList & | graphNodeList) |
| void NodeGraphManager::createGraphNodeConnectionPairs | ( | const GraphNodeList & | mostFrequentGraphNodes, |
| const GraphNodeListEntryMap & | graphNodeListEntryMap, | ||
| std::set< GraphNodePair > & | graphNodePairs | ||
| ) |
| void NodeGraphManager::createGraphNodeSetFromList | ( | const GraphNodeList & | mostFrequentGraphNodes, |
| GraphNodeSet & | graphNodeSet | ||
| ) |
| void NodeGraphManager::createGraphWindows | ( | GraphNodeList & | mostFrequentGraphNodes, |
| GraphNodeSet & | graphNodeSet, | ||
| UIManager * | uiManager | ||
| ) |
| void NodeGraphManager::createNewNodeGraphStructure | ( | ) |
| void NodeGraphManager::createNodeGraphArrows | ( | const std::set< GraphNodePair > & | graphNodePairs, |
| std::vector< Arrow > & | arrows | ||
| ) |
| void NodeGraphManager::fillGraphNodeListEntryMap | ( | const GraphNodeList & | graphNodeListEntries, |
| GraphNodeListEntryMap & | graphNodeListEntryMap | ||
| ) |
| void NodeGraphManager::findAndSetFreePosition | ( | std::set< CEGUI::Window * > & | positionedWindows, |
| CEGUI::Window * | currentWindow, | ||
| std::set< const CEGUI::Window * > & | connectedWindows, | ||
| bool | isInitialWindow, | ||
| float2 | startPos = float2(), |
||
| CEGUI::Window * | placeAroundWindow = 0 |
||
| ) |
| GraphNode * NodeGraphManager::getGraphNodeByWord | ( | const std::string & | word) |
| int NodeGraphManager::getMaxReturnedNodes | ( | ) | const |
| void NodeGraphManager::positionGraphNodes | ( | GraphNodeList & | graphNodes, |
| const GraphNodeSet & | graphNodeSet, | ||
| const GraphNodeListEntryMap & | graphNodeListEntryMap | ||
| ) |
| void NodeGraphManager::positionPreviousWindows | ( | const GraphNodeListEntry * | curListEntry, |
| const GraphNodeListEntryMap & | graphNodeListEntryMap, | ||
| std::set< CEGUI::Window * > & | positionedWindows, | ||
| const GraphNodeSet & | graphNodeSet, | ||
| float2 | windowCenter, | ||
| std::set< const CEGUI::Window * > & | connectedWindows | ||
| ) |
| void NodeGraphManager::positionRelatedWindows | ( | const GraphNodeListEntry * | curListEntry, |
| const GraphNodeListEntryMap & | graphNodeListEntryMap, | ||
| std::set< CEGUI::Window * > & | positionedWindows, | ||
| const GraphNodeSet & | graphNodeSet, | ||
| std::set< const CEGUI::Window * > & | connectedWindows | ||
| ) |
| void NodeGraphManager::positionSubsequentWindows | ( | const GraphNodeListEntry * | curListEntry, |
| const GraphNodeListEntryMap & | graphNodeListEntryMap, | ||
| std::set< CEGUI::Window * > & | positionedWindows, | ||
| const GraphNodeSet & | graphNodeSet, | ||
| float2 | windowCenter, | ||
| std::set< const CEGUI::Window * > & | connectedWindows | ||
| ) |
| void NodeGraphManager::retrieveMostFrequentNodeConnections | ( | GraphNodeList & | graphNodeList) |
| void NodeGraphManager::setIsUsingStopWords | ( | bool | isUsingStopWords) |
| void NodeGraphManager::setMaxReturnedNodes | ( | int | maxReturnedNodes) |