Boost.Graph

    • Introduction
    • Primitives
    • Graph Classes
      • Adjacency List
      • Adjacency Matrix
      • Compressed Sparse Row Graph
    • Property Maps
      • Bundled Properties
      • External Properties
      • Internal Tags (Legacy)
      • Common Mistakes
    • Visitors
      • Pre-built Event Visitors
        • Predecessor Recorder
        • Distance Recorder
        • Time Stamper
        • Property Put
        • Property Writer
        • Edge Predecessor Recorder
        • Null Visitor
        • TSP Tour Visitor
        • TSP Tour Len Visitor
        • A* Heuristic (Zero)
      • Concepts
        • BFS Visitor
        • DFS Visitor
        • Dijkstra Visitor
        • Bellman-Ford Visitor
        • A* Visitor
        • A* Heuristic
        • Event Visitor
        • Planar Face Visitor
        • TSP Tour Visitor
        • Add Edge Visitor
      • Algorithm adaptors
        • Event Visitor List
        • BFS Visitor Adaptor
        • DFS Visitor Adaptor
        • Dijkstra Visitor Adaptor
        • Bellman-Ford Visitor Adaptor
        • A* Visitor Adaptor
    • Algorithms
      • Traversal
        • Breadth First Search
        • Breadth First Visit
        • Depth First Search
        • Depth First Visit
        • Undirected DFS
      • Shortest Paths
        • Dijkstra Shortest Paths
        • Dijkstra Shortest Paths No Color Map
        • Bellman-Ford Shortest Paths
        • DAG Shortest Paths
        • Johnson All Pairs Shortest Paths
        • Floyd-Warshall All Pairs Shortest Paths
        • Resource-Constrained Shortest Paths
        • A* Search
      • Spanning Trees
        • Kruskal Minimum Spanning Tree
        • Prim Minimum Spanning Tree
        • Random Spanning Tree
        • Two Graphs Common Spanning Trees
      • Connected Components
        • Connected Components
        • Strong Components
        • Biconnected Components
        • Incremental Components
      • Network Flow
        • Edmonds-Karp Max Flow
        • Push-Relabel Max Flow
        • Boykov-Kolmogorov Max Flow
        • Stoer-Wagner Min Cut
        • Cycle Canceling
        • Successive Shortest Path Nonnegative Weights
        • Find Flow Cost
        • Edmonds Maximum Cardinality Matching
        • Maximum Weighted Matching
      • Topological Sort
        • Topological Sort
      • Graph Coloring
        • Sequential Vertex Coloring
        • Edge Coloring
        • Is Bipartite
        • Find Odd Cycle
      • Connectivity
        • Edge Connectivity
        • ST Connected
      • Graph Metrics
        • PageRank
        • Brandes Betweenness Centrality
        • Degree Centrality
        • Closeness Centrality
        • Eccentricity
        • Geodesic Distance
        • Clustering Coefficient
        • Core Numbers
        • Profile
        • Wavefront
        • Bandwidth
      • Graph Isomorphism
        • Isomorphism
        • VF2 Subgraph Isomorphism
        • McGregor Common Subgraphs
      • Planar Graphs
        • Boyer-Myrvold Planarity Test
        • Planar Face Traversal
        • Planar Canonical Ordering
        • Chrobak-Payne Straight Line Drawing
        • Is Straight Line Drawing
        • Is Kuratowski Subgraph
        • Make Connected
        • Make Biconnected Planar
        • Make Maximal Planar
      • Layout
        • Topologies
        • Random Graph Layout
        • Circle Layout
        • Kamada-Kawai Spring Layout
        • Fruchterman-Reingold Force Directed Layout
        • Gürsoy-Atun Layout
        • Layout Tolerance
      • Sparse Matrix Ordering
        • Cuthill-McKee Ordering
        • King Ordering
        • Minimum Degree Ordering
        • Sloan Ordering
        • Sloan Start End Vertices
      • Cycle Detection
        • Hawick Circuits
        • Tiernan All Cycles
        • Cycle Ratio
      • Clique Detection
        • Bron-Kerbosch All Cliques
      • Utility
        • Copy Graph
        • Transpose Graph
        • Transitive Closure
        • Transitive Reduction
        • Smallest Last Ordering
        • Lengauer-Tarjan Dominator Tree
        • Metric TSP Approximation
        • Maximum Adjacency Search
        • Betweenness Centrality Clustering
        • Disjoint Sets
        • Incident
        • Opposite
        • Neighbor BFS
        • Loop-Erased Random Walk
        • Graph Statistics
    • Concepts
      • Graph Structure
        • Graph
        • Incidence Graph
        • Bidirectional Graph
        • Adjacency Graph
        • Vertex List Graph
        • Edge List Graph
        • Vertex and Edge List Graph
        • Adjacency Matrix
        • Mutable Graph
        • Vertex Mutable Graph
        • Edge Mutable Graph
        • Property Graph
        • Mutable Property Graph
        • Iterator Constructible Graph
      • Property and Value Types
        • Color Value
        • Buffer
        • Basic Matrix
        • Monoid
        • Keyed Updatable Queue
        • Updatable Queue
        • Planar Embedding
        • Property Tag
    • Graph Generators
      • Random Graph Utilities
      • Erdős-Rényi (Uniform Random)
      • Scale-Free (R-MAT)
      • PLOD (Power Law)
      • Small World (Watts-Strogatz)
      • Mesh (2D Grid)
      • SSCA (Clustered Benchmark)
    • Graph I/O
      • GraphViz (DOT)
      • GraphML
      • DIMACS
    • Graph Adaptors
      • Filtered Graph
      • Reverse Graph
      • Subgraph
      • Edge List
      • Grid Graph
    • Traits and Iterators
      • Graph Traits
      • Adjacency List Traits
      • Property Map
      • property
      • Adjacency Iterator
      • Inverse Adjacency Iterator
    • Exceptions
    • Extending the BGL
      • Worked Example: Graph Coloring
      • Custom Adjacency List Storage
      • Adapting Existing Graph Structures
    • About
      • Design Rationale
      • Graph Theory Review
      • Named Parameters
      • Bibliography
      • History
      • Acknowledgements
      • Publications
      • BGL Users
    • FAQ
  • Visitors
  • Pre-built Event Visitors
  • Null Visitor
arrow_back arrow_upward arrow_forward

null_visitor

A no-op event visitor that does nothing. Used as a placeholder or default when combining event visitors and one slot is not needed.

Defined in: <boost/graph/visitors.hpp>
Models: EventVisitor

Synopsis

struct null_visitor {
    using event_filter = void;

    template <typename X, typename Graph>
    void operator()(X, const Graph&) {}
};
Edit this Page
Edge Predecessor Recorder TSP Tour Visitor