quickstart.rst 22.9 KB
Newer Older
1
2
3
Quick start using `graph-tool`
==============================

4
5
6
7
The :mod:`graph_tool` module provides a :class:`~graph_tool.Graph` class
and several algorithms that operate on it. The internals of this class,
and of most algorithms, are written in C++ for performance, using the
`Boost Graph Library <http://www.boost.org>`_.
8

9
10
11
The module must be of course imported before it can be used. The package is
subdivided into several sub-modules. To import everything from all of them, one
can do:
12

13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
.. doctest::

   >>> from graph_tool.all import *

In the following, it will always be assumed that the previous line was run.

Creating and manipulating graphs
--------------------------------

An empty graph can be created by instantiating a :class:`~graph_tool.Graph`
class:

.. doctest::

   >>> g = Graph()

By default, newly created graphs are always directed. To construct undirected
30
graphs, one must pass a value to the ``directed`` parameter:
31
32
33
34
35

.. doctest::

   >>> ug = Graph(directed=False)

36
37
38
39
A graph can always be switched *on-the-fly* from directed to undirected
(and vice versa), with the :meth:`~graph_tool.Graph.set_directed`
method. The "directedness" of the graph can be queried with the
:meth:`~graph_tool.Graph.is_directed` method,
40
41
42
43
44
45
46

.. doctest::

   >>> ug = Graph()
   >>> ug.set_directed(False)
   >>> assert(ug.is_directed() == False)

47
48
49
A graph can also be created by providing another graph, in which case
the entire graph (and its internal property maps, see
:ref:`sec_property_maps`) is copied:
50
51
52
53

.. doctest::

   >>> g1 = Graph()
54
   >>> # ... construct g1 ...
55
56
   >>> g2 = Graph(g1)                 # g1 and g2 are copies

57
58
59
60
61
62
63
64
65
Above, ``g2`` is a "deep" copy of ``g1``, i.e. any modification of
``g2`` will not affect ``g1``.

Once a graph is created, it can be populated with vertices and edges. A
vertex can be added with the :meth:`~graph_tool.Graph.add_vertex`
method, which returns an instance of a :class:`~graph_tool.Vertex`
class, also called a *vertex descriptor*. For instance, the following
code creates two vertices, and returns vertex descriptors stored in the
variables ``v1`` and ``v2``.
66
67
68

.. doctest::

69
70
   >>> v1 = g.add_vertex()
   >>> v2 = g.add_vertex()
71

72
73
74
Edges can be added in an analogous manner, by calling the
:meth:`~graph_tool.Graph.add_edge` method, which returns an edge
descriptor (an instance of the :class:`~graph_tool.Edge` class):
75
76
77

.. doctest::

78
   >>> e = g.add_edge(v1, v2)
79

80
81
82
The above code creates a directed edge from ``v1`` to ``v2``. We can
visualize the graph we created so far with the
:func:`~graph_tool.draw.graph_draw` function.
83
84
85

.. doctest::

86
87
88
89
90
91
92
93
   >>> graph_draw(g, vprops={"label": g.vertex_index}, output="two-nodes.png")
   <...>

.. figure:: two-nodes.png
   :align: center

   A simple directed graph with two vertices and one edge, created by
   the commands above.
94

95
96
97
98
With vertex and edge descriptors, one can examine and manipulate the
graph in an arbitrary manner. For instance, in order to obtain the
out-degree of a vertex, we can simply call the
:meth:`~graph_tool.Vertex.out_degree` method:
99
100
101

.. doctest::

102
103
104
105
106
   >>> print v1.out_degree()
   1

Analogously, we could have used the :meth:`~graph_tool.Vertex.in_degree`
method to query the in-degree.
107

108
109
110
111
.. note::

   For undirected graphs, the "out-degree" is synonym for degree, and
   in this case the in-degree of a vertex is always zero.
112

113
114
115
Edge descriptors have two useful methods, :meth:`~graph_tool.Edge.source`
and :meth:`~graph_tool.Edge.target`, which return the source and target
vertex of an edge, respectively.
116
117
118

.. doctest::

119
120
   >>> print e.source(), e.target()
   0 1
121

122
123
124
The :meth:`~graph_tool.Graph.add_vertex` method also accepts an optional
parameter which specifies the number of vertices to create. If this
value is greater than 1, it returns a list of vertex descriptors:
125
126
127

.. doctest::

128
129
130
131
132
133
134
135
136
137
138
139
140
   >>> vlist = g.add_vertex(10)
   >>> print len(vlist)
   10

Edges and vertices can also be removed at any time with the
:meth:`~graph_tool.Graph.remove_vertex` and :meth:`~graph_tool.Graph.remove_edge` methods,

.. doctest::

   >>> g.remove_edge(e)                               # e no longer exists
   >>> g.remove_vertex(v2)                # the second vertex is also gone

.. note::
141

142
143
144
145
146
147
   Removing a vertex is an :math:`O(N)` operation. The vertices are
   internally stored in a STL vector, so removing an element somewhere
   in the middle of the list requires the shifting of the rest of the
   list. Thus, fast :math:`O(1)` removals are only possible if one can
   guarantee that only vertices in the end of the list are removed (the
   ones last added to the graph).
148

149
150
151
152
153
154
155
156
157
   Removing an edge is an :math:`O(k_{s} + k_{t})` operation, where
   :math:`O(k_{s})` is the out-degree of the source vertex, and
   :math:`O(k_{t})` is the in-degree of the target vertex.

Each vertex in a graph has an unique index, which is numbered from 0 to
N-1, where N is the number of vertices. This index can be obtained by
using the :attr:`~graph_tool.Graph.vertex_index` attribute of the graph
(which is a *property map*, see :ref:`sec_property_maps`), or by
converting the vertex descriptor to an ``int``.
158
159
160

.. doctest::

161
162
163
164
165
   >>> v = g.add_vertex()
   >>> print g.vertex_index[v]
   11
   >>> print int(v)
   11
166

167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
.. note::

   Removing a vertex will cause the index of any vertex with a larger
   index to be changed, so that the indexes *always* conform to the
   :math:`[0, N-1]` range. However, property map values (see
   :ref:`sec_property_maps`) are unaffected.

Since vertices are uniquely identifiable by their indexes, there is no
need to keep the vertex descriptor lying around to access them at a
later point. If we know its index, one can obtain the descriptor of a
vertex with a given index using the :meth:`~graph_tool.Graph.vertex`
method,

.. doctest::

   >>> v = g.vertex(8)

which takes an index, and returns a vertex descriptor. Edges cannot be
directly obtained by its index, but if the source and target vertices of
a given edge is known, it can be obtained with the
:meth:`~graph_tool.Graph.edge` method

.. doctest::

   >>> g.add_edge(g.vertex(2), g.vertex(3))
   <...>
   >>> e = g.edge(2, 3)


Another way to obtain edge or vertex descriptors is to *iterate* through
them, as described in section :ref:`sec_iteration`. This is in fact the
most useful way of obtaining vertex and edge descriptors.

Like vertices, edges also have unique indexes, which are given by the
:attr:`~graph_tool.Graph.edge_index` property:
202
203
204
205

.. doctest::

   >>> e = g.add_edge(g.vertex(0), g.vertex(1))
206
207
208
209
210
211
212
213
214
215
   >>> print g.edge_index[e]
   1

Differently from vertices, edge indexes do not necessarily conform to
any specific range. If no edges are ever removed, the indexes will be in
the range :math:`[0, E-1]`, where :math:`E` is the number of edges, and
edges added earlier have lower indexes. However if an edge is removed,
its index will be "vacant", and the remaining indexes will be left
unmodified, and thus will not lie in the range :math:`[0, E-1]`.  If a
new edge is added, it will reuse old indexes, in an increasing order.
216
217
218
219

.. _sec_iteration:

Iterating over vertices and edges
220
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
221

222
223
224
225
Algorithms must often iterate through vertices, edges, out-edges of a
vertex, etc. The :class:`~graph_tool.Graph` and
:class:`~graph_tool.Vertex` classes provide different types of iterators
for doing so. The iterators always point to edge or vertex descriptors.
226

227
228
229
230
231
232
Iterating over all vertices or edges
""""""""""""""""""""""""""""""""""""

In order to iterate through all the vertices or edges of a graph, the
:meth:`~graph_tool.Graph.vertices` and :meth:`~graph_tool.Graph.edges`
methods should be used:
233
234
235
236
237

.. doctest::

   for v in g.vertices():
       print v
Tiago Peixoto's avatar
Tiago Peixoto committed
238
   for e in e.edges():
239
240
241
242
243
       print e

The code above will print the vertices and edges of the graph in the order they
are found.

244
245
246
Iterating over the neighbourhood of a vertex
""""""""""""""""""""""""""""""""""""""""""""

247
248
249
The out- and in-edges of a vertex, as well as the out- and in-neighbours can be
iterated through with the :meth:`~graph_tool.Vertex.out_edges`,
:meth:`~graph_tool.Vertex.in_edges`, :meth:`~graph_tool.Vertex.out_neighbours`
250
and :meth:`~graph_tool.Vertex.in_neighbours` methods, respectively.
251
252
253
254
255
256
257

.. doctest::

   from itertools import izip
   for v in g.vertices():
      for e in v.out_edges():
          print e
258
259
      for w in v.out_neighbours():
          print w
260
261
262
263
264

      # the edge and neighbours order always match
      for e,w in izip(v.out_edges(), v.out_neighbours()):
          assert(e.target() == w)

265
266
267
268
269
270
271
272
273
274
275
276
277
The code above will print the out-edges and out-neighbours of all
vertices in the graph.

.. note::

   The ordering of the vertices and edges visited by the iterators is
   always the same as the order in which they were added to the graph
   (with the exception of the iterator returned by
   :meth:`~graph_tool.Graph.edges`). Usually, algorithms do not care
   about this order, but if it is ever needed, this inherent ordering
   can be relied upon.

.. warning::
278

279
280
281
282
283
   You should never remove vertex or edge descriptors when iterating
   over them, since this invalidates the iterators. If you plan to
   remove vertices or edges during iteration, you must first store them
   somewhere (such as in a list) and remove them only after no iterator
   is being used. Removal during iteration will cause bad things to
284
285
   happen.

286

287
288
289
290
291
.. _sec_property_maps:

Property maps
-------------

292
293
294
295
296
297
Property maps are a way of associating additional information to the
vertices, edges or to the graph itself. There are thus three types of
property maps: vertex, edge and graph. All of them are handled by the
same class, :class:`~graph_tool.PropertyMap`. Each created property map
has an associated *value type*, which must be chosen from the predefined
set:
298
299
300
301
302

.. tabularcolumns:: |l|l|

.. table::

Tiago Peixoto's avatar
Tiago Peixoto committed
303
304
305
306
307
308
309
    ========================     ======================
     Type name                   Alias
    ========================     ======================
    ``bool``                     ``uint8_t``
    ``int32_t``                  ``int``
    ``int64_t``                  ``long``, ``long long``
    ``double``                   ``float``
Tiago Peixoto's avatar
Tiago Peixoto committed
310
311
    ``long double``
    ``string``
Tiago Peixoto's avatar
Tiago Peixoto committed
312
313
314
315
    ``vector<bool>``             ``vector<uint8_t>``
    ``vector<int32_t>``          ``vector<int>``
    ``vector<int64_t>``          ``vector<long>``, ``vector<long long>``
    ``vector<double>``           ``vector<float>``
316
317
    ``vector<long double>``
    ``vector<string>``
Tiago Peixoto's avatar
Tiago Peixoto committed
318
319
    ``python::object``           ``object``
    ========================     ======================
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336

New property maps can be created for a given graph by calling the
:meth:`~graph_tool.Graph.new_vertex_property`, :meth:`~graph_tool.Graph.new_edge_property`, or
:meth:`~graph_tool.Graph.new_graph_property`, for each map type. The values are then
accessed by vertex or edge descriptors, or the graph itself, as such:

.. doctest::

    from itertools import izip
    from numpy.random import randint

    g = Graph()
    g.add_vertex(100)
    # insert some random links
    for s,t in izip(randint(0, 100, 100), randint(0, 100, 100)):
        g.add_edge(g.vertex(s), g.vertex(t))

337
    vprop_double = g.new_vertex_property("double")            # Double-precision floating point
338
339
    vprop_double[g.vertex(10)] = 3.1416

340
    vprop_vint = g.new_vertex_property("vector<int>")         # Vector of ints
341
342
    vprop_vint[g.vertex(40)] = [1, 3, 42, 54]
    
343
344
    eprop_dict = g.new_edge_property("object")                # Arbitrary python object. In this case, a dictionary.
    eprop_dict[g.edges().next()] = {"foo": "bar", "gnu": 42}
345

346
    gprop_bool = g.new_edge_property("bool")                  # Boolean
347
348
    gprop_bool[g] = True

349
350
Property maps with scalar value types can also be accessed as a
:class:`numpy.ndarray`, with the
Tiago Peixoto's avatar
Tiago Peixoto committed
351
:meth:`~graph_tool.PropertyMap.get_array` method, or the
352
:attr:`~graph_tool.PropertyMap.a` attribute, i.e.,
353
354
355
356
357

.. doctest::

    from numpy.random import random

358
    # this assigns random values to the vertex properties
359
360
    vprop_double.get_array()[:] = random(g.num_vertices())

361
362
363
    # or more conveniently (this is equivalent to the above)
    vprop_double.a = random(g.num_vertices())

364
Internal property maps
365
^^^^^^^^^^^^^^^^^^^^^^
366

367
368
369
370
371
Any created property map can be made "internal" to the corresponding
graph. This means that it will be copied and saved to a file together
with the graph. Properties are internalized by including them in the
graph's dictionary-like attributes
:attr:`~graph_tool.Graph.vertex_properties`,
372
:attr:`~graph_tool.Graph.edge_properties` or
373
374
375
:attr:`~graph_tool.Graph.graph_properties`. When inserted in the graph,
the property maps must have an unique name (between those of the same
type):
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406

.. doctest::

    >>> eprop = g.new_edge_property("string")
    >>> g.edge_properties["some name"] = eprop
    >>> g.list_properties()
    some name      (edge)    (type: string)


Graph I/O
---------

Graphs can be saved and loaded in two formats: `graphml
<http://graphml.graphdrawing.org/>`_ and `dot
<http://www.graphviz.org/doc/info/lang.html>`_. Graphml is the default and
preferred format. The dot format is also supported, but since it contains no
type information, all properties are read later as strings, and must be
converted per hand. Therefore you should always use graphml, except when
interfacing with another software which expects dot format.

A graph can be saved or loaded to a file with the :attr:`~graph_tool.Graph.save`
and :attr:`~graph_tool.Graph.load` methods, which take either a file name or a
file-like object. A graph can also be loaded from disk with the
:func:`~graph_tool.load_graph` function, as such:

.. doctest::

    g = Graph()
    #  ... fill the graph ...
    g.save("my_graph.xml.gz")    
    g2 = load_graph("my_graph.xml.gz")
407
    # g and g2 should be copies of each other
408
409
410
411
412
413
414

Graph classes can also be pickled with the :mod:`pickle` module.


An Example: Building a Price Network
------------------------------------

415
416
417
A Price network is the first known model of a "scale-free" graph, invented in
1976 by `de Solla Price
<http://en.wikipedia.org/wiki/Derek_J._de_Solla_Price>`_. It is defined
418
dynamically, where at each time step a new vertex is added to the graph, and
419
connected to an old vertex, with probability proportional to its in-degree. The
420
following program implements this construction using ``graph-tool``.
421

422
423
424
.. literalinclude:: price.py
   :linenos:

425
426
The following is what should happen when the program is run.

427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
.. testcode::
   :hide:

   from price import *
   clf()

.. testoutput::

    vertex: 36063 in-degree: 0 out-degree: 1 age: 36063
    vertex: 9075 in-degree: 4 out-degree: 1 age: 9075
    vertex: 5967 in-degree: 3 out-degree: 1 age: 5967
    vertex: 1113 in-degree: 7 out-degree: 1 age: 1113
    vertex: 25 in-degree: 84 out-degree: 1 age: 25
    vertex: 10 in-degree: 541 out-degree: 1 age: 10
    vertex: 5 in-degree: 140 out-degree: 1 age: 5
    vertex: 2 in-degree: 459 out-degree: 1 age: 2
    vertex: 1 in-degree: 520 out-degree: 1 age: 1
    vertex: 0 in-degree: 210 out-degree: 0 age: 0
    Nowhere else to go... We found the main hub!

447
This is the degree distribution, with 100000 nodes. If you want to see a broader
448
449
power law, try to increase the number of vertices to something like :math:`10^6`
or :math:`10^7`.
450

451
452
.. figure:: deg-hist.png
   :align: center
453

454
455
456
457
458
459
460
461
   In-degree distribution of a price network with 100000 nodes.

We can draw the graph to see some other features of its topology. For that we
use the :func:`~graph_tool.draw.graph_draw` function.

.. testcode::

   g = load_graph("price.xml.gz")
462
463
   age = g.vertex_properties["age"]
   graph_draw(g, size=(15,15), vcolor=age, output="price.png")
464
465
466
467

.. figure:: price.png
   :align: center

468
469
   A Price network with :math:`10^5` nodes. The vertex colors represent
   the age of the vertex, from older (red) to newer (blue).
470
471
472
473

Graph filtering
---------------

474
475
476
477
One of the very nice features of ``graph-tool`` is the "on-the-fly" filtering of
edges and/or vertices. Filtering means the temporary masking of vertices/edges,
which are in fact not really removed, and can be easily recovered. Vertices or
edges which are to be filtered should be marked with a
478
479
480
481
482
483
484
485
:class:`~graph_tool.PropertyMap` with value type ``bool``, and then set with
:meth:`~graph_tool.Graph.set_vertex_filter` or
:meth:`~graph_tool.Graph.set_edge_filter` methods. By default, vertex or edges
with value "1" are `kept` in the graphs, and those with value "0" are filtered
out. This behaviour can be modified with the ``inverted`` parameter of the
respective functions. All manipulation functions and algorithms will work as if
the marked edges or vertices were removed from the graph, with minimum overhead.

Tiago Peixoto's avatar
Tiago Peixoto committed
486
487
488
489
490
491
.. note::

    It is important to emphasize that the filtering functionality does not add
    any overhead when the graph is not being filtered. In this case, the
    algorithms run just as fast as if the filtering functionality didn't exist.

492
493
Here is an example which obtains the minimum spanning tree of a graph,
using the function :func:`~graph_tool.topology.min_spanning_tree` and
494
495
496
497
498
edge filtering.

.. testcode::
   :hide:

499
   from numpy.random import *
500
501
502
503
   seed(42)

.. testcode::

504
   g, pos = triangulation(random((500, 2)) * 4, type="delaunay")
505
   tree = min_spanning_tree(g)
506
   graph_draw(g, pos=pos, pin=True, size=(8, 8), ecolor=tree, output="min_tree.png")
507
508
509
510
511
512
513
514
515
516
517
518
519

The ``tree`` property map has a bool type, with value "1" if the edge belongs to
the tree, and "0" otherwise. Below is an image of the original graph, with the
marked edges.

.. figure:: min_tree.png
   :align: center

We can now filter out the edges which don't belong to the minimum spanning tree.

.. testcode::

    g.set_edge_filter(tree)
520
    graph_draw(g, pos=pos, pin=True, size=(8, 8), output="min_tree_filtered.png")
521
522
523
524
525
526
527

This is how the graph looks when filtered:

.. figure:: min_tree_filtered.png
   :align: center

Everything should work transparently on the filtered graph, simply as if the
Tiago Peixoto's avatar
Tiago Peixoto committed
528
529
530
masked edges were removed. For instance, the following code will calculate the
:func:`~graph_tool.centrality.betweenness` centrality of the edges and vertices,
and draws them as colors and line thickness in the graph.
531
532
533

.. testcode::

Tiago Peixoto's avatar
Tiago Peixoto committed
534
535
536
537
    bv, be = betweenness(g)
    be.a *= 10
    graph_draw(g, pos=pos, pin=True, size=(8,8), vsize=0.07, vcolor=bv,
               eprops={"penwidth":be}, output="filtered-bt.png")
538

Tiago Peixoto's avatar
Tiago Peixoto committed
539
540
.. figure:: filtered-bt.png
   :align: center
541
542
543
544
545
546
547


The original graph can be recovered by setting the edge filter to ``None``.

.. testcode::

    g.set_edge_filter(None)
Tiago Peixoto's avatar
Tiago Peixoto committed
548
549
550
551
    bv, be = betweenness(g)
    be.a *= 10
    graph_draw(g, pos=pos, pin=True, size=(8,8), vsize=0.07, vcolor=bv,
               eprops={"penwidth":be}, output="nonfiltered-bt.png")
552

Tiago Peixoto's avatar
Tiago Peixoto committed
553
554
.. figure:: nonfiltered-bt.png
   :align: center
555
556
557
558
559
560
561
562

Everything works in analogous fashion with vertex filtering.

Additionally, the graph can also have its edges reversed with the
:meth:`~graph_tool.Graph.set_reversed` method. This is also an :math:`O(1)`
operation, which does not really modify the graph.

As mentioned previously, the directedness of the graph can also be changed
563
564
565
566
567
568
569
570
571
572
573
574
575
"on-the-fly" with the :meth:`~graph_tool.Graph.set_directed` method.

Graph views
^^^^^^^^^^^

It is often desired to work with filtered and unfiltered graphs
simultaneously, or to temporarily create a filtered version of graph for
some specific task. For these purposes, graph-tool provides a
:class:`~graph_tool.GraphView` class, which represents a filtered "view"
of a graph, and behaves as an independent graph object, which shares the
underlying data with the original graph. Graph views are constructed by
instantiating a :class:`~graph_tool.GraphView` class, and passing a
graph object which is supposed to be filtered, together with the desired
Tiago Peixoto's avatar
Tiago Peixoto committed
576
577
filter parameters. For example, to create a directed view of the graph
``g`` constructed above, one should do:
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685

.. doctest::

    >>> ug = GraphView(g, directed=True)
    >>> ug.is_directed()
    True

Graph views also provide a much more direct and convenient approach to
vertex/edge filtering: To construct a filtered minimum spanning tree
like in the example above, one must only pass the filter property as the
"efilter" parameter:

.. doctest::

    >>> tv = GraphView(g, efilt=tree)

Note that this is an :math:`O(1)` operation, since it is equivalent (in
speed) to setting the filter in graph ``g`` directly, but in this case
the object ``g`` remains unmodified.

Like above, the result should be the isolated minimum spanning tree:

.. doctest::

    >>> bv, be = betweenness(tv)
    >>> be.a *= 10
    >>> graph_draw(tv, pos=pos, pin=True, size=(8,8), vsize=0.07, vcolor=bv,
    ...            eprops={"penwidth":be}, output="mst-view.png")
    <...>


.. figure:: mst-view.png
   :align: center

   A view of the Delaunay graph, isolating only the minimum spanning tree.

.. note::

   :class:`~graph_tool.GraphView` objects behave *exactly* like regular
   :class:`~graph_tool.Graph` objects. In fact,
   :class:`~graph_tool.GraphView` is a subclass of
   :class:`~graph_tool.Graph`. The only difference is that a
   :class:`~graph_tool.GraphView` object shares its internal data with
   its parent :class:`~graph_tool.Graph` class. Therefore, if the
   original :class:`~graph_tool.Graph` object is modified, this
   modification will be reflected immediately in the
   :class:`~graph_tool.GraphView` object, and vice-versa.

For even more convenience, one can supply a function as filter
parameter, which takes a vertex or an edge as single parameter, and
returns ``True`` if the vertex/edge should be kept and ``False``
otherwise. For instance, if we want to keep only the most "central"
edges, we can do:

.. doctest::

    >>> bv, be = betweenness(g)
    >>> u = GraphView(g, efilt=lambda e: be[e] > 0.01)

This creates a graph view ``u`` which contains only the edges of ``g``
which have a normalized betweenness centrality larger than 0.01. Note
that, differently from the case above, this is an :math:`O(E)`
operation, where :math:`E` is the number of edges, since the supplied
function must be called :math:`E` times to construct a filter property
map. Thus, supplying a constructed filter map is always faster, but
supplying a function can be more convenient.

The graph view constructed above can be visualized as

.. doctest::

    >>> graph_draw(u, pos=pos, pin=True, size=(8,8), vsize=0.07, vcolor=bv,
    ...            output="central-edges-view.png")
    <...>

.. figure:: central-edges-view.png
   :align: center

   A view of the Delaunay graph, isolating only the edges with
   normalized betweenness centrality larger than 0.01.

Composing graph views
"""""""""""""""""""""

Since graph views are regular graphs, one can just as easily create
graph views of graph views. This provides a convenient way of composing
filters. For instance, in order to isolate the minimum spanning tree of
all vertices of the example above which have a degree larger than four,
one can do:


    >>> u = GraphView(g, vfilt=lambda v: v.out_degree() > 4)
    >>> tree = min_spanning_tree(u)
    >>> u = GraphView(u, efilt=tree)

The resulting graph view can be visualized as

.. doctest::

    >>> graph_draw(u, pos=pos, pin=True, size=(8,8), vsize=0.07,
    ...            output="composed-filter.png")
    <...>

.. figure:: composed-filter.png
   :align: center

   A composed view, obtained as the minimum spanning tree of all vertices
   in the graph which have a degree larger than four.