File: adj_list_edge_list_set.cpp

package info (click to toggle)
boost1.74 1.74.0%2Bds1-21
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 463,588 kB
  • sloc: cpp: 3,338,117; xml: 131,293; python: 33,088; ansic: 14,292; asm: 4,038; sh: 3,353; makefile: 1,193; perl: 1,036; yacc: 478; php: 212; ruby: 102; lisp: 24; sql: 13; csh: 6
file content (25 lines) | stat: -rw-r--r-- 642 bytes parent folder | download | duplicates (12)
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
// Copyright 2006 The Trustees of Indiana University.

// Use, modification and distribution is subject to the Boost Software
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

//  Authors: Douglas Gregor
//           Andrew Lumsdaine

// Make sure adjacency_list works with EdgeListS=setS
#include <boost/graph/adjacency_list.hpp>

using namespace boost;

typedef adjacency_list< vecS, vecS, undirectedS, no_property, no_property,
    no_property, setS >
    GraphType;

int main(int, char*[])
{
    GraphType g(10);
    add_vertex(g);
    add_edge(0, 5, g);
    return 0;
}