File: diameter.h

package info (click to toggle)
polymake 4.14-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 35,888 kB
  • sloc: cpp: 168,933; perl: 43,407; javascript: 31,575; ansic: 3,007; java: 2,654; python: 632; sh: 268; xml: 117; makefile: 61
file content (81 lines) | stat: -rw-r--r-- 2,065 bytes parent folder | download | duplicates (2)
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
/* Copyright (c) 1997-2024
   Ewgenij Gawrilow, Michael Joswig, and the polymake team
   Technische Universität Berlin, Germany
   https://polymake.org

   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, or (at your option) any
   later version: http://www.gnu.org/licenses/gpl.txt.

   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.
--------------------------------------------------------------------------------
*/

#pragma once

#include "polymake/GenericGraph.h"
#include "polymake/graph/graph_iterators.h"

namespace polymake { namespace graph {

class NodeDistances {
protected:
   std::vector<Int> dist;
public:
   static const bool visit_all_edges=false;

   NodeDistances() {}

   template <typename TGraph>
   explicit NodeDistances(const GenericGraph<TGraph>& G)
      : dist(G.top().dim(), -1) {}

   template <typename TGraph>
   void clear(const GenericGraph<TGraph>& G)
   {
      std::fill(dist.begin(), dist.end(), -1);
   }

   bool operator()(Int n)
   {
      dist[n] = 0;
      return true;
   }

   bool operator()(Int n_from, Int n_to)
   {
      if (dist[n_to] < 0) {
         dist[n_to] = dist[n_from]+1;
         return true;
      }
      return false;
   }

   Int operator[] (Int n) const { return dist[n]; }
};

/// Determine the diameter of a graph.
template <typename TGraph>
Int diameter(const GenericGraph<TGraph>& G)
{
   BFSiterator<TGraph, VisitorTag<NodeDistances>> it(G);
   Int diam = 0;
   for (auto n = entire(nodes(G)); !n.at_end(); ++n) {
      for (it.reset(*n); it.undiscovered_nodes()>0; ++it) ;
      assign_max(diam, it.node_visitor()[it.get_queue().back()]);
   }
   return diam;
}

} }


// Local Variables:
// mode:C++
// c-basic-offset:3
// indent-tabs-mode:nil
// End: