haskell-igraph-0.8.0: igraph/include/infomap_Node.h
/* -*- mode: C -*- */
/* vim:set ts=4 sw=4 sts=4 et: */
/*
IGraph library.
Copyright (C) 2011-2012 Gabor Csardi <csardi.gabor@gmail.com>
334 Harvard street, Cambridge, MA 02139 USA
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA
*/
#ifndef NODE_H
#define NODE_H
#include <vector>
#include <utility>
#include "igraph_interface.h"
class Node;
using namespace std;
class Node {
public:
Node();
Node(int modulenr, double tpweight);
vector<int> members;
vector< pair<int, double> > inLinks;
vector< pair<int, double> > outLinks;
double selfLink;
double teleportWeight;
double danglingSize;
double exit;
double size;
};
void cpyNode(Node *newNode, Node *oldNode);
#endif