InfoVis 2013
1.0
Information Visualisation project - "Mapping Text with Phrase Nets"
|
#include <GraphNode.h>
Public Member Functions | |
GraphNode (const std::string &word) | |
~GraphNode () | |
void | addSubsequentNode (GraphNode *node) |
void | addPreviousNode (GraphNode *node) |
void | incrementOccuranceCount () |
const CountedGraphNodeMapType & | getPreviousNodes () const |
const CountedGraphNodeMapType & | getSubsequentNodes () const |
const std::string & | getWord () const |
int | getOccuranceCount () const |
int | getPreviousNodeConnectionsCount () const |
int | getSubsequentNodeConnectionsCount () const |
int | getHighestOutgoingCount () const |
int | getHighestIncomingCount () const |
void | setEdgeWeight (float weight) |
float | getEdgeWeight () const |
void | setOccuranceWeight (float weight) |
float | getOccuranceWeight () const |
GraphNode is the class in which all the node-related data is saved including everything that is used to calculate how to display it
GraphNode::GraphNode | ( | const std::string & | word) |
GraphNode::~GraphNode | ( | ) |
void GraphNode::addPreviousNode | ( | GraphNode * | node) |
void GraphNode::addSubsequentNode | ( | GraphNode * | node) |
float GraphNode::getEdgeWeight | ( | ) | const |
int GraphNode::getHighestIncomingCount | ( | ) | const |
int GraphNode::getHighestOutgoingCount | ( | ) | const |
int GraphNode::getOccuranceCount | ( | ) | const |
float GraphNode::getOccuranceWeight | ( | ) | const |
int GraphNode::getPreviousNodeConnectionsCount | ( | ) | const |
const CountedGraphNodeMapType & GraphNode::getPreviousNodes | ( | ) | const |
int GraphNode::getSubsequentNodeConnectionsCount | ( | ) | const |
const CountedGraphNodeMapType & GraphNode::getSubsequentNodes | ( | ) | const |
const std::string & GraphNode::getWord | ( | ) | const |
void GraphNode::incrementOccuranceCount | ( | ) |
void GraphNode::setEdgeWeight | ( | float | weight) |
void GraphNode::setOccuranceWeight | ( | float | weight) |