/usr/include/tulip/GraphMeasure.h is in libtulip-dev 3.1.2-2.3ubuntu3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 | //-*-c++-*-
/**
Authors: David Auber, Patrick Mary, Morgan Mathiaut
from the LaBRI Visualization Team
Email : auber@tulip-software.org
Last modification : 13/03/2009
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.
*/
#ifndef _TLPGRAPHMEASEURE_H
#define _TLPGRAPHMEASEURE_H
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include "tulip/Node.h"
#include "tulip/MutableContainer.h"
#include "tulip/PluginProgress.h"
#include "tulip/DoubleProperty.h"
namespace tlp {
class Graph;
TLP_SCOPE bool averagePathLength(Graph *, double&, PluginProgress * = 0);
TLP_SCOPE bool averageCluster(Graph *, double &, PluginProgress * = 0);
TLP_SCOPE bool computeClusterMetric(Graph *graph, DoubleProperty *prop,
unsigned int depth, PluginProgress * = 0);
TLP_SCOPE bool computeDagLevelMetric(Graph *graph, DoubleProperty *prop, PluginProgress * = 0);
TLP_SCOPE unsigned int maxDegree(Graph *);
TLP_SCOPE unsigned int minDegree(Graph *);
/*
* Compute the distance from n to all the other nodes of graph
* and store it into distance, (stored value is UINT_MAX for non connected nodes),
* if direction is set to 2 use undirected graph, 0 use directed graph
* and 1 use reverse directed graph (ie. all edges are reversed)
* all the edge's weight is set to 1. (it uses a bfs thus the complexity is o(m), m = |E|).
*/
TLP_SCOPE unsigned int maxDistance(Graph *graph, node n, MutableContainer<unsigned int> &distance, int direction = 2);
}
#endif
|