Release 1.41.0

[SVN r57747]
2026-07-21 13:23:42 +00:00 · 2009-11-18 14:58:26 +00:00
817 changed files with 65640 additions and 141980 deletions
@@ -1,15 +0,0 @@
-BasedOnStyle: WebKit
-Standard: Cpp03
-AlignAfterOpenBracket: false
-AlignEscapedNewlinesLeft: true
-AlwaysBreakAfterDefinitionReturnType: None
-BreakBeforeBraces: Allman
-BreakConstructorInitializersBeforeComma: false
-ColumnLimit: 80
-ConstructorInitializerAllOnOneLineOrOnePerLine: true
-ConstructorInitializerIndentWidth: 0
-IndentCaseLabels: false
-SortIncludes: false
-AlignTrailingComments: false
-
-SpacesInAngles: true
@@ -1,64 +0,0 @@
-# Use, modification, and distribution are
-# subject to the Boost Software License, Version 1.0. (See accompanying
-# file LICENSE.txt)
-#
-# Copyright Rene Rivera 2020.
-
-# For Drone CI we use the Starlark scripting language to reduce duplication.
-# As the yaml syntax for Drone CI is rather limited.
-#
-#
-globalenv={}
-linuxglobalimage="cppalliance/droneubuntu1604:1"
-windowsglobalimage="cppalliance/dronevs2019"
-
-def main(ctx):
-  return [
-  linux_cxx("g++-5 14", "g++-5", packages="g++-5", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-5', 'CXXSTD': '14', }, globalenv=globalenv),
-  linux_cxx("g++-5 1z", "g++-5", packages="g++-5", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-5', 'CXXSTD': '1z', }, globalenv=globalenv),
-  
-  linux_cxx("g++-6 14", "g++-6", packages="g++-6", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-6', 'CXXSTD': '14', }, globalenv=globalenv),
-  linux_cxx("g++-6 1z", "g++-6", packages="g++-6", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-6', 'CXXSTD': '1z', }, globalenv=globalenv),
-
-  linux_cxx("g++-7 14", "g++-7", packages="g++-7", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-7', 'CXXSTD': '14', }, globalenv=globalenv),
-  linux_cxx("g++-7 17", "g++-7", packages="g++-7", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-7', 'CXXSTD': '17', }, globalenv=globalenv),
-
-  linux_cxx("g++-8 14", "g++-8", packages="g++-8", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-8', 'CXXSTD': '14', }, globalenv=globalenv),
-  linux_cxx("g++-8 17", "g++-8", packages="g++-8", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-8', 'CXXSTD': '17', }, globalenv=globalenv),
-
-  linux_cxx("g++-9 14", "g++-9", packages="g++-9", buildtype="boost", image="cppalliance/droneubuntu1404:1", environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-9', 'CXXSTD': '14', }, globalenv=globalenv),
-  linux_cxx("g++-9 17", "g++-9", packages="g++-9", buildtype="boost", image="cppalliance/droneubuntu1404:1", environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-9', 'CXXSTD': '17', }, globalenv=globalenv),
-  linux_cxx("g++-9 2a", "g++-9", packages="g++-9", buildtype="boost", image="cppalliance/droneubuntu1404:1", environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-9', 'CXXSTD': '2a', }, globalenv=globalenv),
-
-  linux_cxx("g++-10 14", "g++-10", packages="g++-10", image="cppalliance/droneubuntu2004:1", buildtype="boost", environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-10', 'CXXSTD': '14', }, globalenv=globalenv),
-  linux_cxx("g++-10 17", "g++-10", packages="g++-10", image="cppalliance/droneubuntu2004:1", buildtype="boost", environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-10', 'CXXSTD': '17', }, globalenv=globalenv),
-  linux_cxx("g++-10 20", "g++-10", packages="g++-10", image="cppalliance/droneubuntu2004:1", buildtype="boost", environment={'TOOLSET': 'gcc', 'COMPILER': 'g++-10', 'CXXSTD': '20', }, globalenv=globalenv),
-
-  linux_cxx("clang++-4.0 14", "clang++-4.0", packages="clang-4.0", llvm_os="xenial", llvm_ver="4.0", buildtype="boost", image=linuxglobalimage, environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-4.0', 'CXXSTD': '14', }, globalenv=globalenv),
-
-  linux_cxx("clang++-5.0 14", "clang++-5.0", packages="clang-5.0", llvm_os="xenial", llvm_ver="5.0", buildtype="boost", image="cppalliance/droneubuntu1804:1", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-5.0', 'CXXSTD': '14', }, globalenv=globalenv),
-  
-  linux_cxx("clang++-6.0 14", "clang++-6.0", packages="clang-6.0", llvm_os="xenial", llvm_ver="6.0", buildtype="boost", image="cppalliance/droneubuntu1804:1", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-6.0', 'CXXSTD': '14', }, globalenv=globalenv),
-  
-  linux_cxx("clang++-7 14", "clang++-7", packages="clang-7", llvm_os="xenial", llvm_ver="7", buildtype="boost", image="cppalliance/droneubuntu1804:1", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-7', 'CXXSTD': '14', }, globalenv=globalenv),
-  linux_cxx("clang++-7 17", "clang++-7", packages="clang-7", llvm_os="xenial", llvm_ver="7", buildtype="boost", image="cppalliance/droneubuntu1804:1", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-7', 'CXXSTD': '17', }, globalenv=globalenv),
-  
-  linux_cxx("clang++-8 14", "clang++-8", packages="clang-8", llvm_os="xenial", llvm_ver="8", buildtype="boost", image="cppalliance/droneubuntu1804:1", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-8', 'CXXSTD': '14', }, globalenv=globalenv),
-  linux_cxx("clang++-8 17", "clang++-8", packages="clang-8", llvm_os="xenial", llvm_ver="8", buildtype="boost", image="cppalliance/droneubuntu1804:1", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-8', 'CXXSTD': '17', }, globalenv=globalenv),
-  linux_cxx("clang++-8 2a", "clang++-8", packages="clang-8", llvm_os="xenial", llvm_ver="8", buildtype="boost", image="cppalliance/droneubuntu1804:1", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-8', 'CXXSTD': '2a', }, globalenv=globalenv),
-
-  linux_cxx("clang++-9 14", "clang++-9", packages="clang-9", llvm_os="xenial", llvm_ver="9", buildtype="boost", image="cppalliance/droneubuntu1804:1", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-9', 'CXXSTD': '14', }, globalenv=globalenv),
-  linux_cxx("clang++-9 17", "clang++-9", packages="clang-9", llvm_os="xenial", llvm_ver="9", buildtype="boost", image="cppalliance/droneubuntu1804:1", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-9', 'CXXSTD': '17', }, globalenv=globalenv),
-  linux_cxx("clang++-9 2a", "clang++-9", packages="clang-9", llvm_os="xenial", llvm_ver="9", buildtype="boost", image="cppalliance/droneubuntu1804:1", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-9', 'CXXSTD': '2a', }, globalenv=globalenv),
-
-  linux_cxx("clang++-10 14", "clang++-10", packages="clang-10", llvm_os="xenial", llvm_ver="10", buildtype="boost", image="cppalliance/droneubuntu1804:1", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-10', 'CXXSTD': '14', }, globalenv=globalenv),
-  linux_cxx("clang++-10 17", "clang++-10", packages="clang-10", llvm_os="xenial", llvm_ver="10", buildtype="boost", image="cppalliance/droneubuntu1804:1", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-10', 'CXXSTD': '17', }, globalenv=globalenv),
-  linux_cxx("clang++-10 20", "clang++-10", packages="clang-10", llvm_os="xenial", llvm_ver="10", buildtype="boost", image="cppalliance/droneubuntu1804:1", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++-10', 'CXXSTD': '20', }, globalenv=globalenv),
-
-  osx_cxx("XCode-11.7 14", "clang++", packages="", buildtype="boost", xcode_version="11.7", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++', 'CXXSTD': '14', }, globalenv=globalenv),
-  osx_cxx("XCode-11.7 17", "clang++", packages="", buildtype="boost", xcode_version="11.7", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++', 'CXXSTD': '17', }, globalenv=globalenv),
-  osx_cxx("XCode-11.7 2a", "clang++", packages="", buildtype="boost", xcode_version="11.7", environment={'TOOLSET': 'clang', 'COMPILER': 'clang++', 'CXXSTD': '2a', }, globalenv=globalenv),
-  ]
-
-# from https://github.com/boostorg/boost-ci
-load("@boost_ci//ci/drone/:functions.star", "linux_cxx","windows_cxx","osx_cxx","freebsd_cxx")
@@ -1,3 +0,0 @@
-#!/bin/bash
-
-
@@ -1,3 +0,0 @@
-#!/bin/bash
-
-
@@ -1,3 +0,0 @@
-#!/bin/bash
-
-
@@ -1,42 +0,0 @@
-#!/bin/bash
-
-set -ex
-export TRAVIS_BUILD_DIR=$(pwd)
-export DRONE_BUILD_DIR=$(pwd)
-export TRAVIS_BRANCH=$DRONE_BRANCH
-export VCS_COMMIT_ID=$DRONE_COMMIT
-export GIT_COMMIT=$DRONE_COMMIT
-export PATH=~/.local/bin:/usr/local/bin:$PATH
-
-echo '==================================> BEFORE_INSTALL'
-
-. .drone/before-install.sh
-
-echo '==================================> INSTALL'
-
-cd ..
-git clone -b $TRAVIS_BRANCH --depth 1 https://github.com/boostorg/boost.git boost-root
-cd boost-root
-git submodule update --init tools/build
-git submodule update --init libs/config
-git submodule update --init tools/boost_install
-git submodule update --init libs/headers
-git submodule update --init tools/boostdep
-cp -r $TRAVIS_BUILD_DIR/* libs/graph
-python tools/boostdep/depinst/depinst.py graph
-./bootstrap.sh
-./b2 headers
-
-echo '==================================> BEFORE_SCRIPT'
-
-. $DRONE_BUILD_DIR/.drone/before-script.sh
-
-echo '==================================> SCRIPT'
-
-echo "using $TOOLSET : : $COMPILER : $OPTIONS ;" > ~/user-config.jam
-(cd libs/config/test && ../../../b2 cxxstd=$CXXSTD config_info_travis_install toolset=$TOOLSET && ./config_info_travis)
-(cd libs/graph/test && ../../../b2 -j3 cxxstd=$CXXSTD toolset=$TOOLSET define=CI_SUPPRESS_KNOWN_ISSUES)
-
-echo '==================================> AFTER_SUCCESS'
-
-. $DRONE_BUILD_DIR/.drone/after-success.sh
@@ -1,402 +0,0 @@
-# Copyright 2020 Evan Miller
-# Copyright 2020 Matt Borland
-# Copyright 2021 John Maddock
-# Distributed under the Boost Software License, Version 1.0.
-# (See accompanying file LICENSE_1_0.txt or copy at http://boost.org/LICENSE_1_0.txt)
-
-name: CI
-on: [ push, pull_request ]
-jobs:
-  ubuntu-focal:
-    runs-on: ubuntu-20.04
-    strategy:
-      fail-fast: false
-      matrix:
-      # Removed g++-10 because of an ICE; meant to be fixed in 10.2?
-      # https://gcc.gnu.org/bugzilla/show_bug.cgi?id=94938
-        compiler: [ g++-9, clang++-10 ]
-    steps:
-      - uses: actions/checkout@v2
-        with:
-          fetch-depth: '0'
-      - uses: mstachniuk/ci-skip@v1
-        with:
-          commit-filter: '[skip ci];[ci skip];[CI SKIP];[SKIP CI];***CI SKIP***;***SKIP CI***;[windows];[Windows];[WINDOWS];[apple];[Apple];[APPLE]'
-          commit-filter-separator: ';'
-          fail-fast: true
-      - name: Set TOOLSET
-        run: echo ${{ matrix.compiler }} | awk '/^g/ { print "TOOLSET=gcc" } /^clang/ { print "TOOLSET=clang" }' >> $GITHUB_ENV
-      - name: Add repository
-        run: sudo apt-add-repository -y "ppa:ubuntu-toolchain-r/test"
-      - name: Install packages
-        run: sudo apt install g++-9 clang-10
-      - name: Checkout main boost
-        run: git clone -b develop --depth 1 https://github.com/boostorg/boost.git ../boost-root
-      - name: Update tools/boostdep
-        run: git submodule update --init tools/boostdep
-        working-directory: ../boost-root
-      - name: Copy files
-        run: cp -r $GITHUB_WORKSPACE/* libs/graph
-        working-directory: ../boost-root
-      - name: Install deps
-        run: python tools/boostdep/depinst/depinst.py graph
-        working-directory: ../boost-root
-      - name: Bootstrap
-        run: ./bootstrap.sh
-        working-directory: ../boost-root
-      - name: Generate headers
-        run: ./b2 headers
-        working-directory: ../boost-root
-      - name: Generate user config
-        run: 'echo "using $TOOLSET : : ${{ matrix.compiler }} ;" > ~/user-config.jam'
-        working-directory: ../boost-root
-      - name: Config info
-        run: ../../../b2 print_config_info toolset=$TOOLSET cxxstd=14,17,2a
-        working-directory: ../boost-root/libs/config/test
-      - name: Test
-        run: ../../../b2 toolset=$TOOLSET cxxstd=14,17,2a
-        working-directory: ../boost-root/libs/graph/test
-  macos:
-    runs-on: macos-latest
-    strategy:
-      fail-fast: false
-      matrix:
-        toolset: [ clang ]
-    steps:
-      - uses: actions/checkout@v2
-        with:
-          fetch-depth: '0'
-      - uses: mstachniuk/ci-skip@v1
-        with:
-          commit-filter: '[skip ci];[ci skip];[CI SKIP];[SKIP CI];***CI SKIP***;***SKIP CI***;[windows];[Windows];[WINDOWS];[linux];[Linux];[LINUX]'
-          commit-filter-separator: ';'
-          fail-fast: true
-      - name: Checkout main boost
-        run: git clone -b develop --depth 1 https://github.com/boostorg/boost.git ../boost-root
-      - name: Update tools/boostdep
-        run: git submodule update --init tools/boostdep
-        working-directory: ../boost-root
-      - name: Copy files
-        run: cp -r $GITHUB_WORKSPACE/* libs/graph
-        working-directory: ../boost-root
-      - name: Install deps
-        run: python tools/boostdep/depinst/depinst.py graph
-        working-directory: ../boost-root
-      - name: Bootstrap
-        run: ./bootstrap.sh
-        working-directory: ../boost-root
-      - name: Generate headers
-        run: ./b2 headers
-        working-directory: ../boost-root
-      - name: Config info
-        run: ../../../b2 print_config_info toolset=${{ matrix.toolset }} cxxstd=14,17,2a
-        working-directory: ../boost-root/libs/config/test
-      - name: Test
-        run: ../../../b2 toolset=${{ matrix.toolset }} cxxstd=14,17,2a define=CI_SUPPRESS_KNOWN_ISSUES
-        working-directory: ../boost-root/libs/graph/test
-  windows_msvc_14_2:
-    runs-on: windows-2019
-    defaults:
-      run:
-        shell: cmd
-    strategy:
-      fail-fast: false
-      matrix:
-        toolset: [ msvc-14.2 ]
-    steps:
-      - uses: actions/checkout@v2
-        with:
-          fetch-depth: '0'
-      - uses: mstachniuk/ci-skip@v1
-        with:
-          commit-filter: '[skip ci];[ci skip];[CI SKIP];[SKIP CI];***CI SKIP***;***SKIP CI***;[apple];[Apple];[APPLE];[linux];[Linux];[LINUX]'
-          commit-filter-separator: ';'
-          fail-fast: true
-      - name: Checkout main boost
-        run: git clone -b develop --depth 1 https://github.com/boostorg/boost.git ../boost-root
-      - name: Update tools/boostdep
-        run: git submodule update --init tools/boostdep
-        working-directory: ../boost-root
-      - name: Copy files
-        run: xcopy /s /e /q %GITHUB_WORKSPACE% libs\graph
-        working-directory: ../boost-root
-      - name: Install deps
-        run: python tools/boostdep/depinst/depinst.py graph
-        working-directory: ../boost-root
-      - name: Bootstrap
-        run: bootstrap
-        working-directory: ../boost-root
-      - name: Generate headers
-        run: b2 headers
-        working-directory: ../boost-root
-      - name: Config info
-        run: ..\..\..\b2 print_config_info cxxstd=14,17,20 address-model=64 toolset=msvc-14.2
-        working-directory: ../boost-root/libs/config/test
-      - name: Test
-        run: ..\..\..\b2 --hash address-model=64 cxxstd=14,17,20 toolset=msvc-14.2
-        working-directory: ../boost-root/libs/graph/test
-  windows_msvc_14_3:
-    runs-on: windows-2022
-    defaults:
-      run:
-        shell: cmd
-    strategy:
-      fail-fast: false
-      matrix:
-        toolset: [ msvc-14.3 ]
-    steps:
-      - uses: actions/checkout@v2
-        with:
-          fetch-depth: '0'
-      - uses: mstachniuk/ci-skip@v1
-        with:
-          commit-filter: '[skip ci];[ci skip];[CI SKIP];[SKIP CI];***CI SKIP***;***SKIP CI***;[apple];[Apple];[APPLE];[linux];[Linux];[LINUX]'
-          commit-filter-separator: ';'
-          fail-fast: true
-      - name: Checkout main boost
-        run: git clone -b develop --depth 1 https://github.com/boostorg/boost.git ../boost-root
-      - name: Update tools/boostdep
-        run: git submodule update --init tools/boostdep
-        working-directory: ../boost-root
-      - name: Copy files
-        run: xcopy /s /e /q %GITHUB_WORKSPACE% libs\graph
-        working-directory: ../boost-root
-      - name: Install deps
-        run: python tools/boostdep/depinst/depinst.py graph
-        working-directory: ../boost-root
-      - name: Bootstrap
-        run: bootstrap
-        working-directory: ../boost-root
-      - name: Generate headers
-        run: b2 headers
-        working-directory: ../boost-root
-      - name: Config info
-        run: ..\..\..\b2 print_config_info cxxstd=14,17,20 address-model=64 toolset=msvc-14.3
-        working-directory: ../boost-root/libs/config/test
-      - name: Test
-        run: ..\..\..\b2 --hash address-model=64 cxxstd=14,17,20 toolset=msvc-14.3
-        working-directory: ../boost-root/libs/graph/test
-
-  posix-cmake-subdir:
-    strategy:
-      fail-fast: false
-      matrix:
-        include:
-          - os: ubuntu-20.04
-          - os: ubuntu-22.04
-          - os: ubuntu-24.04
-          - os: macos-13
-          - os: macos-14
-          - os: macos-15
-
-    runs-on: ${{matrix.os}}
-
-    steps:
-      - uses: actions/checkout@v4
-
-      - name: Install packages
-        if: matrix.install
-        run: sudo apt-get -y install ${{matrix.install}}
-
-      - name: Setup Boost
-        run: |
-          echo GITHUB_REPOSITORY: $GITHUB_REPOSITORY
-          LIBRARY=${GITHUB_REPOSITORY#*/}
-          echo LIBRARY: $LIBRARY
-          echo "LIBRARY=$LIBRARY" >> $GITHUB_ENV
-          echo GITHUB_BASE_REF: $GITHUB_BASE_REF
-          echo GITHUB_REF: $GITHUB_REF
-          REF=${GITHUB_BASE_REF:-$GITHUB_REF}
-          REF=${REF#refs/heads/}
-          echo REF: $REF
-          BOOST_BRANCH=develop && [ "$REF" == "master" ] && BOOST_BRANCH=master || true
-          echo BOOST_BRANCH: $BOOST_BRANCH
-          cd ..
-          git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/boost.git boost-root
-          cd boost-root
-          cp -r $GITHUB_WORKSPACE/* libs/$LIBRARY
-          git submodule update --init tools/boostdep
-          python tools/boostdep/depinst/depinst.py --git_args "--jobs 3" $LIBRARY
-
-      - name: Use library with add_subdirectory
-        run: |
-          cd ../boost-root/libs/$LIBRARY/test/cmake_subdir_test
-          mkdir __build__ && cd __build__
-          cmake ..
-          cmake --build .
-          ctest --output-on-failure --no-tests=error
-
-  posix-cmake-install:
-    strategy:
-      fail-fast: false
-      matrix:
-        include:
-          - os: ubuntu-20.04
-          - os: ubuntu-22.04
-          - os: ubuntu-24.04
-          - os: macos-13
-          - os: macos-14
-          - os: macos-15
-
-    runs-on: ${{matrix.os}}
-
-    steps:
-      - uses: actions/checkout@v4
-
-      - name: Install packages
-        if: matrix.install
-        run: sudo apt-get -y install ${{matrix.install}}
-
-      - name: Setup Boost
-        run: |
-          echo GITHUB_REPOSITORY: $GITHUB_REPOSITORY
-          LIBRARY=${GITHUB_REPOSITORY#*/}
-          echo LIBRARY: $LIBRARY
-          echo "LIBRARY=$LIBRARY" >> $GITHUB_ENV
-          echo GITHUB_BASE_REF: $GITHUB_BASE_REF
-          echo GITHUB_REF: $GITHUB_REF
-          REF=${GITHUB_BASE_REF:-$GITHUB_REF}
-          REF=${REF#refs/heads/}
-          echo REF: $REF
-          BOOST_BRANCH=develop && [ "$REF" == "master" ] && BOOST_BRANCH=master || true
-          echo BOOST_BRANCH: $BOOST_BRANCH
-          cd ..
-          git clone -b $BOOST_BRANCH --depth 1 https://github.com/boostorg/boost.git boost-root
-          cd boost-root
-          cp -r $GITHUB_WORKSPACE/* libs/$LIBRARY
-          git submodule update --init tools/boostdep
-          python tools/boostdep/depinst/depinst.py --git_args "--jobs 3" $LIBRARY
-
-      - name: Configure
-        run: |
-          cd ../boost-root
-          mkdir __build__ && cd __build__
-          cmake -DBOOST_INCLUDE_LIBRARIES=$LIBRARY -DCMAKE_INSTALL_PREFIX=~/.local ..
-
-      - name: Install
-        run: |
-          cd ../boost-root/__build__
-          cmake --build . --target install
-
-      - name: Use the installed library
-        run: |
-          cd ../boost-root/libs/$LIBRARY/test/cmake_install_test && mkdir __build__ && cd __build__
-          cmake -DCMAKE_INSTALL_PREFIX=~/.local ..
-          cmake --build .
-          ctest --output-on-failure --no-tests=error
-
-  windows-cmake-subdir:
-    strategy:
-      fail-fast: false
-      matrix:
-        include:
-          - os: windows-2019
-          - os: windows-2022
-
-    runs-on: ${{matrix.os}}
-
-    steps:
-      - uses: actions/checkout@v4
-
-      - name: Setup Boost
-        shell: cmd
-        run: |
-          echo GITHUB_REPOSITORY: %GITHUB_REPOSITORY%
-          for /f %%i in ("%GITHUB_REPOSITORY%") do set LIBRARY=%%~nxi
-          echo LIBRARY: %LIBRARY%
-          echo LIBRARY=%LIBRARY%>>%GITHUB_ENV%
-          echo GITHUB_BASE_REF: %GITHUB_BASE_REF%
-          echo GITHUB_REF: %GITHUB_REF%
-          if "%GITHUB_BASE_REF%" == "" set GITHUB_BASE_REF=%GITHUB_REF%
-          set BOOST_BRANCH=develop
-          for /f %%i in ("%GITHUB_BASE_REF%") do if "%%~nxi" == "master" set BOOST_BRANCH=master
-          echo BOOST_BRANCH: %BOOST_BRANCH%
-          cd ..
-          git clone -b %BOOST_BRANCH% --depth 1 https://github.com/boostorg/boost.git boost-root
-          cd boost-root
-          xcopy /s /e /q %GITHUB_WORKSPACE% libs\%LIBRARY%\
-          git submodule update --init tools/boostdep
-          python tools/boostdep/depinst/depinst.py --git_args "--jobs 3" %LIBRARY%
-
-      - name: Use library with add_subdirectory (Debug)
-        shell: cmd
-        run: |
-          cd ../boost-root/libs/%LIBRARY%/test/cmake_subdir_test
-          mkdir __build__ && cd __build__
-          cmake ..
-          cmake --build . --config Debug
-          ctest --output-on-failure --no-tests=error -C Debug
-
-      - name: Use library with add_subdirectory (Release)
-        shell: cmd
-        run: |
-          cd ../boost-root/libs/%LIBRARY%/test/cmake_subdir_test/__build__
-          cmake --build . --config Release
-          ctest --output-on-failure --no-tests=error -C Release
-
-  windows-cmake-install:
-    strategy:
-      fail-fast: false
-      matrix:
-        include:
-          - os: windows-2019
-          - os: windows-2022
-
-    runs-on: ${{matrix.os}}
-
-    steps:
-      - uses: actions/checkout@v4
-
-      - name: Setup Boost
-        shell: cmd
-        run: |
-          echo GITHUB_REPOSITORY: %GITHUB_REPOSITORY%
-          for /f %%i in ("%GITHUB_REPOSITORY%") do set LIBRARY=%%~nxi
-          echo LIBRARY: %LIBRARY%
-          echo LIBRARY=%LIBRARY%>>%GITHUB_ENV%
-          echo GITHUB_BASE_REF: %GITHUB_BASE_REF%
-          echo GITHUB_REF: %GITHUB_REF%
-          if "%GITHUB_BASE_REF%" == "" set GITHUB_BASE_REF=%GITHUB_REF%
-          set BOOST_BRANCH=develop
-          for /f %%i in ("%GITHUB_BASE_REF%") do if "%%~nxi" == "master" set BOOST_BRANCH=master
-          echo BOOST_BRANCH: %BOOST_BRANCH%
-          cd ..
-          git clone -b %BOOST_BRANCH% --depth 1 https://github.com/boostorg/boost.git boost-root
-          cd boost-root
-          xcopy /s /e /q %GITHUB_WORKSPACE% libs\%LIBRARY%\
-          git submodule update --init tools/boostdep
-          python tools/boostdep/depinst/depinst.py --git_args "--jobs 3" %LIBRARY%
-
-      - name: Configure
-        shell: cmd
-        run: |
-          cd ../boost-root
-          mkdir __build__ && cd __build__
-          cmake -DBOOST_INCLUDE_LIBRARIES=%LIBRARY% -DCMAKE_INSTALL_PREFIX=C:/cmake-prefix ..
-
-      - name: Install (Debug)
-        shell: cmd
-        run: |
-          cd ../boost-root/__build__
-          cmake --build . --target install --config Debug
-
-      - name: Install (Release)
-        shell: cmd
-        run: |
-          cd ../boost-root/__build__
-          cmake --build . --target install --config Release
-
-      - name: Use the installed library (Debug)
-        shell: cmd
-        run: |
-          cd ../boost-root/libs/%LIBRARY%/test/cmake_install_test && mkdir __build__ && cd __build__
-          cmake -DCMAKE_INSTALL_PREFIX=C:/cmake-prefix ..
-          cmake --build . --config Debug
-          ctest --output-on-failure --no-tests=error -C Debug
-
-      - name: Use the installed library (Release)
-        shell: cmd
-        run: |
-          cd ../boost-root/libs/%LIBRARY%/test/cmake_install_test/__build__
-          cmake --build . --config Release
-          ctest --output-on-failure --no-tests=error -C Release
@@ -1,12 +0,0 @@
-cube-fr.dot
-cube.dot
-disconnected-fr.dot
-graphml_test_out.xml
-kevin-bacon2.dat
-random.dot
-triangular-fr.dot
-triangular-kk.dot
-test/*.dot
-example/routing-table.dat
-example/figs/ospf-sptree.dot
-CMakeFiles/
@@ -1,80 +0,0 @@
-# Copyright 2020, 2021 Peter Dimov
-# Distributed under the Boost Software License, Version 1.0.
-# https://www.boost.org/LICENSE_1_0.txt
-
-cmake_minimum_required(VERSION 3.5...3.16)
-
-project(boost_graph VERSION "${BOOST_SUPERPROJECT_VERSION}" LANGUAGES CXX)
-
-add_library(boost_graph
-  src/graphml.cpp
-  src/read_graphviz_new.cpp
-)
-
-add_library(Boost::graph ALIAS boost_graph)
-
-target_include_directories(boost_graph PUBLIC include)
-
-target_link_libraries(boost_graph
-  PUBLIC
-    Boost::algorithm
-    Boost::any
-    Boost::array
-    Boost::assert
-    Boost::bimap
-    Boost::bind
-    Boost::concept_check
-    Boost::config
-    Boost::container_hash
-    Boost::conversion
-    Boost::core
-    Boost::detail
-    Boost::foreach
-    Boost::function
-    Boost::integer
-    Boost::iterator
-    Boost::lexical_cast
-    Boost::math
-    Boost::move
-    Boost::mpl
-    Boost::multi_index
-    Boost::optional
-    Boost::parameter
-    Boost::preprocessor
-    Boost::property_map
-    Boost::property_tree
-    Boost::random
-    Boost::range
-    Boost::serialization
-    Boost::smart_ptr
-    Boost::spirit
-    Boost::static_assert
-    Boost::throw_exception
-    Boost::tti
-    Boost::tuple
-    Boost::type_traits
-    Boost::typeof
-    Boost::unordered
-    Boost::utility
-    Boost::xpressive
-  PRIVATE
-    Boost::regex
-)
-
-target_compile_definitions(boost_graph
-  PUBLIC BOOST_GRAPH_NO_LIB
-  # Source files already define BOOST_GRAPH_SOURCE
-  # PRIVATE BOOST_GRAPH_SOURCE
-)
-
-if(BUILD_SHARED_LIBS)
-  target_compile_definitions(boost_graph PUBLIC BOOST_GRAPH_DYN_LINK)
-else()
-  target_compile_definitions(boost_graph PUBLIC BOOST_GRAPH_STATIC_LINK)
-endif()
-
-if(BUILD_TESTING AND EXISTS "${CMAKE_CURRENT_SOURCE_DIR}/test/CMakeLists.txt")
-
-  add_subdirectory(test)
-
-endif()
@@ -1,57 +0,0 @@
-# Boost Graph Library
-
-===================
-
-A generic interface for traversing graphs, using C++ templates.
-
-The full documentation is available on [boost.org](http://www.boost.org/doc/libs/release/libs/graph/doc/index.html).
-
-## Support, bugs and feature requests
-
-Bugs and feature requests can be reported through the [Github issue page](https://github.com/boostorg/graph/issues).
-
-See also:
-
-* [Current open issues](https://github.com/boostorg/graph/issues)
-* [Closed issues](https://github.com/boostorg/graph/issues?utf8=%E2%9C%93&q=is%3Aissue+is%3Aclosed)
-* Old issues still open on [Trac](https://svn.boost.org/trac/boost/query?status=!closed&component=graph&desc=1&order=id)
-* Closed issues on [Trac](https://svn.boost.org/trac/boost/query?status=closed&component=graph&col=id&col=summary&col=status&col=owner&col=type&col=milestone&col=version&desc=1&order=id)
-
-You can submit your changes through a [pull request](https://github.com/boostorg/graph/pulls). One of the maintainers will take a look (remember that it can take some time).
-
-There is no mailing-list specific to Boost Graph, although you can use the general-purpose Boost [mailing-list](http://lists.boost.org/mailman/listinfo.cgi/boost-users) using the tag [graph].
-
-
-### Build Status
-
-|                  |  Master  |   Develop   |
-|------------------|----------|-------------|
-| Github Actions | [![Build Status](https://github.com/boostorg/graph/actions/workflows/ci.yml/badge.svg?branch=master)](https://github.com/boostorg/graph/actions) | [![Build Status](https://github.com/boostorg/graph/actions/workflows/ci.yml/badge.svg?branch=develop)](https://github.com/boostorg/graph/actions) |
-|Drone | [![Build Status](https://drone.cpp.al/api/badges/boostorg/graph/status.svg?ref=refs/heads/master)](https://drone.cpp.al/boostorg/graph) | [![Build Status](https://drone.cpp.al/api/badges/boostorg/graph/status.svg)](https:/drone.cpp.al/boostorg/graph) |
-
-## Development
-
-Clone the whole boost project, which includes the individual Boost projects as submodules ([see boost+git doc](https://github.com/boostorg/boost/wiki/Getting-Started)):
-
-    git clone https://github.com/boostorg/boost
-    cd boost
-    git submodule update --init
-
-The Boost Graph Library is located in `libs/graph/`.
-
-Boost Graph Library is mostly made of headers but also contains some compiled components. Here are the build commands:
-
-    ./bootstrap.sh            <- compile b2
-    ./b2 headers              <- just installs headers
-    ./b2                      <- build compiled components
-
-**Note:** The Boost Graph Library cannot currently be built outside of Boost itself.
-
-### Running tests
-First, make sure you are in `libs/graph/test`.
-You can either run all the 300+ tests listed in `Jamfile.v2` or run a single test:
-
-    ../../../b2                        <- run all tests
-    ../../../b2 cycle_canceling_test   <- single test
-
-You can also check the [regression tests reports](http://beta.boost.org/development/tests/develop/developer/graph.html).
@@ -11,18 +11,53 @@ project boost/graph
    : source-location ../src
    ;

+local optional_sources ;
+local optional_reqs ;
+
+if [ modules.peek : EXPAT_INCLUDE ] && [ modules.peek : EXPAT_LIBPATH ]
+{
+  local EXPAT_INCLUDE = [ modules.peek : EXPAT_INCLUDE ] ;
+  local EXPAT_LIBPATH = [ modules.peek : EXPAT_LIBPATH ] ;
+
+  if --debug-configuration in [ modules.peek : ARGV ]
+  {
+    ECHO "Expat include directory: $(EXPAT_INCLUDE)" ;
+    ECHO "Expat library directory: $(EXPAT_LIBPATH)" ;
+  }
+
+  alias graphml
+      : graphml.cpp
+      : # requirements
+      : # default built
+      : # usage requirements
+        <include>$(EXPAT_INCLUDE)
+        <library-path>$(EXPAT_LIBPATH)
+        <find-shared-library>expat
+      ;
+}
+else
+{
+    message graphml
+      : "warning: Graph library does not contain optional GraphML reader."
+      : "note: to enable GraphML support, set EXPAT_INCLUDE and EXPAT_LIBPATH to the"
+      : "note: directories containing the Expat headers and libraries, respectively."
+      ;
+}
+explicit graphml ;
+
 lib boost_graph
    :
    read_graphviz_new.cpp
-    graphml.cpp
+    graphml
    :
+    <library>../../regex/build//boost_regex
+    <define>BOOST_GRAPH_NO_LIB=1
    <link>shared:<define>BOOST_GRAPH_DYN_LINK=1
+    # # Intel compiler ICEs if we turn optimization on
+    <toolset>intel-vc71-win-9.1:<optimization>off
    # Without these flags, MSVC 7.1 and 8.0 crash
-    # User reports that VC++ 8.0 does not fail anymore, so that is removed
    <toolset>msvc-7.1:<cxxflags>-GR-
-    <toolset>sun:<build>no
-    :
-    :
+    <toolset>msvc-8.0:<cxxflags>-GR-
    ;

 boost-install boost_graph ;
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) 2004 Kris Beevers
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: AStarHeuristic</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -32,7 +32,7 @@ href="./astar_search.html">astar_search()</a>.

 <h3>Refinement of</h3>

-<a href="http://www.boost.org/sgi/stl/UnaryFunction.html">Unary
+<a href="http://www.sgi.com/tech/stl/UnaryFunction.html">Unary
 Function</a> (must take a single argument -- a graph vertex -- and
 return a cost value) and <a
 href="../../utility/CopyConstructible.html">Copy Constructible</a>
@@ -116,7 +116,7 @@ Called for the target of every out edge of a vertex being examined.
  struct AStarHeuristicConcept {
    void constraints()
    {
-      BOOST_CONCEPT_ASSERT(( CopyConstructibleConcept&lt;Heuristic&gt; ));
+      function_requires&lt; CopyConstructibleConcept&lt;Heuristic&gt; &gt;();
      h(u);
    }
    Heuristic h;
@@ -129,10 +129,10 @@ Called for the target of every out edge of a vertex being examined.
 <TABLE>
 <TR valign=top>
 <TD nowrap>Copyright &copy; 2004</TD><TD>
-<A HREF="http://cs.krisbeevers.com/">Kristopher Beevers</A>,
+<A HREF="http://www.cs.rpi.edu/~beevek/">Kristopher Beevers</A>,
 Rensselaer Polytechnic Institute (<A
 HREF="mailto:beevek@cs.rpi.edu">beevek@cs.rpi.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) 2004 Kris Beevers
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: AStarVisitor</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -49,7 +49,7 @@ taken during the graph search.

 <TR>
 <TD><tt>g</tt></TD>
-<TD>An object of type <tt>const G&amp;</tt>.</TD>
+<TD>An object of type <tt>G</tt>.</TD>
 </TR>

 <TR>
@@ -118,7 +118,7 @@ OPEN list.
 <td><tt>vis.examine_vertex(u, g)</tt></td>
 <td><tt>void</tt></td>
 <td>
-This is invoked on a vertex as it is popped from the queue (i.e., it
+This is invoked on a vertex as it is popped from the queue (i.e. it
 has the lowest cost on the OPEN list). This happens immediately before
 <tt>examine_edge()</tt> is invoked on each of the out-edges of vertex
 <tt>u</tt>.
@@ -160,7 +160,7 @@ assert(compare(combine(d_u, w_e), d_s));
 <td><tt>vis.edge_not_relaxed(e, g)</tt></td>
 <td><tt>void</tt></td>
 <td>
-Upon examination, if an edge is not relaxed (see above) then this
+Upon examination, if an edge is not relaxed (see above), then this
 method is invoked.
 </td>
 </tr>
@@ -171,7 +171,7 @@ method is invoked.
 <td><tt>void</tt></td>
 <td>
 This is invoked when a vertex that is on the CLOSED list is
-``rediscovered'' via a more efficient path and is re-added to the
+``rediscovered'' via a more efficient path, and is re-added to the
 OPEN list.
 </td>
 </tr>
@@ -181,8 +181,8 @@ OPEN list.
 <td><tt>vis.finish_vertex(u, g)</tt></td>
 <td><tt>void</tt></td>
 <td>
-This is invoked on a vertex when it is added to the CLOSED list. This
-happens after all of its out-edges have been examined.
+This is invoked on a vertex when it is added to the CLOSED list, which
+happens after all of its out edges have been examined.
 </td>
 </tr>

@@ -204,10 +204,10 @@ happens after all of its out-edges have been examined.
 <TABLE>
 <TR valign=top>
 <TD nowrap>Copyright &copy; 2004</TD><TD>
-<A HREF="http://cs.krisbeevers.com/">Kristopher Beevers</A>,
+<A HREF="http://www.cs.rpi.edu/~beevek/">Kristopher Beevers</A>,
 Rensselaer Polytechnic Institute (<A
 HREF="mailto:beevek@cs.rpi.edu">beevek@cs.rpi.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,21 +1,21 @@
 <html>
 <head>
 <!-- Copyright 2007 Aaron Windsor
-
+     
     Distributed under 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)
-
+    
  -->
 <title>AddEdgeVisitor Concept</title>
 </head>
-<body alink="#ff0000"
-      bgcolor="#ffffff"
-      link="#0000ee"
-      text="#000000"
-      vlink="#551a8b">
+<body alink="#ff0000" 
+      bgcolor="#ffffff" 
+      link="#0000ee" 
+      text="#000000" 
+      vlink="#551a8b"> 

-<img src="../../../boost.png" alt="C++ Boost" height="86" width="277">
+<img src="../../../boost.png" alt="C++ Boost" height="86" width="277"> 

 <br clear="">

@@ -23,7 +23,7 @@

 The AddEdgeVisitor concept exists to allow for some indirection in algorithms
 that modify graphs by adding edges. In such algorithms, it may be convenient
-to perform additional operations (such as updating an edge index map) at
+to perform additional operations (such as updating an edge index map) at 
 points in the algorithm where an edge addition occurs. Replacing calls to
 to <tt>add_edge</tt> with calls to <tt>AddEdgeVisitor::visit_vertex_pair</tt>
 allows for such operations to be defined independently from the algorithm.
@@ -38,8 +38,8 @@ allows for such operations to be defined independently from the algorithm.
 <td> is a type that models the AddEdgeVisitor concept </td>
 </tr>

-<tr>
-<td> <tt>vis</tt> </td>
+<tr> 
+<td> <tt>vis</tt> </td>  
 <td> is an object of type Visitor </td>
 </tr>

@@ -48,15 +48,15 @@ allows for such operations to be defined independently from the algorithm.
 <td> is the type of a graph </td>
 </tr>

-<tr>
-<td> <tt>u,v</tt> </td>
+<tr> 
+<td> <tt>u,v</tt> </td>  
 <td> are objects of type <tt>graph_traits&lt;Graph&gt;::vertex_descriptor</tt>
 </td>
 </tr>

-<tr>
-<td> <tt>e</tt> </td>
-<td> is an object of type <tt>graph_traits&lt;Graph&gt;::edge_descriptor</tt>
+<tr> 
+<td> <tt>e</tt> </td>  
+<td> is an object of type <tt>graph_traits&lt;Graph&gt;::edge_descriptor</tt> 
 </td>
 </tr>

@@ -66,7 +66,7 @@ allows for such operations to be defined independently from the algorithm.
 </td>

 </tr><tr>
-<td>
+<td> 

 </td></tr></tbody></table>

@@ -84,7 +84,7 @@ None
 <tbody><tr><th>Name</th><th>Expression</th><th>Return Type</th>
 <th>Description</th>

-</tr><tr>
+</tr><tr> 
 <td> Add an Edge </td>
 <td> <tt>vis.visit_vertex_pair(u, v, g)</tt>  </td>
 <td> <tt>void</tt></td>
@@ -96,26 +96,26 @@ None

 </p><h3>Models</h3>

-Two models of this concept are defined in the file
+Two models of this concept are defined in the file 
 <a href="../../../boost/graph/planar_detail/add_edge_visitors.hpp">
 <tt>add_edge_visitors.hpp</tt></a>:

 <ul>
 <li><tt>default_add_edge_visitor</tt>: The constructor of this class takes
 no arguments.<tt>visit_vertex_pair(u, v, g)</tt> is just a dispatch to
-<tt>add_edge(u, v, g)</tt>.
+<tt>add_edge(u, v, g)</tt>. 
 <li><tt>edge_index_update_visitor</tt>: The constructor of this class takes
 two arguments: the first, an EdgeIndexMap,
 is a <a href="../../property_map/doc/ReadWritePropertyMap.html">
-ReadWritePropertyMap</a> that maps each edge in the associated graph
-<tt>g</tt> to a distinct integer in the range <tt>[0, num_edges(g))</tt>.
-The second argument is the number of edges in the underlying graph, which
+ReadWritePropertyMap</a> that maps each edge in the associated graph 
+<tt>g</tt> to a distinct integer in the range <tt>[0, num_edges(g))</tt>. 
+The second argument is the number of edges in the underlying graph, which 
 serves as the "next available index" counter within the visitor.
-For example, in the case the graph used has an initialized interior
-edge index, the <tt>edge_index_update_visitor</tt> constructor should be
-called with <tt>get(edge_index, g)</tt> as the edge index and
-<tt>num_edges(g)</tt> as the next available index. When
-<tt>visit_vertex_pair(u, v, g)</tt> is called, the
+For example, in the case the graph used has an initialized interior 
+edge index, the <tt>edge_index_update_visitor</tt> constructor should be 
+called with <tt>get(edge_index, g)</tt> as the edge index and 
+<tt>num_edges(g)</tt> as the next available index. When 
+<tt>visit_vertex_pair(u, v, g)</tt> is called, the 
 <tt>edge_index_update_visitor</tt> will add the edge <i>(u,v)</i> to the graph
 and update the edge index for the newly created edge.
 </ul>
@@ -125,6 +125,6 @@ and update the edge index for the newly created edge.
 <br>
 </p><hr>
 Copyright © 2007 Aaron Windsor (<a href="mailto:aaron.windsor@gmail.com">
-aaron.windsor@gmail.com</a>)
+aaron.windsor@gmail.com</a>) 

 </body></html>
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>AdjacencyGraph</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -21,7 +21,7 @@
 AdjacencyGraph
 </H2>

-The AdjacencyGraph concept provides an interface for efficient access
+The AdjacencyGraph concept provides and interface for efficient access
 of the adjacent vertices to a vertex in a graph. This is quite similar
 to the <a href="./IncidenceGraph.html">IncidenceGraph</a> concept (the
 target of an out-edge is an adjacent vertex). Both concepts are
@@ -112,7 +112,8 @@ The <TT>adjacent_vertices()</TT> function must return in constant time.
    typedef typename boost::graph_traits&lt;G&gt;::adjacency_iterator
      adjacency_iterator;
    void constraints() {
-      BOOST_CONCEPT_ASSERT(( MultiPassInputIteratorConcept&lt;adjacency_iterator&gt; ));
+      function_requires&lt; IncidenceGraphConcept&lt;G&gt; &gt;();
+      function_requires&lt; MultiPassInputIteratorConcept&lt;adjacency_iterator&gt; &gt;();

      p = adjacent_vertices(v, g);
      v = *p.first;
@@ -164,4 +165,4 @@ experience with graph algorithm implementations.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>AdjacencyMatrix</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -100,4 +100,4 @@ The <TT>edge()</TT> function must return in constant time.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: BFSVisitor</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -140,9 +140,9 @@ edges for undirected graphs.
 <td><tt>vis.gray_target(e, g)</tt></td>
 <td><tt>void</tt></td>
 <td>
-This is invoked on the subset of non-tree edges whose target vertex is
+This is invoked on the subset of non-tree edges who's target vertex is
 colored gray at the time of examination. The color gray indicates
-that the vertex is currently in the queue.
+that the vertex is currently in the queue. 
 </td>
 </tr>

@@ -151,7 +151,7 @@ that the vertex is currently in the queue.
 <td><tt>vis.black_target(e, g)</tt></td>
 <td><tt>void</tt></td>
 <td>
-This is invoked on the subset of non-tree edges whose target vertex is
+This is invoked on the subset of non-tree edges who's target vertex is
 colored black at the time of examination. The color black indicates
 that the vertex has been removed from the queue.
 </td>
@@ -211,10 +211,10 @@ class count_tree_edges_bfs_visitor(bgl.Graph.BFSVisitor):
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,22 +1,13 @@
 #!/bin/sh

 # Copyright (C) 2009 The Trustees of Indiana University.
-# Copyright (C) 2010 Daniel Trebbien.
 # 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: Jeremiah Willcock, Daniel Trebbien, Andrew Lumsdaine
+# Authors: Jeremiah Willcock, Andrew Lumsdaine

 for i in read_graphml read_graphviz write_graphml; do
  rst2html.py -gdt --link-stylesheet --traceback --trim-footnote-reference-space --footnote-references=superscript --stylesheet=../../../rst.css $i.rst > $i.html
 done
 # Also see grid_graph_export_png.sh for figure conversions
-
-# Stoer-Wagner images from Daniel Trebbien
-fdp -s -n -Tgif -ostoer_wagner_imgs/digraph1.gif stoer_wagner_imgs/digraph1.dot
-fdp -s -n -Tgif -ostoer_wagner_imgs/digraph1-min-cut.gif stoer_wagner_imgs/digraph1-min-cut.dot
-fdp -s -n -Tgif -ostoer_wagner_imgs/stoer_wagner-example.gif stoer_wagner_imgs/stoer_wagner-example.dot
-fdp -s -n -Tgif -ostoer_wagner_imgs/stoer_wagner-example-c1.gif stoer_wagner_imgs/stoer_wagner-example-c1.dot
-fdp -s -n -Tgif -ostoer_wagner_imgs/stoer_wagner-example-min-cut.gif stoer_wagner_imgs/stoer_wagner-example-min-cut.dot
-dot -Tgif -ostoer_wagner_imgs/stoer_wagner.cpp.gif stoer_wagner_imgs/stoer_wagner.cpp.dot
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>BasicMatrix</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -78,11 +78,11 @@ Element access is constant time.
    void constraints() {
      V&amp; elt = A[i][j];
      const_constraints(A);
-      ignore_unused_variable_warning(elt);
+      ignore_unused_variable_warning(elt);      
    }
    void const_constraints(const M&amp; A) {
      const V&amp; elt = A[i][j];
-      ignore_unused_variable_warning(elt);
+      ignore_unused_variable_warning(elt);      
    }
    M A;
    I i, j;
@@ -100,4 +100,4 @@ HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Bellman Ford Visitor</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -116,8 +116,8 @@ this method is invoked.
 <td><tt>vis.edge_minimized(e, g)</tt></td>
 <td><tt>void</tt></td>
 <td>
-After <tt>num_vertices(g)</tt> iterations through the edge set
-of the graph are completed, one last iteration is made to test whether
+After the <tt>num_vertices(g)</tt> iterations through the edge set
+of the graph is complete, one last iteration is made to test whether
 each edge was minimized. If the edge is minimized then this function
 is invoked.
 </td>
@@ -175,10 +175,10 @@ class count_tree_edges_bellman_ford_visitor(bgl.Graph.BellmanFordVisitor):
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Bidirectional</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -145,25 +145,20 @@ undirected graphs).
    typedef typename boost::graph_traits&lt;G&gt;::in_edge_iterator
      in_edge_iterator;
    void constraints() {
-      BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept&lt;G&gt; ));
-      BOOST_CONCEPT_ASSERT(( MultiPassInputIteratorConcept&lt;in_edge_iterator&gt; ));
+      function_requires&lt; IncidenceGraphConcept&lt;G&gt; &gt;();
+      function_requires&lt; MultiPassInputIteratorConcept&lt;in_edge_iterator&gt; &gt;();

      p = in_edges(v, g);
-      n = in_degree(v, g);
-      n = degree(v, g);
      e = *p.first;
      const_constraints(g);
    }
    void const_constraints(const G&amp; g) {
      p = in_edges(v, g);
-      n = in_degree(v, g);
-      n = degree(v, g);
      e = *p.first;
    }
    std::pair&lt;in_edge_iterator, in_edge_iterator&gt; p;
    typename boost::graph_traits&lt;G&gt;::vertex_descriptor v;
    typename boost::graph_traits&lt;G&gt;::edge_descriptor e;
-    typename boost::graph_traits&lt;G&gt;::degree_size_type n;
    G g;
  };
 </PRE>
@@ -177,4 +172,4 @@ undirected graphs).
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,7 +1,7 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
@@ -9,10 +9,10 @@
 <Head>
 <Title>Buffer</Title>
 </HEAD>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -43,9 +43,9 @@ For a type to model the Buffer concept it must have the following members.

 <tr> <td><b>Member</b></td> <td><b>Description</b></td> </tr>

-<tr> <td> <tt>value_type</tt> </td>
+<tr> <td> <tt>value_type</tt> </td> 
     <td> The type of object stored in the Buffer. The value type
-          must be <A href="http://www.boost.org/sgi/stl/Assignable.html">Assignable</a>.</td>
+          must be <A href="http://www.sgi.com/tech/stl/Assignable.html">Assignable</a>.</td>
    </tr>

 <tr> <td> <tt>size_type</tt>  </td>
@@ -70,7 +70,7 @@ For a type to model the Buffer concept it must have the following members.
     </tr>

 <tr> <td> <tt>const T& top() const</tt> </td>
-     <td> Returns a const reference to some object in the Buffer.
+     <td> Returns a const reference to some object in the Buffer. 
          Precondition: <tt>empty()</tt> is <tt>false</tt>.</td>
     </tr>

@@ -99,7 +99,7 @@ most linear time complexity in the size of the Generalized Queue.
 <h3>Models</h3>

 <UL>
-<LI><a href="http://www.boost.org/sgi/stl/stack.html"><tt>std::stack</tt></a>
+<LI><a href="http://www.sgi.com/tech/stl/stack.html"><tt>std::stack</tt></a>
 <LI><a href="../../../boost/pending/mutable_queue.hpp"><tt>boost::mutable_queue</tt></a>
 </UL>

@@ -114,5 +114,5 @@ most linear time complexity in the size of the Generalized Queue.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 

@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine  2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: ColorValue Concept</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -28,9 +28,9 @@ mark which vertices have been visited.
 <P>

 <h3>Refinement of</h3> <a
-href="http://www.boost.org/sgi/stl/EqualityComparable.html">EqualityComparable</a>
+href="http://www.sgi.com/tech/stl/EqualityComparable.html">EqualityComparable</a>
 and <a
-href="http://www.boost.org/sgi/stl/DefaultConstructible.html">DefaultConstructible</a>
+href="http://www.sgi.com/tech/stl/DefaultConstructible.html">DefaultConstructible</a>


 <h3>Notation</h3>
@@ -99,10 +99,10 @@ href="http://www.boost.org/sgi/stl/DefaultConstructible.html">DefaultConstructib
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>DFS Visitor</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -149,15 +149,6 @@ undirected graph this method is never called.
 </td>
 </tr>

-<tr>
-<td>Finish Edge</td>
-<td><tt>vis.finish_edge(e, g)</tt></td>
-<td><tt>void</tt></td>
-<td>
-This is invoked on each non-tree edge as well as on each tree edge after
-<tt>finish_vertex</tt> has been called on its target vertex.</td>
-</tr>
-
 <tr>
 <td>Finish Vertex</td>
 <td><tt>vis.finish_vertex(u, g)</tt></td>
@@ -166,7 +157,7 @@ This is invoked on each non-tree edge as well as on each tree edge after
 This is invoked on vertex <tt>u</tt> after <tt>finish_vertex</tt> has
 been called for all the vertices in the DFS-tree rooted at vertex
 <tt>u</tt>. If vertex <tt>u</tt> is a leaf in the DFS-tree, then
-the <tt>finish_vertex</tt> function is called on <tt>u</tt> after
+the <tt>finish_vertex</tt> function is call on <tt>u</tt> after
 all the out-edges of <tt>u</tt> have been examined.
 </td>
 </tr>
@@ -212,10 +203,10 @@ class count_tree_edges_dfs_visitor(bgl.Graph.DFSVisitor):
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Dijkstra Visitor</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -80,7 +80,7 @@ the search.

 <TR>
 <TD><tt>w</tt></TD>
-<TD>An object of type <tt>WeightMap</tt>.</TD>
+<TD>An object of type <tt>DistanceMap</tt>.</TD>
 </TR>

 </table>
@@ -213,10 +213,10 @@ class count_tree_edges_dijkstra_visitor(bgl.Graph.DijkstraVisitor):
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>EdgeListGraph</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -109,7 +109,7 @@ Return type: <TT>vertex_descriptor</TT>
 <tr>
 <TD><TT>target(e, g)</TT></TD>
 <TD>
-Returns the vertex descriptor for
+Returns the vertex descriptor for 
 <i>v</i> of the edge <i>(u,v)</i> represented by  <TT>e</TT>.<br>
 Return type: <TT>vertex_descriptor</TT>
 </TD>
@@ -143,11 +143,11 @@ must all return in constant time.
  template &lt;class G&gt;
  struct EdgeListGraphConcept
  {
-    typedef typename boost::graph_traits&lt;G&gt;::edge_iterator
+    typedef typename boost::graph_traits&lt;G&gt;::edge_iterator 
      edge_iterator;
    void constraints() {
-      BOOST_CONCEPT_ASSERT(( GraphConcept&lt;G&gt; ));
-      BOOST_CONCEPT_ASSERT(( MultiPassInputIteratorConcept&lt;edge_iterator&gt; ));
+      function_requires&lt; GraphConcept&lt;G&gt; &gt;();
+      function_requires&lt; MultiPassInputIteratorConcept&lt;edge_iterator&gt; &gt;();

      p = edges(g);
      E = num_edges(g);
@@ -181,4 +181,4 @@ must all return in constant time.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2001
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Edge Mutable Graph</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -35,7 +35,7 @@ No additional associated types.

 <ul>

-<li><a name="sec:add_edge"><TT>add_edge(u, v, g)</TT></a>
+<li><a name="sec:add_edge"><TT>add_edge(u, v, g)</TT></a> 
 <b>returns</b> <TT>std::pair&lt;edge_descriptor,&nbsp;bool&gt;</TT>
 <br><br>

@@ -105,4 +105,4 @@ UNDER CONSTRUCTION
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: EventVisitor</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -152,10 +152,10 @@ either a vertex or edge descriptor of the graph.
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: EventVisitorList</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -19,7 +19,7 @@

 An EventVisitorList is either an <a
 href="./EventVisitor.html">EventVisitor</a>, or a list of
-EventVisitors combined using <tt>std::pair</tt>. Each graph algorithm
+EventVisitor's combined using <tt>std::pair</tt>. Each graph algorithm
 defines visitor adaptors that convert an EventVisitorList into the
 particular kind of visitor needed by the algorithm.

@@ -91,7 +91,7 @@ Now we can pass the resulting visitor object into
                     color.begin());
 </pre>

-For creating a list of more than two event visitors, you can nest calls to
+For creating a list of more than two event visitors, nest calls to
 <tt>std::make_pair</tt> in the following way:

 <pre>
@@ -118,10 +118,10 @@ std::make_pair(<i>visitor1</i>,
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Graph</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -24,7 +24,7 @@ The Graph concept contains a few requirements that are common to all
 the graph concepts. These include some associated types for
 <tt>vertex_descriptor</tt>, <tt>edge_descriptor</tt>, etc. One should
 note that a model of Graph is <B>not</B> required to be a model of <a
-href="http://www.boost.org/sgi/stl/Assignable.html">Assignable</a>,
+href="http://www.sgi.com/tech/stl/Assignable.html">Assignable</a>,
 so algorithms should pass graph objects by reference.

 <P>
@@ -51,9 +51,9 @@ so algorithms should pass graph objects by reference.
 A vertex descriptor corresponds to a unique vertex in an abstract
 graph instance. A vertex descriptor must be
 <a
-href="http://www.boost.org/sgi/stl/DefaultConstructible.html">Default Constructible</a>,
-<a href="http://www.boost.org/sgi/stl/Assignable.html">Assignable</a>, and
-<a href="http://www.boost.org/sgi/stl/EqualityComparable.html">Equality Comparable</a>.
+href="http://www.sgi.com/tech/stl/DefaultConstructible.html">Default Constructible</a>,
+<a href="http://www.sgi.com/tech/stl/Assignable.html">Assignable</a>, and
+<a href="http://www.sgi.com/tech/stl/EqualityComparable.html">Equality Comparable</a>.
 </td>
 </tr>

@@ -61,9 +61,9 @@ href="http://www.boost.org/sgi/stl/DefaultConstructible.html">Default Constructi
 <td><pre>boost::graph_traits&lt;G&gt;::edge_descriptor</pre>
 An edge descriptor corresponds to a unique edge <i>(u,v)</i> in a
 graph.  An edge descriptor must be <a
-href="http://www.boost.org/sgi/stl/DefaultConstructible.html">Default Constructible</I>,
-<a href="http://www.boost.org/sgi/stl/Assignable.html">Assignable</a>, and
-<a href="http://www.boost.org/sgi/stl/EqualityComparable.html">Equality Comparable</a>.
+href="http://www.sgi.com/tech/stl/DefaultConstructible.html">Default Constructible</I>,
+<a href="http://www.sgi.com/tech/stl/Assignable.html">Assignable</a>, and
+<a href="http://www.sgi.com/tech/stl/EqualityComparable.html">Equality Comparable</a>.
 </td>
 </tr>

@@ -85,10 +85,9 @@ are <TT>allow_parallel_edge_tag</TT> and <TT>disallow_parallel_edge_tag</TT>.
 <td><pre>boost::graph_traits&lt;G&gt;::traversal_category</pre>
 This describes the ways in which the vertices and edges of the
 graph can be visited. The choices are <TT>incidence_graph_tag</TT>,
-<TT>adjacency_graph_tag</TT>, <TT>bidirectional_graph_tag</TT>,
-<TT>vertex_list_graph_tag</TT>, <TT>edge_list_graph_tag</TT>, and
-<TT>adjacency_matrix_tag</TT>. You can also create your own
-tag which should inherit from one or more of the above.
+<TT>adjacency_graph_tag</TT>, <TT>bidirectional_graph_tag</TT>, 
+<TT>vertex_list_graph_tag</TT>, <TT>edge_list_graph_tag</TT>, and 
+<TT>adjacency_matrix_tag</TT>.
 </td>
 </tr>

@@ -122,12 +121,12 @@ any vertex of graph object which type is <tt>G</tt>.
    typedef typename boost::graph_traits&lt;G&gt;::traversal_category traversal_category;

    void constraints() {
-      BOOST_CONCEPT_ASSERT(( DefaultConstructibleConcept&lt;vertex_descriptor&gt; ));
-      BOOST_CONCEPT_ASSERT(( EqualityComparableConcept&lt;vertex_descriptor&gt; ));
-      BOOST_CONCEPT_ASSERT(( AssignableConcept&lt;vertex_descriptor&gt; ));
-      BOOST_CONCEPT_ASSERT(( DefaultConstructibleConcept&lt;edge_descriptor&gt; ));
-      BOOST_CONCEPT_ASSERT(( EqualityComparableConcept&lt;edge_descriptor&gt; ));
-      BOOST_CONCEPT_ASSERT(( AssignableConcept&lt;edge_descriptor&gt; ));
+      function_requires&lt; DefaultConstructibleConcept&lt;vertex_descriptor&gt; &gt;();
+      function_requires&lt; EqualityComparableConcept&lt;vertex_descriptor&gt; &gt;();
+      function_requires&lt; AssignableConcept&lt;vertex_descriptor&gt; &gt;();
+      function_requires&lt; DefaultConstructibleConcept&lt;edge_descriptor&gt; &gt;();
+      function_requires&lt; EqualityComparableConcept&lt;edge_descriptor&gt; &gt;();
+      function_requires&lt; AssignableConcept&lt;edge_descriptor&gt; &gt;();
    }
    G g;
  };
@@ -146,4 +145,4 @@ any vertex of graph object which type is <tt>G</tt>.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>IncidenceGraph</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -162,8 +162,8 @@ Therefore, the extra requirement is added that the out-edge connecting
  {
    typedef typename boost::graph_traits&lt;G&gt;::out_edge_iterator out_edge_iterator;
    void constraints() {
-      BOOST_CONCEPT_ASSERT(( GraphConcept&lt;G&gt; ));
-      BOOST_CONCEPT_ASSERT(( MultiPassInputIteratorConcept&lt;out_edge_iterator&gt; ));
+      function_requires&lt; GraphConcept&lt;G&gt; &gt;();
+      function_requires&lt; MultiPassInputIteratorConcept&lt;out_edge_iterator&gt; &gt;();

      p = out_edges(u, g);
      e = *p.first;
@@ -193,10 +193,10 @@ Therefore, the extra requirement is added that the out-edge connecting
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>IteratorConstructibleGraph</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -22,7 +22,7 @@ IteratorConstructibleGraph
 The IteratorConstructibleGraph concept describes the interface for
 graph types that can be constructed using a kind of edge iterator. The
 edge iterator can be any <a
-href="http://www.boost.org/sgi/stl/InputIterator.html">InputIterator</a>
+href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</a>
 that dereferences to a pair of integers <i>(i,j)</i>, which represent
 an edge that should be in the graph. The two integers <i>i</i> and
 <i>j</i> represent vertices where <i>0 <= i < |V|</i> and <i>0 <= j <
@@ -44,20 +44,20 @@ the second constructor can be more efficient than the first.
 The following exampe creates two graph objects from an array of edges
 (vertex pairs). The type <tt>Edge*</tt> satisfies the requirements for
 an <a
-href="http://www.boost.org/sgi/stl/InputIterator.html">InputIterator</a>
+href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</a>
 and can therefore be used to construct a graph.

 <pre>
  typedef ... IteratorConstructibleGraph;
  typedef boost::graph_traits<IteratorConstructibleGraph> Traits;

-  typedef std::pair<Traits::vertices_size_type,
+  typedef std::pair<Traits::vertices_size_type, 
    Traits::vertices_size_type> Edge;
  Edge edge_array[] =
    { Edge(0,1), Edge(0,2), Edge(0,3), Edge(0,4), Edge(0,5),
      Edge(1, 2), Edge(1,5), Edge(1,3),
      Edge(2, 4), Edge(2,5),
-      Edge(3, 2),
+      Edge(3, 2), 
      Edge(4, 3), Edge(4,1),
      Edge(5, 4) };
  Edge* first = edge_array,
@@ -65,7 +65,7 @@ and can therefore be used to construct a graph.

  IteratorConstructibleGraph G1(first, last);
  // do something with G1 ...
-
+  
  Traits::vertices_size_type size_V = 6;
  Traits::edges_size_type size_E = sizeof(edge_array)/sizeof(Edge);
  IteratorConstructibleGraph G2(first, last, size_V, size_E);
@@ -152,10 +152,10 @@ constructor lacking the graph size information.
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,99 +0,0 @@
-<!DOCTYPE html>
-<!--
-            Copyright Daniel Trebbien 2010.
- Distributed under the Boost Software License, Version 1.0.
-   (See accompanying file LICENSE_1_0.txt or the copy at
-         http://www.boost.org/LICENSE_1_0.txt)
-->
-<html>
-<head>
-<title>KeyedUpdatableQueue</title>
-</head>
-<body>
-<img src="../../../boost.png"  alt="C++ Boost">
-
-<h2><a name="concept:KeyedUpdatableQueue">KeyedUpdatableQueue</a></h2>
-
-<p>A <i>KeyedUpdatableQueue</i> is a refinement of the <a href="./UpdatableQueue.html">UpdatableQueue</a> concept.
-It requires that models order the contained values by their <i>keys</i>, to which
-values are mapped via a read/write key map.
-
-<h3>Notation</h3>
-
-<table>
-<tr> <td> <tt>Q</tt> </td>  <td> is a type that models KeyedUpdatableQueue.       </td></tr>
-<tr> <td> <tt>T</tt> </td>  <td> is the value type of <tt>Q</tt>. </td></tr>
-</table>
-
-
-<h3>Members</h3>
-
-For a type to model the KeyedUpdatableQueue concept it must have the following members
-in addition to the members that are required of types that model <a href="./UpdatableQueue.html">UpdatableQueue</a>:
-
-<p>
-
-<table border="1">
-
-<tr> <td><b>Member</b></td> <td><b>Description</b></td> </tr>
-
-<tr> <td> <tt>key_type</tt> </td>
-     <td> The type of keys that are associated with values </td>
-     </tr>
-
-<tr> <td> <tt>key_map</tt> </td>
-     <td> The key property map type. This type must model <a href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write Property Map</a>. </td>
-     </tr>
-
-<tr> <td> <tt>key_map keys() const</tt> </td>
-     <td> Returns the key map </td>
-     </tr>
-
-</table>
-
-<h3>Concept Checking Class</h3>
-
-<p><a href="../../../boost/graph/buffer_concepts.hpp"><tt>boost/graph/buffer_concepts.hpp</tt></a>
-
-<pre>
-  template &lt;class Q&gt;
-  struct KeyedUpdatableQueueConcept
-  {
-    typedef typename Q::key_type key_type;
-    typedef typename Q::key_map key_map;
-
-    void constraints() {
-      BOOST_CONCEPT_ASSERT(( UpdatableQueue&lt;Q&gt; ));
-      BOOST_CONCEPT_ASSERT(( ReadWritePropertyMap&lt; key_map, typename Buffer&lt;Q&gt;::value_type &gt; ));
-    }
-
-    void const_constraints(const Q&amp; cq) {
-      km = cq.keys();
-      k = get(km, g_ct);
-    }
-
-    static const typename Buffer&lt;Q&gt;::value_type g_ct;
-    key_type k;
-    key_map km;
-    Q q;
-  };
-</pre>
-
-<h3>Models</h3>
-
-<ul>
-<li><tt>boost::d_ary_heap_indirect</tt></a>
-</ul>
-
-<br>
-<hr>
-<table>
-<tr>
-<td>Copyright&nbsp;&copy;&nbsp;2010</td>
-<td>Daniel Trebbien (<a href="mailto:dtrebbien@gmail.com">dtrebbien@gmail.com</a>)
-</td>
-</tr>
-</table>
-
-</body>
-</html>
@@ -41,7 +41,7 @@ RESULT		= pdf
 	epstopdf $*.eps

 .dot.eps:
-	dot -Tps -o $*.eps $*.dot
+	dot -Tps -o $*.eps $*.dot 

 .w.tex: /afs/nd.edu/user11/jsiek/.jweb
 	jweb -np $*.w
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2001
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Monoid</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -33,7 +33,7 @@ The element type must be a model of <a
 href="../../utility/Assignable.html">Assignable</a> and <a
 href="../../utility/CopyConstructible.html">CopyConstructible</a>.
 The function object type must be a model of <a
-href="http://www.boost.org/sgi/stl/BinaryFunction.html">BinaryFunction</a>.
+href="http://www.sgi.com/tech/stl/BinaryFunction.html">BinaryFunction</a>.

 <h3>Notation</h3>

@@ -113,10 +113,10 @@ Return type: <TT>bool</TT>
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>MutableGraph</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -58,8 +58,8 @@ edges and vertices.
 <TR>
 <TD><tt>p</tt></TD>
 <TD>is an object of a type that models <a
-href="http://www.boost.org/sgi/stl/Predicate.html">Predicate</a>
-and whose argument type matches the <tt>edge_descriptor</tt> type.
+href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>
+and whose argument type matches the <tt>edge_descriptor</tt> type. 
 </TR>

 </table>
@@ -250,7 +250,7 @@ is no longer a valid vertex descriptor.
  struct MutableIncidenceGraphConcept
  {
    void constraints() {
-      BOOST_CONCEPT_ASSERT(( MutableGraph&lt;G&gt; ));
+      function_requires&lt; MutableGraph&lt;G&gt; &gt;();
      remove_edge(iter, g);
      remove_out_edge_if(u, p, g);
    }
@@ -265,7 +265,7 @@ is no longer a valid vertex descriptor.
  struct MutableBidirectionalGraphConcept
  {
    void constraints() {
-      BOOST_CONCEPT_ASSERT(( MutableIncidenceGraph&lt;G&gt; ));
+      function_requires&lt; MutableIncidenceGraph&lt;G&gt; &gt;();
      remove_in_edge_if(u, p, g);
    }
    G g;
@@ -278,7 +278,7 @@ is no longer a valid vertex descriptor.
  struct MutableEdgeListGraphConcept
  {
    void constraints() {
-      BOOST_CONCEPT_ASSERT(( MutableGraph&lt;G&gt; ));
+      function_requires&lt; MutableGraph&lt;G&gt; &gt;();
      remove_edge_if(p, g);
    }
    G g;
@@ -296,4 +296,4 @@ is no longer a valid vertex descriptor.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>MutablePropertyGraph</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -125,7 +125,7 @@ Return type: <TT>vertex_descriptor</TT>
  {
    typedef typename boost::graph_traits&lt;G&gt;::edge_descriptor edge_descriptor;
    void constraints() {
-      BOOST_CONCEPT_ASSERT(( MutableGraphConcept&lt;G&gt; ));
+      function_requires&lt; MutableGraphConcept&lt;G&gt; &gt;();
      v = add_vertex(vp, g);
      p = add_edge(u, v, ep, g);
    }
@@ -147,4 +147,4 @@ Return type: <TT>vertex_descriptor</TT>
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,18 +1,18 @@
 <html><head><!-- Copyright 2007 Aaron Windsor
-
+     
     Distributed under 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)
-
+    
  -->
 <title>Planar Embedding Concept</title>
 </head>
-<body alink="#ff0000"
-      bgcolor="#ffffff"
-      link="#0000ee"
-      text="#000000"
-      vlink="#551a8b">
-<img src="../../../boost.png" alt="C++ Boost" height="86" width="277">
+<body alink="#ff0000" 
+      bgcolor="#ffffff" 
+      link="#0000ee" 
+      text="#000000" 
+      vlink="#551a8b"> 
+<img src="../../../boost.png" alt="C++ Boost" height="86" width="277"> 

 <br clear="">

@@ -21,12 +21,12 @@

 A planar embedding is an important intermediate representation of a drawing
 of a planar graph. Instead of specifying the absolute positions of the vertices
-and edges in the plane, a planar embedding specifies their positions relative
-to one another. A planar embedding consists of a sequence, for each vertex in
-the graph, of all of the edges incident on that vertex in the order in which
+and edges in the plane, a planar embedding specifies their positions relative 
+to one another. A planar embedding consists of a sequence, for each vertex in 
+the graph, of all of the edges incident on that vertex in the order in which 
 they are to be drawn around that vertex.
 <p>
-A planar embedding is a refinement of
+A planar embedding is a refinement of 
 <a href="../../property_map/doc/LvaluePropertyMap.html">LValuePropertyMap</a> that
 places additional restrictions the <tt>value_type</tt> used in the property
 map.
@@ -36,24 +36,24 @@ map.
 <table>
 <tbody>

-<tr>
-<td> <tt>Embedding</tt> </td>
+<tr> 
+<td> <tt>Embedding</tt> </td>  
 <td> is a type that models the Planar Embedding concept.</td>
 </tr>

-<tr>
+<tr> 
 <td> <tt>embedding</tt> </td>
 <td> is an object of type <tt>Embedding</tt>. </td>
 </tr>

-<tr>
-<td> <tt>Graph</tt> </td>
+<tr> 
+<td> <tt>Graph</tt> </td>  
 <td> is the type of the underlying graph.</td>
 </tr>

-<tr>
-<td> <tt>e</tt> </td>
-<td> is an object of type <tt>graph_traits&lt;Graph&gt;::edge_descriptor</tt>.
+<tr> 
+<td> <tt>e</tt> </td>  
+<td> is an object of type <tt>graph_traits&lt;Graph&gt;::edge_descriptor</tt>. 
 </td>
 </tr>

@@ -63,7 +63,7 @@ map.
 </tt>.</td>

 </tr><tr>
-<td>
+<td> 

 </td></tr></tbody></table>

@@ -72,12 +72,12 @@ map.

 <table border="1">

-<tbody><tr>
+<tbody><tr> 
 <td> Const Iterator  </td>
 <td> <tt>boost::property_traits&lt;Embedding&gt;::value_type::const_iterator
 </tt>
 </td>
-<td> The iterator type used to iterate over the ordering of the edges in the
+<td> The iterator type used to iterate over the ordering of the edges in the 
 planar embedding of a particular vertex
 </td>
 </tr>
@@ -92,32 +92,32 @@ planar embedding of a particular vertex

 <tbody><tr><th>Expression</th><th>Return Type</th><th>Description</th>

-</tr><tr>
+</tr><tr> 
 <td> <tt>embedding[v].begin()</tt>  </td>
 <td> <tt>boost::property_traits&lt;Embedding&gt;::value_type::const_iterator
     </tt></td>
-<td> Returns an iterator to the beginning of the range of edges in the
+<td> Returns an iterator to the beginning of the range of edges in the 
     embedding around vertex v</td>
 </tr>

-<tr>
+<tr> 
 <td> <tt>embedding[v].end()</tt>  </td>
 <td> <tt>boost::property_traits&lt;Embedding&gt;::value_type::const_iterator
     </tt></td>
-<td> Returns an iterator to the end of the range of edges in the
+<td> Returns an iterator to the end of the range of edges in the 
     embedding around vertex v</td>
 </tr>

-<tr>
+<tr> 
 <td> <tt>embedding[v].clear()</tt>  </td>
 <td> <tt>void</tt></td>
 <td> Clears all edges in the embedding around a vertex <tt>v</tt></td>
 </tr>

-<tr>
+<tr> 
 <td> <tt>embedding[v].push_back(e)</tt>  </td>
 <td> <tt>void</tt></td>
-<td> Adds an edge <tt>e</tt> to the end of the sequence of embedded edges
+<td> Adds an edge <tt>e</tt> to the end of the sequence of embedded edges 
     around the vertex <tt>v</tt> </td>
 </tr>

@@ -126,12 +126,12 @@ planar embedding of a particular vertex
 </p><h3>Complexity Guarantees</h3>

 Starting with an empty embedding, any mixed sequence of <i>n</i> calls to a
-particular vertex's <tt>push_back</tt> and <tt>clear</tt> should take
+particular vertex's <tt>push_back</tt> and <tt>clear</tt> should take 
 <i>O(n)</i> time.

 <h3>Models</h3>

-Any LValue property map that maps vertices to a <tt>std::vector</tt>,
+Any LValue property map that maps vertices to a <tt>std::vector</tt>, 
 <tt>std::list</tt>, or <tt>std::deque</tt> models this
 concept. Below is an example of using this approach to create a model of
 PlanarEmbedding:
@@ -146,7 +146,7 @@ PlanarEmbedding:
 // an instance of Graph in a variable g.

 // A typedef for the storage - a vector of vectors of edge descriptors
-typedef
+typedef 
    std::vector&lt; std::vector&lt; graph_traits&lt;Graph&gt;::edge_descriptor &gt; &gt;
    planar_embedding_storage_t;

@@ -173,6 +173,6 @@ planar_embedding_t planar_embedding(planar_embedding_storage.begin(),
 <br>
 </p><hr>
 Copyright © 2007 Aaron Windsor (<a href="mailto:aaron.windsor@gmail.com">
-aaron.windsor@gmail.com</a>)
+aaron.windsor@gmail.com</a>) 

 </body></html>
@@ -1,28 +1,28 @@
 <HTML>
 <!-- Copyright 2007 Aaron Windsor
-
+     
     Distributed under 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)
-
+    
  -->
 <HEAD>
 <TITLE>Planar Face Visitor Concept</TITLE>
 </HEAD>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

 <H1>Planar Face Visitor Concept</H1>

-This concept defines the visitor interface for
-<a href="./planar_face_traversal.html"><tt>planar_face_traversal</tt></a>.
-Users can define a class with the Planar Face Visitor interface and pass an
-object of the class to <tt>planar_face_traversal</tt>, thereby augmenting the
-actions taken during the traversal. Note that objects passed to
+This concept defines the visitor interface for 
+<a href="./planar_face_traversal.html"><tt>planar_face_traversal</tt></a>. 
+Users can define a class with the Planar Face Visitor interface and pass an 
+object of the class to <tt>planar_face_traversal</tt>, thereby augmenting the 
+actions taken during the traversal. Note that objects passed to 
 <tt>planar_face_traversal</tt> are passed by reference.

 <h3>Notation</h3>
@@ -79,8 +79,8 @@ This is invoked once per traversal, before the traversal begins.
 <td><tt>vis.begin_face()</tt></td>
 <td><tt>void</tt></td>
 <td>
-This is invoked once for each face, before any vertices or edges on the face
-are visited.
+This is invoked once for each face, before any vertices or edges on the face 
+are visited. 
 </td>
 </tr>

@@ -108,7 +108,7 @@ This is invoked when an edge is encountered while traversing a face.
 <td><tt>vis.end_face()</tt></td>
 <td><tt>void</tt></td>
 <td>
-This is invoked once for each face, after all vertices and edges on the face
+This is invoked once for each face, after all vertices and edges on the face 
 are visited.
 </td>
 </tr>
@@ -129,13 +129,13 @@ This is invoked once per traversal, after the traversal ends.

 <ul>
 <li> The file <a href="../../../boost/graph/planar_face_traversal.hpp">
-<tt>planar_face_traversal.hpp</tt></a> contains a class
+<tt>planar_face_traversal.hpp</tt></a> contains a class 
 <tt>planar_face_traversal_visitor</tt> that implements empty actions for
-all event points of a Planar Face Visitor. In the case where only a few of the
+all event points of a Planar Face Visitor. In the case where only a few of the 
 event points of Planar Face Visitor need to be implemented, one can derive from
-<tt>planar_face_traversal_visitor</tt> and only implement the necessary event
+<tt>planar_face_traversal_visitor</tt> and only implement the necessary event 
 points. <li> The implementation of <a href="./make_maximal_planar.html">
-<tt>make_maximal_planar</tt></a> uses a <tt>triangulation_visitor</tt> that is
+<tt>make_maximal_planar</tt></a> uses a <tt>triangulation_visitor</tt> that is 
 a model of Planar Face Visitor.
 </li>
 </ul>
@@ -145,4 +145,4 @@ a model of Planar Face Visitor.
 Copyright &copy; 2007 Aaron Windsor (<a href="mailto:aaron.windsor@gmail.com">
 aaron.windsor@gmail.com</a>)
 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>PropertyGraph</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -22,7 +22,7 @@ PropertyGraph
 A PropertyGraph is a graph that has some property associated with each
 of the vertices or edges in the graph. As a given graph may have
 several properties associated with each vertex or edge, a tag is used
-to identify which property is being accessed.  The graph provides a
+to identity which property is being accessed.  The graph provides a
 function which returns a property map object.

 <P>
@@ -90,7 +90,7 @@ function which returns a property map object.
 <td><pre>boost::property_map&lt;G, PropertyTag&gt;::type</pre>
 The type of the property map for the property specified by
 <TT>PropertyTag</TT>.  This type must be a model of <a
-href="../../property_map/doc/ReadWritePropertyMap.html">ReadWritePropertyMap</a>
+href="../../property_map/doc/ReadWritePropertyMap.html">ReadWritePropertyMap</a> 
 with a key type the same as the graph's vertex or edge descriptor type.
 </td>
 </tr>
@@ -173,9 +173,9 @@ The <tt>get()</tt> property map function must be constant time.
    typedef typename property_map&lt;G, PropertyTag&gt;::type Map;
    typedef typename property_map&lt;G, PropertyTag&gt;::const_type const_Map;
    void constraints() {
-      BOOST_CONCEPT_ASSERT(( GraphConcept&lt;G&gt; ));
-      BOOST_CONCEPT_ASSERT(( ReadWritePropertyMapConcept&lt;Map, X&gt; ));
-      BOOST_CONCEPT_ASSERT(( ReadablePropertyMapConcept&lt;const_Map, X&gt; ));
+      function_requires&lt; GraphConcept&lt;G&gt; &gt;();
+      function_requires&lt; ReadWritePropertyMapConcept&lt;Map, X&gt; &gt;();
+      function_requires&lt; ReadablePropertyMapConcept&lt;const_Map, X&gt; &gt;();

      Map pmap = get(PropertyTag(), g);
      pval = get(PropertyTag(), g, x);
@@ -207,4 +207,4 @@ The <tt>get()</tt> property map function must be constant time.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Property</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -67,7 +67,7 @@ href="../../../boost/pending/property.hpp"><tt>boost/pending/property.hpp</tt></
 <h3>Refinement of</h3>

 <a
-href="http://www.boost.org/sgi/stl/DefaultConstructible.html">Default Constructible</a>
+href="http://www.sgi.com/tech/stl/DefaultConstructible.html">Default Constructible</a> 


 <h3>Models</h3>
@@ -114,4 +114,4 @@ type is also required to specialize
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,100 +0,0 @@
-<!DOCTYPE html>
-<!--
-            Copyright Daniel Trebbien 2010.
- Distributed under the Boost Software License, Version 1.0.
-   (See accompanying file LICENSE_1_0.txt or the copy at
-         http://www.boost.org/LICENSE_1_0.txt)
-->
-<html>
-<head>
-<title>UpdatableQueue</title>
-</head>
-<body>
-<img src="../../../boost.png"  alt="C++ Boost">
-
-<h2><a name="concept:UpdatableQueue">UpdatableQueue</a></h2>
-
-<p>An <i>UpdatableQueue</i> is a refinement of the <a href="./Buffer.html">Buffer</a> concept that additionally requires that the Buffer be updatable.
-
-<p>Implicit in the definition is an ordering of values. Though access to the order is not required, types that model UpdatableQueue must document how an object of the type orders values so that a program may change the position of a given value in the ordering. For example, an UpdatableQueue may choose to order values by using a property map, and a value <tt>v1</tt> is considered less than a value <tt>v2</tt> if <tt><nobr>get(pm, v1) &lt; get(pm, v2)</nobr></tt>. A program can update the properties of values, thus changing the order of values in the UpdatableQueue, and notify the UpdatableQueue of the specific values that have a different position in the ordering by calling the <tt>update</tt> member of the UpdatableQueue on each.
-
-<p>A program that modifies the order must notify the UpdatableQueue of values that may have different positions in the ordering since they were inserted or last updated.
-
-<h3>Notation</h3>
-
-<table>
-<tr> <td> <tt>Q</tt> </td>  <td> is a type that models UpdatableQueue.       </td></tr>
-<tr> <td> <tt>T</tt> </td>  <td> is the value type of <tt>Q</tt>. </td></tr>
-</table>
-
-
-<h3>Members</h3>
-
-For a type to model the UpdatableQueue concept it must have the following members
-in addition to the members that are required of types that model <a href="./Buffer.html">Buffer</a>:
-
-<p>
-
-<table border="1">
-
-<tr> <td><b>Member</b></td> <td><b>Description</b></td> </tr>
-
-<tr> <td> <a name="concept:UpdatableQueue:update"><tt>void update(const T& t)</tt></a> </td>
-     <td> Informs the UpdatableQueue that the program has modified the position of <tt>t</tt> in the ordering </td>
-     </tr>
-
-<tr> <td> <tt><i>unspecified-bool-type</i> contains(const T& t) const</tt> </td>
-     <td> Returns whether the queue contains <tt>t</tt> </td>
-     </tr>
-
-</table>
-
-<h3>Concept Checking Class</h3>
-
-<p><a href="../../../boost/graph/buffer_concepts.hpp"><tt>boost/graph/buffer_concepts.hpp</tt></a>
-
-<pre>
-  template &lt;class Q&gt;
-  struct UpdatableQueueConcept
-  {
-    void constraints() {
-      BOOST_CONCEPT_ASSERT(( Buffer&lt;Q&gt; ));
-
-      q.update(g_ct);
-    }
-
-    void const_constraints(const Q&amp; cq) {
-      if (cq.contains(g_ct));
-    }
-
-    static const typename Buffer&lt;Q&gt;::value_type g_ct;
-    Q q;
-  };
-</pre>
-
-<h3>Futher Refinements</h3>
-
-<ul>
-<li><a href="#concept%3AUpdatablePriorityQueue">UpdatablePriorityQueue</a>
-<li><a href="./KeyedUpdatableQueue.html">KeyedUpdatableQueue</a>
-</ul>
-
-<h2><a name="concept:UpdatablePriorityQueue">UpdatablePriorityQueue</a></h2>
-<p>An <i>UpdatablePriorityQueue</i> is a slight refinement of <a href="#concept%3AUpdatableQueue">UpdatableQueue</a>
-that imposes the requirement that a program may not increase the position of a value that is held in the queue. That is,
-if a value <tt>v</tt> had position <i>n</i> in the ordering, a program may update the position of <tt>v</tt> only to 0, 1, ..., <i>n</i>&nbsp;-&nbsp;1, or <i>n</i>, where 0 is the top of the queue.
-
-<p>The behavior when a program attempts to increase a value's position in the ordering is undefined.
-
-<br>
-<hr>
-<table>
-<tr>
-<td>Copyright&nbsp;&copy;&nbsp;2010</td>
-<td>Daniel Trebbien (<a href="mailto:dtrebbien@gmail.com">dtrebbien@gmail.com</a>)
-</td>
-</tr>
-</table>
-
-</body>
-</html>
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>VertexAndEdgeListGraph</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -27,7 +27,7 @@ requirements are added.

 <H3>Refinement of</H3>

-<a href="./VertexListGraph.html">VertexListGraph</a>,
+<a href="./VertexListGraph.html">VertexListGraph</a>, 
 <a href="./EdgeListGraph.html">EdgeListGraph</a>


@@ -51,8 +51,8 @@ requirements are added.
  struct VertexAndEdgeListGraphConcept
  {
    void constraints() {
-      BOOST_CONCEPT_ASSERT(( VertexListGraphConcept&lt;G&gt; ));
-      BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept&lt;G&gt; ));
+      function_requires&lt; VertexListGraphConcept&lt;G&gt; &gt;();
+      function_requires&lt; EdgeListGraphConcept&lt;G&gt; &gt;();
    }
  };
 </PRE>
@@ -67,4 +67,4 @@ requirements are added.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>VertexListGraph</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -118,12 +118,12 @@ groups these requirements together, hence the VertexListGraph concept.
  template &lt;class G&gt;
  struct VertexListGraphConcept
  {
-    typedef typename boost::graph_traits&lt;G&gt;::vertex_iterator
+    typedef typename boost::graph_traits&lt;G&gt;::vertex_iterator 
      vertex_iterator;
    void constraints() {
-      BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept&lt;G&gt; ));
-      BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept&lt;G&gt; ));
-      BOOST_CONCEPT_ASSERT(( MultiPassInputIteratorConcept&lt;vertex_iterator&gt; ));
+      function_requires&lt; IncidenceGraphConcept&lt;G&gt; &gt;();
+      function_requires&lt; AdjacencyGraphConcept&lt;G&gt; &gt;();
+      function_requires&lt; MultiPassInputIteratorConcept&lt;vertex_iterator&gt; &gt;();

      p = vertices(g);
      V = num_vertices(g);
@@ -151,4 +151,4 @@ groups these requirements together, hence the VertexListGraph concept.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2001
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Vertex Mutable Graph</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -28,7 +28,7 @@ implementation does the rest.
 <H3>Refinement of</H3>

 <a href="./Graph.html">Graph</a> and <a
-href="http://www.boost.org/sgi/stl/DefaultConstructible.html">DefaultConstructible</a>
+href="http://www.sgi.com/tech/stl/DefaultConstructible.html">DefaultConstructible</a>

 <H3>Associated Types</H3>

@@ -37,7 +37,7 @@ No additional associated types.
 <h3>Valid Expressions</h3>

 <ul>
-<li><a name="sec:add_vertex"><TT>add_vertex(g)</TT></a>
+<li><a name="sec:add_vertex"><TT>add_vertex(g)</TT></a> 
 <b>returns</b> <TT>vertex_descriptor</TT>
 <br><br>

@@ -56,7 +56,7 @@ No additional associated types.
 <br>
 <b> Postconditions: </b> <TT>num_vertices(g)</TT> is one less; <i>u</i>
      no longer appears in the vertex set of the graph and it
-      is no longer a valid vertex descriptor.
+      is no longer a valid vertex descriptor. 
 </li>

 </ul>
@@ -64,7 +64,7 @@ No additional associated types.
 <H3>Complexity guarantees</H3>
 <ul>
  <li> Vertex insertion is guaranteed to be amortized constant time.
-
+ 
  <li> Vertex removal is at most <TT>O(|E| + |V|)</TT>.
 </ul>

@@ -79,5 +79,5 @@ No additional associated types.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 

@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Acknowledgements</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -67,10 +67,10 @@ Science of the U.S. Department of Energy.
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,7 +1,7 @@
 <html>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
@@ -115,7 +115,7 @@ href="../../utility/MultiPassInputIterator.html">Multi-Pass Input Iterator</a>

 The adjacency iterator type implements the member functions and
 operators required of the <a
-href="http://www.boost.org/sgi/stl/RandomAccessIterator.html">Random Access Iterator</a>
+href="http://www.sgi.com/tech/stl/RandomAccessIterator.html">Random Access Iterator</a>
 concept, except that the <tt>reference</tt> type is the same as the <tt>value_type</tt>
 so <tt>operator*()</tt> returns by-value. In addition it has the following constructor:

@@ -1,7 +1,7 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
@@ -37,7 +37,7 @@ href="#fig:adj-list-graph">Figure 1</a> shows an adjacency list
 representation of a directed graph.

 <P></P>
-<DIV ALIGN="center"><A NAME="fig:adj-list-graph"></A>
+<DIV ALIGN="center"><A NAME="fig:adj-list-graph"></A><A NAME="1509"></A>
 <TABLE>
 <CAPTION ALIGN="BOTTOM"><STRONG>Figure 1:</STRONG> Adjacency List Representation of a Directed Graph.</CAPTION>
 <TR><TD><IMG SRC="./figs/adj-matrix-graph2.gif" width="386" height="284"></TD>
@@ -67,7 +67,7 @@ href="#fig:undir-adj-list-graph">Figure 2</a> shows an adjacency list
 representation of an undirected graph.

 <P></P>
-<DIV ALIGN="center"><A NAME="fig:undir-adj-list-graph"></A>
+<DIV ALIGN="center"><A NAME="fig:undir-adj-list-graph"></A><A NAME="1509"></A>
 <TABLE>
 <CAPTION ALIGN="BOTTOM"><STRONG>Figure 2:</STRONG> Adjacency List Representation of an Undirected Graph.</CAPTION>
 <TR><TD><IMG SRC="./figs/undir-adj-matrix-graph2.gif" width="260" height="240"></TD>
@@ -86,7 +86,7 @@ Section <A HREF="./using_adjacency_list.html">Using

 <P>
 The example in <a
-href="../example/family_tree.cpp"><tt>examples/family_tree.cpp</tt></a>
+href="../example/family-tree-eg.cpp"><tt>examples/family-tree-eg.cpp</tt></a>
 shows how to represent a family tree with a graph.

 <H3>Template Parameters</H3>
@@ -214,12 +214,12 @@ example, the following code will result in undefined (bad) behavior:

  <b>// Attempt to remove all the vertices. Wrong!</b>
  graph_traits&lt;Graph&gt;::vertex_iterator vi, vi_end;
-  for (boost::tie(vi, vi_end) = vertices(G); vi != vi_end; ++vi)
+  for (tie(vi, vi_end) = vertices(G); vi != vi_end; ++vi)
    remove_vertex(*vi, G);

  <b>// Remove all the vertices. This is still wrong!</b>
  graph_traits&lt;Graph&gt;::vertex_iterator vi, vi_end, next;
-  boost::tie(vi, vi_end) = vertices(G);
+  tie(vi, vi_end) = vertices(G);
  for (next = vi; vi != vi_end; vi = next) {
    ++next;
    remove_vertex(*vi, G);
@@ -247,12 +247,12 @@ actual vertex that was removed. The following code demonstrates this.

  <b>// Attempt to remove all the vertices. Wrong!</b>
  graph_traits&lt;Graph&gt;::vertex_iterator vi, vi_end;
-  for (boost::tie(vi, vi_end) = vertices(G); vi != vi_end; ++vi)
+  for (tie(vi, vi_end) = vertices(G); vi != vi_end; ++vi)
    remove_vertex(*vi, G);

  <b>// Remove all the vertices. This is OK.</b>
  graph_traits&lt;Graph&gt;::vertex_iterator vi, vi_end, next;
-  boost::tie(vi, vi_end) = vertices(G);
+  tie(vi, vi_end) = vertices(G);
  for (next = vi; vi != vi_end; vi = next) {
    ++next;
    remove_vertex(*vi, G);
@@ -281,7 +281,7 @@ vertex descriptors have become invalid, the result is incorrect.
  remove_vertex(s, G); <b>// Bad idea! Invalidates vertex descriptors in parent vector.</b>

  <b>// The following will produce incorrect results</b>
-  for(boost::tie(vi, vend) = vertices(G); vi != vend; ++vi)
+  for(tie(vi, vend) = vertices(G); vi != vend; ++vi)
    std::cout << p[*vi] << " is the parent of " << *vi << std::endl;
 </pre>

@@ -397,9 +397,9 @@ The type for the iterators returned by <TT>vertices()</TT>.

 When <tt>VertexList=vecS</tt> then the <tt>vertex_iterator</tt> models
 <a
-href="http://www.boost.org/sgi/stl/RandomAccessIterator.html">RandomAccessIterator</a>. Otherwise
+href="http://www.sgi.com/tech/stl/RandomAccessIterator.html">RandomAccessIterator</a>. Otherwise
 the <tt>vertex_iterator</tt> models <a
-href="http://www.boost.org/sgi/stl/BidirectionalIterator.html">BidirectionalIterator</a>.
+href="http://www.sgi.com/tech/stl/BidirectionalIterator.html">BidirectionalIterator</a>.

 <hr>

@@ -407,7 +407,7 @@ href="http://www.boost.org/sgi/stl/BidirectionalIterator.html">BidirectionalIter
 <br><br>
 The type for the iterators returned by <TT>edges()</TT>.
 The <tt>edge_iterator</tt> models <a
-href="http://www.boost.org/sgi/stl/BidirectionalIterator.html">BidirectionalIterator</a>.
+href="http://www.sgi.com/tech/stl/BidirectionalIterator.html">BidirectionalIterator</a>.


 <hr>
@@ -418,13 +418,13 @@ href="http://www.boost.org/sgi/stl/BidirectionalIterator.html">BidirectionalIter

 The type for the iterators returned by <TT>out_edges()</TT>.
 When <tt>OutEdgeList=vecS</tt> then the <tt>out_edge_iterator</tt> models
-<a href="http://www.boost.org/sgi/stl/RandomAccessIterator.html">
+<a href="http://www.sgi.com/tech/stl/RandomAccessIterator.html">
 RandomAccessIterator</a>.  When <tt>OutEdgeList=slistS</tt> then the
 <tt>out_edge_iterator</tt> models <a
-href="http://www.boost.org/sgi/stl/ForwardIterator.html">
+href="http://www.sgi.com/tech/stl/ForwardIterator.html">
 ForwardIterator</a>.  Otherwise the <tt>out_edge_iterator</tt> models
 <a
-href="http://www.boost.org/sgi/stl/BidirectionalIterator.html">
+href="http://www.sgi.com/tech/stl/BidirectionalIterator.html">
 BidirectionalIterator</a>.

 <hr>
@@ -459,7 +459,7 @@ and<br>
 <br><br>
 This describes whether the graph class allows the insertion of
 parallel edges (edges with the same source and target). The two tags
-are <TT>allow_parallel_edge_tag</TT> and
+are <TT>allow_parallel_edge-_tag</TT> and
 <TT>disallow_parallel_edge_tag</TT>. The
 <TT>setS</TT> and <TT>hash_setS</TT> variants disallow
 parallel edges while the others allow parallel edges.
@@ -474,9 +474,9 @@ The type used for dealing with the number of vertices in the graph.

 <hr>

-<tt>graph_traits&lt;adjacency_list&gt;::edges_size_type</tt><br>
+<tt>graph_traits&lt;adjacency_list&gt;::edge_size_type</tt><br>
 and<br>
-<tt>adjacency_list_traits&lt;OutEdgeList, VertexList, Directed_list, EdgeList&gt;::edges_size_type</tt><br>
+<tt>adjacency_list_traits&lt;OutEdgeList, VertexList, Directed_list, EdgeList&gt;::edge_size_type</tt><br>
 <br><br>
 The type used for dealing with the number of edges in the graph.

@@ -578,7 +578,7 @@ adjacency_list(EdgeIterator&nbsp;first, EdgeIterator&nbsp;last,
 Creates a graph object with <TT>n</TT> vertices and with the edges
 specified in the edge list given by the range <TT>[first, last)</TT>.
 The <tt>EdgeIterator</tt> must be a model of <a
-href="http://www.boost.org/sgi/stl/InputIterator.html">InputIterator</a>.
+href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</a>.
 The value type of the <TT>EdgeIterator</TT> must be a
 <TT>std::pair</TT>, where the type in the pair is an integer type. The
 integers will correspond to vertices, and they must all fall in the
@@ -599,7 +599,7 @@ Creates a graph object with <TT>n</TT> vertices and with the edges
 specified in the edge list given by the range <TT>[first, last)</TT>.
 The <tt>EdgeIterator</tt> and <tt>EdgePropertyIterator</tt> must be a
 model of <a
-href="http://www.boost.org/sgi/stl/InputIterator.html">InputIterator</a>.
+href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</a>.
 The value type of the <TT>EdgeIterator</TT> must be a
 <TT>std::pair</TT>, where the type in the pair is an integer type. The
 integers will correspond to vertices, and they must all fall in the
@@ -763,10 +763,8 @@ std::pair&lt;edge_descriptor, bool&gt;
 edge(vertex_descriptor&nbsp;u, vertex_descriptor&nbsp;v,
     const&nbsp;adjacency_list&amp;&nbsp;g)
 </pre>
-If an edge from vertex <tt>u</tt> to vertex <tt>v</tt> exists, return a pair
-containing one such edge and <tt>true</tt>.  If there are no edges between
-<tt>u</tt> and <tt>v</tt>, return a pair with an arbitrary edge descriptor and
-<tt>false</tt>.
+Returns an edge connecting vertex <tt>u</tt> to vertex <tt>v</tt> in
+graph <tt>g</tt>.

 <hr>

@@ -836,7 +834,7 @@ add_edge(vertex_descriptor&nbsp;u, vertex_descriptor&nbsp;v,
 </pre>
 Adds edge <i>(u,v)</i> to the graph and attaches <TT>p</TT> as the
 value of the edge's internal property storage.  Also see the previous
-<TT>add_edge()</TT> non-member function for more details.
+<TT>add_edge()</TT> member function for more details.

 <hr>

@@ -884,7 +882,7 @@ has time complexity <i>O(E/V)</i>.
 <hr>

 <pre>
-template &lt;class <a href="http://www.boost.org/sgi/stl/Predicate.html">Predicate</a>&gt;
+template &lt;class <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>&gt;
 void remove_out_edge_if(vertex_descriptor u, Predicate predicate,
                        adjacency_list&amp; g)
 </pre>
@@ -899,7 +897,7 @@ invoking <tt>remove_edge()</tt> on each of the removed edges.

 <pre>
 template &lt;class <a
-href="http://www.boost.org/sgi/stl/Predicate.html">Predicate</a>&gt;
+href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>&gt;
 void remove_in_edge_if(vertex_descriptor v, Predicate predicate,
                       adjacency_list&amp; g)
 </pre>
@@ -917,7 +915,7 @@ This operation is available for undirected and bidirectional
 <hr>

 <pre>
-template &lt;class <a href="http://www.boost.org/sgi/stl/Predicate.html">Predicate</a>&gt;
+template &lt;class <a href="http://www.sgi.com/tech/stl/Predicate.html">Predicate</a>&gt;
 void remove_edge_if(Predicate predicate, adjacency_list&amp; g)
 </pre>
 Removes all edges from the graph that satisfy
@@ -1127,7 +1125,7 @@ Include <a href="../../../boost/graph/adj_list_serialize.hpp"><tt>boost/graph/ad
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Graph Traits</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -79,8 +79,8 @@ The selector type whether the graph is directed or undirected.
 <h3>Model of</h3>

 <a
-href="http://www.boost.org/sgi/stl/DefaultConstructible.html">DefaultConstructible</a> and
-<a href="http://www.boost.org/sgi/stl/Assignable.html">Assignable</a>
+href="http://www.sgi.com/tech/stl/DefaultConstructible.html">DefaultConstructible</a> and
+<a href="http://www.sgi.com/tech/stl/Assignable.html">Assignable</a>

 <h3>Type Requirements</h3>

@@ -149,10 +149,10 @@ parallel edges (<tt>disallow_parallel_edge_tag</tt>).
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,23 +1,23 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Adjacency Matrix</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

 <H1><A NAME="sec:adjacency-matrix-class"></A>
 <pre>
-adjacency_matrix&lt;Directed, VertexProperty,
+adjacency_matrix&lt;Directed, VertexProperty, 
                 EdgeProperty, GraphProperty,
                 Allocator&gt;
 </pre>
@@ -32,7 +32,7 @@ href="#fig:adj-matrix-graph">Figure 1</a> shows the adjacency matrix
 representation of a graph.

 <P></P>
-<DIV ALIGN="center"><A NAME="fig:adj-matrix-graph"></A>
+<DIV ALIGN="center"><A NAME="fig:adj-matrix-graph"></A><A NAME="1509"></A>
 <TABLE>
 <CAPTION ALIGN="BOTTOM"><STRONG>Figure 1:</STRONG> Adjacency Matrix Representation of a Directed Graph.</CAPTION>
 <TR><TD><IMG SRC="./figs/adj-matrix-graph3.gif" width="386" height="284"></TD>
@@ -61,7 +61,7 @@ href="adjacency_list.html"><tt>adjacency_list</tt></a>. These may be
 <a
 href="using_adjacency_list.html#sec:adjacency-list-properties">interior
 properties</a>. The types of all property values must be
-Copy Constructible, Assignable and Default Constructible.
+Copy Constructible, Assignable and Default Constructible. 

 In the case of an undirected graph, the
 <tt>adjacency_matrix</tt>. class does not use a full <i>V x V</i>
@@ -72,9 +72,9 @@ href="#fig:undir-adj-matrix-graph">Figure 2</a> shows an adjacency
 matrix representation of an undirected graph.

 <P></P>
-<DIV ALIGN="center"><A NAME="fig:undir-adj-matrix-graph"></A>
+<DIV ALIGN="center"><A NAME="fig:undir-adj-matrix-graph"></A><A NAME="1509"></A>
 <TABLE>
-<CAPTION ALIGN="BOTTOM"><STRONG>Figure 2:</STRONG> Adjacency Matrix Representation of an Undirected Graph.</CAPTION>
+<CAPTION ALIGN="BOTTOM"><STRONG>Figure 1:</STRONG> Adjacency Matrix Representation of an Undirected Graph.</CAPTION>
 <TR><TD><IMG SRC="./figs/undir-adj-matrix-graph3.gif" width="260" height="240"></TD>
 <TD><IMG SRC="./figs/undir-adj-matrix2.gif" width="135" height="136"></TD></TR>
 </TABLE>
@@ -83,11 +83,11 @@ matrix representation of an undirected graph.

 <h3>Example</h3>

-Creating the graph of <a href="#fig:adj-matrix-graph">Figure 1</a>.
+Creating the graph of <a href="#fig:adj-matrix-graph">Figure 1</a>. 
 <pre>
  enum { A, B, C, D, E, F, N };
  const char* name = "ABCDEF";
-
+  
  typedef boost::adjacency_matrix&lt;boost::directedS> Graph;
  Graph g(N);
  add_edge(B, C, g);
@@ -112,17 +112,17 @@ Creating the graph of <a href="#fig:adj-matrix-graph">Figure 1</a>.
 </pre>
 The output is:
 <pre>
-  vertex set: A B C D E F
+  vertex set: A B C D E F 

-  edge set: (B,C) (B,F) (C,A) (C,C) (D,E) (E,D) (F,A)
+  edge set: (B,C) (B,F) (C,A) (C,C) (D,E) (E,D) (F,A) 

-  out-edges:
-  A -->
-  B --> C F
-  C --> A C
-  D --> E
-  E --> D
-  F --> A
+  out-edges: 
+  A --> 
+  B --> C F 
+  C --> A C 
+  D --> E 
+  E --> D 
+  F --> A 
 </pre>

 Creating the graph of <a href="#fig:undir-adj-matrix-graph">Figure 2</a>.
@@ -152,17 +152,17 @@ Creating the graph of <a href="#fig:undir-adj-matrix-graph">Figure 2</a>.
 </pre>
 The output is:
 <pre>
-  vertex set: A B C D E F
+  vertex set: A B C D E F 

-  edge set: (C,A) (C,B) (E,D) (F,A) (F,B)
+  edge set: (C,A) (C,B) (E,D) (F,A) (F,B) 

-  incident edges:
-  A &lt;--> C F
-  B &lt;--> C F
-  C &lt;--> A B
-  D &lt;--> E
-  E &lt;--> D
-  F &lt;--> A B
+  incident edges: 
+  A &lt;--> C F 
+  B &lt;--> C F 
+  C &lt;--> A B 
+  D &lt;--> E 
+  E &lt;--> D 
+  F &lt;--> A B 
 </pre>


@@ -205,7 +205,7 @@ The output is:

 <h3>Model Of</h3>

-<a href="./VertexAndEdgeListGraph.html">VertexAndEdgeListGraph</a>,
+<a href="./VertexAndEdgeListGraph.html">VertexAndEdgeListGraph</a>, 
 <a href="./IncidenceGraph.html">Incidence Graph</a>,
 <a href="./BidirectionalGraph.html">Bidirectional Graph</a>,
 <a
@@ -236,8 +236,8 @@ The type for the edge descriptors associated with the
 <hr>
 <tt>graph_traits&lt;adjacency_matrix&gt;::vertex_iterator</tt>
 <br><br>
-  The type for the iterators returned by <tt>vertices()</tt>.
-  The vertex iterator models <a href="http://www.boost.org/sgi/stl/RandomAccessIterator.html">RandomAccessIterator</a>. <br>
+  The type for the iterators returned by <tt>vertices()</tt>.  
+  The vertex iterator models <a href="http://www.sgi.com/tech/stl/RandomAccessIterator.html">RandomAccessIterator</a>. <br>
 (Required by <a href="VertexListGraph.html">VertexListGraph</a>.)

 <hr>
@@ -420,7 +420,7 @@ degree_size_type
 out_degree(vertex_descriptor u, const adjacency_matrix&amp; g)
 </pre>
 Returns the number of edges leaving vertex <tt>u</tt>.<br>
-(Required by <a href="IncidenceGraph.html">IncidenceGraph</a>.)
+(Required by <a href="IncidenceGraph.html">IncidenceGraph</a>.) 
 <hr>

 <hr>
@@ -440,7 +440,7 @@ degree_size_type
 in_degree(vertex_descriptor u, const adjacency_matrix&amp; g)
 </pre>
 Returns the number of edges entering vertex <tt>u</tt>.<br>
-(Required by <a href="BidirectionalGraph.html">BidirectionalGraph</a>.)
+(Required by <a href="BidirectionalGraph.html">BidirectionalGraph</a>.) 
 <hr>

 <hr>
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) 2004 Kris Beevers
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: astar_heuristic</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -87,10 +87,10 @@ to a goal.
 <TABLE>
 <TR valign=top>
 <TD nowrap>Copyright &copy; 2004</TD><TD>
-<A HREF="http://cs.krisbeevers.com/">Kristopher Beevers</A>,
+<A HREF="http://www.cs.rpi.edu/~beevek/">Kristopher Beevers</A>,
 Rensselaer Polytechnic Institute (<A
 HREF="mailto:beevek@cs.rpi.edu">beevek@cs.rpi.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) 2004 Kris Beevers
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: A* Heuristic Search</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -22,40 +22,13 @@

 <P>
 <PRE>
-<i>// Named parameter interfaces</i>
+<i>// Named parameter interface</i>
 template &lt;typename VertexListGraph,
          typename AStarHeuristic,
          typename P, typename T, typename R&gt;
 void
 astar_search
-  (const VertexListGraph &amp;g,
-   typename graph_traits&lt;VertexListGraph&gt;::vertex_descriptor s,
-   <a href="AStarHeuristic.html">AStarHeuristic</a> h, const bgl_named_params&lt;P, T, R&gt;&amp; params);
-
-template &lt;typename VertexListGraph,
-          typename AStarHeuristic,
-          typename P, typename T, typename R&gt;
-void
-astar_search_no_init
-  (const IncidenceGraph &amp;g,
-   typename graph_traits&lt;VertexListGraph&gt;::vertex_descriptor s,
-   <a href="AStarHeuristic.html">AStarHeuristic</a> h, const bgl_named_params&lt;P, T, R&gt;&amp; params);
-
-template &lt;typename VertexListGraph,
-          typename AStarHeuristic,
-          typename P, typename T, typename R&gt;
-void
-astar_search_tree
-  (const VertexListGraph &amp;g,
-   typename graph_traits&lt;VertexListGraph&gt;::vertex_descriptor s,
-   <a href="AStarHeuristic.html">AStarHeuristic</a> h, const bgl_named_params&lt;P, T, R&gt;&amp; params);
-
-template &lt;typename VertexListGraph,
-          typename AStarHeuristic,
-          typename P, typename T, typename R&gt;
-void
-astar_search_no_init_tree
-  (const IncidenceGraph &amp;g,
+  (VertexListGraph &amp;g,
   typename graph_traits&lt;VertexListGraph&gt;::vertex_descriptor s,
   <a href="AStarHeuristic.html">AStarHeuristic</a> h, const bgl_named_params&lt;P, T, R&gt;&amp; params);

@@ -65,11 +38,11 @@ template &lt;typename VertexListGraph, typename AStarHeuristic,
          typename CostMap, typename DistanceMap,
          typename WeightMap, typename VertexIndexMap,
 	  typename ColorMap,
-          typename <a href="http://www.boost.org/sgi/stl/BinaryPredicate.html">CompareFunction</a>, typename <a href="http://www.boost.org/sgi/stl/BinaryFunction.html">CombineFunction</a>,
+          typename <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">CompareFunction</a>, typename <a href="http://www.sgi.com/tech/stl/BinaryFunction.html">CombineFunction</a>,
          typename CostInf, typename CostZero&gt;
 inline void
 astar_search
-  (const VertexListGraph &amp;g,
+  (VertexListGraph &amp;g,
   typename graph_traits&lt;VertexListGraph&gt;::vertex_descriptor s,
   AStarHeuristic h, AStarVisitor vis,
   PredecessorMap predecessor, CostMap cost,
@@ -78,60 +51,24 @@ astar_search
   CompareFunction compare, CombineFunction combine,
   CostInf inf, CostZero zero);

+<i>// Version that does not initialize property maps (used for implicit graphs)</i>
 template &lt;typename VertexListGraph, typename AStarHeuristic,
-          typename <a href="AStarVisitor.html">AStarVisitor</a>, typename PredecessorMap,
-          typename CostMap, typename DistanceMap,
-          typename WeightMap,
-          typename <a href="http://www.boost.org/sgi/stl/BinaryPredicate.html">CompareFunction</a>, typename <a href="http://www.boost.org/sgi/stl/BinaryFunction.html">CombineFunction</a>,
-          typename CostInf, typename CostZero&gt;
-inline void
-astar_search_tree
-  (const VertexListGraph &amp;g,
-   typename graph_traits&lt;VertexListGraph&gt;::vertex_descriptor s,
-   AStarHeuristic h, AStarVisitor vis,
-   PredecessorMap predecessor, CostMap cost,
-   DistanceMap distance, WeightMap weight,
-   CompareFunction compare, CombineFunction combine,
-   CostInf inf, CostZero zero);
-
-<i>// Versions that do not initialize property maps (used for implicit graphs)</i>
-template &lt;typename IncidenceGraph, typename AStarHeuristic,
          typename <a href="AStarVisitor.html">AStarVisitor</a>, typename PredecessorMap,
          typename CostMap, typename DistanceMap,
          typename WeightMap, typename ColorMap,
          typename VertexIndexMap,
-          typename <a href="http://www.boost.org/sgi/stl/BinaryPredicate.html">CompareFunction</a>, typename <a href="http://www.boost.org/sgi/stl/BinaryFunction.html">CombineFunction</a>,
+          typename <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">CompareFunction</a>, typename <a href="http://www.sgi.com/tech/stl/BinaryFunction.html">CombineFunction</a>,
          typename CostInf, typename CostZero&gt;
 inline void
 astar_search_no_init
-  (const IncidenceGraph &amp;g,
-   typename graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor s,
+  (VertexListGraph &amp;g,
+   typename graph_traits&lt;VertexListGraph&gt;::vertex_descriptor s,
   AStarHeuristic h, AStarVisitor vis,
   PredecessorMap predecessor, CostMap cost,
   DistanceMap distance, WeightMap weight,
   ColorMap color, VertexIndexMap index_map,
   CompareFunction compare, CombineFunction combine,
   CostInf inf, CostZero zero);
-
-<b>Note that the index_map and color parameters are swapped in
-astar_search_no_init() relative to astar_search(); the named parameter
-interfaces are not affected.</b>
-
-template &lt;typename IncidenceGraph, typename AStarHeuristic,
-          typename <a href="AStarVisitor.html">AStarVisitor</a>, typename PredecessorMap,
-          typename CostMap, typename DistanceMap,
-          typename WeightMap,
-          typename <a href="http://www.boost.org/sgi/stl/BinaryPredicate.html">CompareFunction</a>, typename <a href="http://www.boost.org/sgi/stl/BinaryFunction.html">CombineFunction</a>,
-          typename CostInf, typename CostZero&gt;
-inline void
-astar_search_no_init_tree
-  (const IncidenceGraph &amp;g,
-   typename graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor s,
-   AStarHeuristic h, AStarVisitor vis,
-   PredecessorMap predecessor, CostMap cost,
-   DistanceMap distance, WeightMap weight,
-   CompareFunction compare, CombineFunction combine,
-   CostInf inf, CostZero zero);
 </PRE>

 <P>
@@ -170,24 +107,19 @@ A* is particularly useful for searching <i>implicit</i> graphs.
 Implicit graphs are graphs that are not completely known at the
 beginning of the search.  Upon visiting a vertex, its neighbors are
 "generated" and added to the search.  Implicit graphs are particularly
-useful for searching large state spaces -- in game-playing scenarios
+useful for searching large state spaces -- in gameplaying scenarios
 (e.g. chess), for example -- in which it may not be possible to store
 the entire graph.  Implicit searches can be performed with this
 implementation of A* by creating special visitors that generate
 neighbors of newly-expanded vertices.  Please note that
-<tt>astar_search_no_init()</tt> or <tt>astar_search_no_init_tree()</tt> must be
-used for implicit graphs; the basic
+<tt>astar_search_no_init()</tt> must be used for implicit graphs; the basic
 <tt>astar_search()</tt> function requires a graph that models
-the <a href="VertexListGraph.html">Vertex List Graph</a> concept.  Both
-versions
-also require the graph type to model the <a
-href="IncidenceGraph.html">Incidence Graph</a> concept.
+<a href="VertexListGraph.html"><tt>VertexListGraph</tt></a>.
 </P>

 <P>
-For the non-tree versions of the algorithm,
-this implementation of A* is based on an OPEN/CLOSED list formulation.
-Vertices on the OPEN list have been ``discovered''
+This implementation of A* is based on an OPEN/CLOSED list formulation
+of the algorithm.  Vertices on the OPEN list have been ``discovered''
 by the algorithm, but not ``expanded'' (we have not discovered their
 adjacent vertices).  Vertices on the CLOSED list have been completely
 examined by our search (we have expanded them and added their children
@@ -198,11 +130,7 @@ avoids ``cycles'' in the state space; the search will not become
 trapped by loops in the graph.  The OPEN/CLOSED lists are implemented
 using BGL's vertex coloring mechanisms.  Vertices in OPEN are colored
 gray, vertices in CLOSED are colored black, and undiscovered vertices
-are colored white.  For the versions of the algorithm whose names end in
-<tt>_tree</tt>, all vertices are assumed to always be white, leading to
-checking for repeated vertices being done using the distance map.  If a dummy
-value is used for the distance map and the graph contains cycles, the algorithm
-will probably enter an infinite loop.
+are colored white.
 </P>

 <P>
@@ -297,21 +225,12 @@ finish vertex <i>u</i>

 <h3>Parameters</h3>

-IN: <tt>const VertexListGraph&amp; g</tt>
+IN: <tt>VertexListGraph&amp; g</tt>
 <blockquote>
-  The graph object on which the algorithm will be applied for <tt>astar_search()</tt>.  The type
+  The graph object on which the algorithm will be applied.  The type
  <tt>VertexListGraph</tt> must be a model of the <a
  href="VertexListGraph.html">
-  Vertex List Graph</a> and <a href="IncidenceGraph.html">Incidence Graph</a>
-  concepts.
-</blockquote>
-
-IN: <tt>const IncidenceGraph&amp; g</tt>
-<blockquote>
-  The graph object on which the algorithm will be applied for <tt>astar_search_no_init()</tt>.  The type
-  <tt>IncidenceGraph</tt> must be a model of the
-  <a href="IncidenceGraph.html">Incidence Graph</a>
-  concept.
+  Vertex List Graph</a> concept.
 </blockquote>

 IN: <tt>vertex_descriptor s</tt>
@@ -348,8 +267,7 @@ IN: <tt>weight_map(WeightMap w_map)</tt>
 IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt>
 <blockquote>
  This maps each vertex to an integer in the range <tt>[0,
-  num_vertices(g))</tt>.  This is necessary in non-tree versions of the
-  algorithm for efficient updates of
+  num_vertices(g))</tt>.  This is necessary for efficient updates of
  the heap data structure when an edge is relaxed.  The type
  <tt>VertexIndexMap</tt> must be a model of <a
  href="../../property_map/doc/ReadablePropertyMap.html"><tt>Readable
@@ -360,7 +278,7 @@ IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt>
  <b>Default:</b> <tt>get(vertex_index, g)</tt>.
   Note: if you use this default, make sure your graph has
   an internal <tt>vertex_index</tt> property. For example,
-   <tt>adjacency_list</tt> with <tt>VertexList=listS</tt> does
+   <tt>adjacenty_list</tt> with <tt>VertexList=listS</tt> does
   not have an internal <tt>vertex_index</tt> property.
 </blockquote>

@@ -394,14 +312,11 @@ UTIL/OUT: <tt>distance_map(DistanceMap d_map)</tt>
  href="./Monoid.html"><tt>Monoid</tt></a> formed with the
  <tt>combine</tt> function object and the zero object for the
  identity element.  Also the distance value type must have a <a
-  href="http://www.boost.org/sgi/stl/StrictWeakOrdering.html"><tt>StrictWeakOrdering</tt></a>
-  provided by the <tt>compare</tt> function object.  A
-  <tt>constant_writable_property_map</tt> returning the infinity value can be
-  used for this parameter in tree versions of the algorithm when the graph does
-  not contain a directed cycle.<br>
+  href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html"><tt>StrictWeakOrdering</tt></a>
+  provided by the <tt>compare</tt> function object.<br>

-  <b>Default:</b> <tt>shared_array_property_map</tt>
-  with the same value type as the
+  <b>Default:</b> <tt>iterator_property_map</tt> created from a
+  <tt>std::vector</tt> with the same value type as the
  <tt>WeightMap</tt>, and of size <tt>num_vertices(g)</tt>, and using
  the <tt>i_map</tt> for the index map.
 </blockquote>
@@ -415,32 +330,27 @@ UTIL/OUT: <tt>rank_map(CostMap c_map)</tt>
  <tt>h</tt>) from the vertex to a goal.  The type <tt>CostMap</tt>
  must be a model of <a
  href="../../property_map/doc/ReadWritePropertyMap.html"><tt>Read/Write
-  Property Map</tt></a> in non-tree versions of the algorithm, and <a
-  href="../../property_map/doc/WritablePropertyMap.html"><tt>Writable Property
-  Map</tt></a> in tree versions of the algorithm.  The vertex descriptor type
-  of the graph
+  Property Map</tt></a>.  The vertex descriptor type of the graph
  needs to be usable as the key type of the distance map.  The value
  type of the distance map is the element type of a <a
  href="./Monoid.html"><tt>Monoid</tt></a> formed with the
  <tt>combine</tt> function object and the zero object for the
  identity element.  Also the distance value type must have a <a
-  href="http://www.boost.org/sgi/stl/StrictWeakOrdering.html"><tt>StrictWeakOrdering</tt></a>
+  href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html"><tt>StrictWeakOrdering</tt></a>
  provided by the <tt>compare</tt> function object.  The value type
  for this map must be the same as the value type for the distance
-  map.  In tree versions of the algorithm, <tt>null_property_map</tt> can be
-  used for this parameter.<br>
+  map.<br>

-  <b>Default:</b> <tt>shared_array_property_map</tt>
-  with the same value type as the
-  <tt>DistanceMap</tt>, and of size <tt>num_vertices(g)</tt>, and using
+  <b>Default:</b> <tt>iterator_property_map</tt> created from a
+  <tt>std::vector</tt> with the same value type as the
+  <tt>WeightMap</tt>, and of size <tt>num_vertices(g)</tt>, and using
  the <tt>i_map</tt> for the index map.
 </blockquote>

 UTIL/OUT: <tt>color_map(ColorMap c_map)</tt>
 <blockquote>

-  This is used during the execution of non-tree versions of the algorithm to
-  mark the
+  This is used during the execution of the algorithm to mark the
  vertices, indicating whether they are on the OPEN or CLOSED lists.
  The vertices start out white and become gray when they are inserted
  into the OPEN list.  They then turn black when they are examined and
@@ -453,10 +363,10 @@ UTIL/OUT: <tt>color_map(ColorMap c_map)</tt>
  key type of the map, and the value type of the map must be a model
  of <a href="./ColorValue.html"><tt>Color Value</tt></a>.<br>

-  <b>Default:</b> <tt>shared_array_property_map</tt>
-  of value type <tt>default_color_type</tt>, with size
-  <tt>num_vertices(g)</tt>, and using
-  the <tt>i_map</tt> for the index map.
+  <b>Default:</b> <tt>iterator_property_map</tt> created from a
+  <tt>std::vector</tt> of value type <tt>default_color_type</tt>, with
+  size <tt>num_vertices(g)</tt>, and using the <tt>i_map</tt> for the
+  index map.
 </blockquote>

 IN: <tt>distance_compare(CompareFunction cmp)</tt>
@@ -466,7 +376,7 @@ IN: <tt>distance_compare(CompareFunction cmp)</tt>
  is closer to the start vertex, and to compare <i>f</i>-values to
  determine which vertex on the OPEN list to examine next.  The
  <tt>CompareFunction</tt> type must be a model of <a
-  href="http://www.boost.org/sgi/stl/BinaryPredicate.html"><tt>Binary
+  href="http://www.sgi.com/tech/stl/BinaryPredicate.html"><tt>Binary
  Predicate</tt></a> and have argument types that match the value type
  of the <tt>DistanceMap</tt> property map.<br>

@@ -481,7 +391,7 @@ IN: <tt>distance_combine(CombineFunction cmb)</tt>
  of a path, and to combine distance and heuristic values to compute
  the <i>f</i>-value of a vertex.  The <tt>CombineFunction</tt> type
  must be a model of <a
-  href="http://www.boost.org/sgi/stl/BinaryFunction.html"><tt>Binary
+  href="http://www.sgi.com/tech/stl/BinaryFunction.html"><tt>Binary
  Function</tt></a>.  Both argument types of the binary function must
  match the value type of the <tt>DistanceMap</tt> property map (which
  is the same as that of the <tt>WeightMap</tt> and <tt>CostMap</tt>
@@ -548,7 +458,7 @@ The time complexity is <i>O((E + V) log V)</i>.
  is invoked on each out-edge of a vertex immediately after it is
  examined.
 <li><b><tt>vis.edge_relaxed(e, g)</tt></b>
-  is invoked on edge <i>(u,v)</i> if <i>d[u] + w(u,v) &lt; d[v]</i>.
+  is invoked on edge <i>(u,v)</i> if <i>d[u] + w(u,v) < d[v]</i>.
 <li><b><tt>vis.edge_not_relaxed(e, g)</tt></b>
  is invoked if the edge is not relaxed (see above).
 <li><b><tt>vis.black_target(e, g)</tt></b>
@@ -580,10 +490,10 @@ this state by pointer or reference.
 <TABLE>
 <TR valign=top>
 <TD nowrap>Copyright &copy; 2004</TD><TD>
-<A HREF="http://cs.krisbeevers.com/">Kristopher Beevers</A>,
+<A HREF="http://www.cs.rpi.edu/~beevek/">Kristopher Beevers</A>,
 Rensselaer Polytechnic Institute (<A
 HREF="mailto:beevek@cs.rpi.edu">beevek@cs.rpi.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) 2004 Kris Beevers
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: astar_visitor</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -99,10 +99,10 @@ and <a href="./property_writer.html"><tt>property_writer</tt></a>.
 <TABLE>
 <TR valign=top>
 <TD nowrap>Copyright &copy; 2004</TD><TD>
-<A HREF="http://cs.krisbeevers.com/">Kristopher Beevers</A>,
+<A HREF="http://www.cs.rpi.edu/~beevek/">Kristopher Beevers</A>,
 Rensselaer Polytechnic Institute (<A
 HREF="mailto:beevek@cs.rpi.edu">beevek@cs.rpi.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Bandwidth</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -31,10 +31,10 @@
  bandwidth(const Graph& g, VertexIndexMap index_map)
 </pre>

-The <b><i>bandwidth</i></b> of a graph is the maximum
+The <b><i>bandwidth</i></b> of an undirected graph is the maximum
 distance between two adjacent vertices, with distance measured on a
 line upon which the vertices have been placed at unit intervals. To
-put it another way, if the vertices of a graph
+put it another way, if the vertices of an undirected graph
 <i>G=(V,E)</i> are each assigned an index from zero to <i>|V| - 1</i>
 given by <i>index[v]</i>, then the bandwidth of <i>G</i> is<br>
 <br>
@@ -90,4 +90,4 @@ of the i-th bandwidths <i>B<sub>i</sub>(G)</i>.<br>
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,7 +1,7 @@
 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
 <!--
     Copyright (c) 2004 Trustees of Indiana University
-
+    
     Distributed under 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)
@@ -18,7 +18,7 @@
 <div class="titlepage"></div>
 <div class="refnamediv">

-<IMG SRC="../../../boost.png"
+<IMG SRC="../../../boost.png" 
     ALT="C++ Boost" width="277" height="86">

 <h1><img src="figs/python.gif" alt="(Python)"/><span class="refentrytitle">Function
@@ -36,23 +36,23 @@ clustering based on edge betweenness centrality.</p>
 <span class="bold"><b>template</b></span>&lt;<span class=
 "bold"><b>typename</b></span> MutableGraph, <span class=
 "bold"><b>typename</b></span> Done, <span class=
-"bold"><b>typename</b></span> EdgeCentralityMap,
+"bold"><b>typename</b></span> EdgeCentralityMap, 
         <span class=
-"bold"><b>typename</b></span> VertexIndexMap&gt;
+"bold"><b>typename</b></span> VertexIndexMap&gt; 
  <span class="type"><span class=
-"bold"><b>void</b></span></span> betweenness_centrality_clustering(MutableGraph &amp; g, Done done,
-                                         EdgeCentralityMap edge_centrality,
+"bold"><b>void</b></span></span> betweenness_centrality_clustering(MutableGraph &amp; g, Done done, 
+                                         EdgeCentralityMap edge_centrality, 
                                         VertexIndexMap vertex_index);
 <span class="bold"><b>template</b></span>&lt;<span class=
 "bold"><b>typename</b></span> MutableGraph, <span class=
 "bold"><b>typename</b></span> Done, <span class=
-"bold"><b>typename</b></span> EdgeCentralityMap&gt;
+"bold"><b>typename</b></span> EdgeCentralityMap&gt; 
  <span class="type"><span class=
-"bold"><b>void</b></span></span> betweenness_centrality_clustering(MutableGraph &amp; g, Done done,
+"bold"><b>void</b></span></span> betweenness_centrality_clustering(MutableGraph &amp; g, Done done, 
                                         EdgeCentralityMap edge_centrality);
 <span class="bold"><b>template</b></span>&lt;<span class=
 "bold"><b>typename</b></span> MutableGraph, <span class=
-"bold"><b>typename</b></span> Done&gt;
+"bold"><b>typename</b></span> Done&gt; 
  <span class="type"><span class=
 "bold"><b>void</b></span></span> betweenness_centrality_clustering(MutableGraph &amp; g, Done done);
 </pre></div>
@@ -61,7 +61,7 @@ clustering based on edge betweenness centrality.</p>
 <h2>Description</h2>
 <p>This algorithm implements graph clustering based on edge
 betweenness centrality. It is an iterative algorithm, where in each
-step it computes the edge betweenness centrality (via <a href=
+step it compute the edge betweenness centrality (via <a href=
 "betweenness_centrality.html">brandes_betweenness_centrality</a>) and
 removes the edge with the maximum betweenness centrality. The
 <tt class="computeroutput">done</tt> function object determines
@@ -108,7 +108,7 @@ OUT/UTIL: <tt>EdgeCentralityMap edge_centrality_map</tt>
  <b>Python default</b>: <tt>graph.get_edge_double_map("centrality")</tt>
 </blockquote>

-IN: <tt>VertexIndexMap vertex_index</tt>
+IN: <tt>VertexIndexMap vertex_index</tt> 
 <blockquote>
  This maps each vertex to an integer in the range <tt>[0,
    num_vertices(g))</tt>. This is necessary for efficient updates of the
@@ -120,7 +120,7 @@ IN: <tt>VertexIndexMap vertex_index</tt>
  <b>Default:</b> <tt>get(vertex_index, g)</tt>.
    Note: if you use this default, make sure your graph has
    an internal <tt>vertex_index</tt> property. For example,
-    <tt>adjacency_list</tt> with <tt>VertexList=listS</tt> does
+    <tt>adjacenty_list</tt> with <tt>VertexList=listS</tt> does
    not have an internal <tt>vertex_index</tt> property.<br>
  <b>Python</b>: Unsupported parameter.
 </blockquote>
@@ -142,7 +142,7 @@ IN: <tt>VertexIndexMap vertex_index</tt>
 <td nowrap>Copyright &copy; 2004</td>
 <td><a href="http://www.boost.org/people/doug_gregor.html">Douglas Gregor</a>,
 Indiana University (dgregor@cs.indiana.edu)<br>
-<a href="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</a>, Indiana
+<a href="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</a>, Indiana
 University (<a href=
 "mailto:lums@osl.iu.edu">lums@osl.iu.edu</a>)</td>
 </tr>
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Bellman Ford Shortest Paths</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -24,7 +24,7 @@
 <PRE>
 <i>// named paramter version</i>
 template &lt;class <a href="./EdgeListGraph.html">EdgeListGraph</a>, class Size, class P, class T, class R&gt;
-bool bellman_ford_shortest_paths(const EdgeListGraph&amp; g, Size N,
+bool bellman_ford_shortest_paths(const EdgeListGraph&amp; g, Size N, 
  const bgl_named_params&lt;P, T, R&gt;&amp; params = <i>all defaults</i>);

 template &lt;class <a href="./VertexAndEdgeListGraph.html">VertexAndEdgeListGraph</a>, class P, class T, class R&gt;
@@ -34,10 +34,10 @@ bool bellman_ford_shortest_paths(const VertexAndEdgeListGraph&amp; g,
 <i>// non-named parameter version</i>
 template &lt;class <a href="./EdgeListGraph.html">EdgeListGraph</a>, class Size, class WeightMap,
 	  class PredecessorMap, class DistanceMap,
-	  class <a href="http://www.boost.org/sgi/stl/BinaryFunction.html">BinaryFunction</a>, class <a href="http://www.boost.org/sgi/stl/BinaryPredicate.html">BinaryPredicate</a>,
+	  class <a href="http://www.sgi.com/tech/stl/BinaryFunction.html">BinaryFunction</a>, class <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">BinaryPredicate</a>,
 	  class <a href="./BellmanFordVisitor.html">BellmanFordVisitor</a>&gt;
-bool bellman_ford_shortest_paths(EdgeListGraph&amp; g, Size N,
-  WeightMap weight, PredecessorMap pred, DistanceMap distance,
+bool bellman_ford_shortest_paths(EdgeListGraph&amp; g, Size N, 
+  WeightMap weight, PredecessorMap pred, DistanceMap distance, 
  BinaryFunction combine, BinaryPredicate compare, BellmanFordVisitor v)
 </PRE>

@@ -51,7 +51,7 @@ shortest paths problem for a graph with both positive and negative
 edge weights. For the definition of the shortest paths problem see
 Section <A
 HREF="./graph_theory_review.html#sec:shortest-paths-algorithms">Shortest-Paths
-Algorithms</A>.
+Algorithms</A>. 
 If you only need to solve the shortest paths problem for positive edge
 weights, Dijkstra's algorithm provides a more efficient
 alternative. If all the edge weights are all equal to one then breadth-first
@@ -77,7 +77,7 @@ ultimately be the parent in the shortest paths tree
 <td valign="top">
 <pre>
 RELAX(<i>u</i>, <i>v</i>, <i>w</i>, <i>d</i>, <i>p</i>)
-  <b>if</b> (<i>w(u,v) + d[u] < d[v]</i>)
+  <b>if</b> (<i>w(u,v) + d[u] < d[v]</i>) 
    <i>d[v] := w(u,v) + d[u]</i>
    <i>p[v] := u</i>
  <b>else</b>
@@ -91,7 +91,7 @@ RELAX(<i>u</i>, <i>v</i>, <i>w</i>, <i>d</i>, <i>p</i>)
 relax edge <i>(u,v)</i>


-edge <i>(u,v)</i> is not relaxed
+edge <i>(u,v)</i> is not relaxed 
 </pre>
 </td>
 </tr>
@@ -115,19 +115,19 @@ otherwise.
 <pre>
 BELLMAN-FORD(<i>G</i>)
  <i>// Optional initialization</i>
-  <b>for</b> each vertex <i>u in V</i>
+  <b>for</b> each vertex <i>u in V</i> 
    <i>d[u] := infinity</i>
-    <i>p[u] := u</i>
+    <i>p[u] := u</i> 
  <b>end for</b>
-  <b>for</b> <i>i := 1</i> <b>to</b> <i>|V|-1</i>
-    <b>for</b> each edge <i>(u,v) in E</i>
+  <b>for</b> <i>i := 1</i> <b>to</b> <i>|V|-1</i> 
+    <b>for</b> each edge <i>(u,v) in E</i> 
      RELAX(<i>u</i>, <i>v</i>, <i>w</i>, <i>d</i>, <i>p</i>)
    <b>end for</b>
  <b>end for</b>
-  <b>for</b> each edge <i>(u,v) in E</i>
+  <b>for</b> each edge <i>(u,v) in E</i> 
    <b>if</b> (<i>w(u,v) + d[u] < d[v]</i>)
      <b>return</b> (false, , )
-    <b>else</b>
+    <b>else</b> 
      ...
  <b>end for</b>
  <b>return</b> (true, <i>p</i>, <i>d</i>)
@@ -148,9 +148,9 @@ examine edge <i>(u,v)</i>



-edge <i>(u,v)</i> was not minimized
+edge <i>(u,v)</i> was not minimized 

-edge <i>(u,v)</i> was minimized
+edge <i>(u,v)</i> was minimized 
 </pre>
 </td>
 </tr>
@@ -175,7 +175,7 @@ algorithm's event points.
 <h3>Parameters</h3>


-IN: <tt>EdgeListGraph&amp; g</tt>
+IN: <tt>EdgeListGraph&amp; g</tt> 
 <blockquote>
  A directed or undirected graph whose type must be a model of
  <a href="./EdgeListGraph.html">Edge List Graph</a>. If a root vertex is
@@ -211,7 +211,7 @@ IN: <tt>weight_map(WeightMap w)</tt>
  <b>Python default</b>: <tt>graph.get_edge_double_map("weight")</tt>
 </blockquote>

-OUT: <tt>predecessor_map(PredecessorMap p_map)</tt>
+OUT: <tt>predecessor_map(PredecessorMap p_map)</tt> 
 <blockquote>
  The predecessor map records the edges in the minimum spanning
  tree. Upon completion of the algorithm, the edges <i>(p[u],u)</i>
@@ -227,7 +227,7 @@ OUT: <tt>predecessor_map(PredecessorMap p_map)</tt>
  <b>Python</b>: Must be a <tt>vertex_vertex_map</tt> for the graph.<br>
 </blockquote>

-IN/OUT: <tt>distance_map(DistanceMap d)</tt>
+IN/OUT: <tt>distance_map(DistanceMap d)</tt> 
 <blockquote>
  The shortest path weight from the source vertex to each vertex in
  the graph <tt>g</tt> is recorded in this property map.  The type
@@ -236,7 +236,7 @@ IN/OUT: <tt>distance_map(DistanceMap d)</tt>
  Property Map</a>. The key type of the property map must be the
  vertex descriptor type of the graph, and the value type of the
  distance map must be <a
-  href="http://www.boost.org/sgi/stl/LessThanComparable.html"> Less
+  href="http://www.sgi.com/tech/stl/LessThanComparable.html"> Less
  Than Comparable</a>.<br> <b>Default:</b> <tt>get(vertex_distance,
  g)</tt><br>
  <b>Python</b>: Must be a <tt>vertex_double_map</tt> for the graph.<br>
@@ -307,11 +307,11 @@ The time complexity is <i>O(V E)</i>.
 <li><b><tt>vis.examine_edge(e, g)</tt></b>  is invoked on every edge in
  the graph <i>|V|</i> times.
 <li><b><tt>vis.edge_relaxed(e, g)</tt></b>  is invoked when the distance
-  label for the target vertex is decreased. The edge <i>(u,v)</i> that
+  label for the target vertex is decreased. The edge <i>(u,v)</i> that 
  participated in the last relaxation for vertex <i>v</i> is an edge in the
-  shortest paths tree.
+  shortest paths tree. 
 <li><b><tt>vis.edge_not_relaxed(e, g)</tt></b>  is invoked if the distance label
-  for the target vertex is not decreased.
+  for the target vertex is not decreased. 
 <li><b><tt>vis.edge_minimized(e, g)</tt></b>  is invoked during the
  second stage of the algorithm, during the test of whether each edge
  was minimized. If the edge is minimized then this function
@@ -330,7 +330,7 @@ href="../example/bellman-example.cpp"><TT>examples/bellman-example.cpp</TT></a>.

 <h3>Notes</h3>

-<p><a name="1">[1]</a>
+<p><a name="1">[1]</a> 
  Since the visitor parameter is passed by value, if your visitor
  contains state then any changes to the state during the algorithm
  will be made to a copy of the visitor object, not the visitor object
@@ -346,4 +346,4 @@ href="../example/bellman-example.cpp"><TT>examples/bellman-example.cpp</TT></a>.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: bellman_visitor</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -22,7 +22,7 @@ bellman_visitor&lt;EventVisitorList&gt;
 </H1>

 This class is an adapter that converts a list of <a
-href="./EventVisitor.html">EventVisitor</a>s (constructed using
+href="./EventVisitor.html">EventVisitor</a>'s (constructed using
 <tt>std::pair</tt>) into a <a
 href="./BellmanFordVisitor.html">BellmanFordVisitor</a>.

@@ -63,7 +63,7 @@ with <tt>std::pair</tt>.
 This class implements all of the member functions required by <a
 href="./BellmanFordVisitor.html">BellmanFordVisitor</a>. In each function the
 appropriate event is dispatched to the <a
-href="./EventVisitor.html">EventVisitor</a> in the EventVisitorList.
+href="./EventVisitor.html">EventVisitor</a>'s in the EventVisitorList.

 <h3>Non-Member Functions</h3>

@@ -102,10 +102,10 @@ and <a href="./property_writer.html"><tt>property_writer</tt></a>.
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -2,7 +2,7 @@
 <html>
 <!--
     Copyright (c) 2004 Trustees of Indiana University
-
+    
     Distributed under 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)
@@ -12,54 +12,54 @@
  </head>

  <body>
-    <IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+    <IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 
 <h1><img src="figs/python.gif" alt="(Python)"/><tt>brandes_betweenness_centrality</tt></h1>

    <p>
    <pre>
 <em>// named parameter versions</em>
 template&lt;typename Graph, typename Param, typename Tag, typename Rest&gt;
-void
+void 
 brandes_betweenness_centrality(const Graph&amp; g,
                               const bgl_named_params&lt;Param,Tag,Rest&gt;&amp; params);

 template&lt;typename Graph, typename CentralityMap&gt;
-void
+void 
 brandes_betweenness_centrality(const Graph&amp; g, CentralityMap centrality_map);

 template&lt;typename Graph, typename CentralityMap, typename EdgeCentralityMap&gt;
-void
+void 
 brandes_betweenness_centrality(const Graph&amp; g, CentralityMap centrality_map,
                               EdgeCentralityMap edge_centrality);

 <em>// non-named parameter versions</em>
 template&lt;typename Graph, typename CentralityMap, typename EdgeCentralityMap,
-         typename IncomingMap, typename DistanceMap, typename DependencyMap,
+         typename IncomingMap, typename DistanceMap, typename DependencyMap, 
         typename PathCountMap, typename VertexIndexMap&gt;
-void
+void 
 brandes_betweenness_centrality(const Graph&amp; g, CentralityMap centrality_map,
                               EdgeCentralityMap edge_centrality,
                               IncomingMap incoming,
                               DistanceMap distance, DependencyMap dependency,
-                               PathCountMap path_count,
+                               PathCountMap path_count, 
                               VertexIndexMap vertex_index);

 template&lt;typename Graph, typename CentralityMap, typename EdgeCentralityMap,
-         typename IncomingMap, typename DistanceMap, typename DependencyMap,
-         typename PathCountMap, typename VertexIndexMap, typename WeightMap&gt;
-void
+         typename IncomingMap, typename DistanceMap, typename DependencyMap, 
+         typename PathCountMap, typename VertexIndexMap, typename WeightMap&gt;    
+void 
 brandes_betweenness_centrality(const Graph&amp; g, CentralityMap centrality_map,
                               EdgeCentralityMap edge_centrality,
-                               IncomingMap incoming,
+                               IncomingMap incoming, 
                               DistanceMap distance,  DependencyMap dependency,
-                               PathCountMap path_count,
+                               PathCountMap path_count,      
                               VertexIndexMap vertex_index,
                               WeightMap weight_map);

 <em>// helper functions</em>
 template&lt;typename Graph, typename CentralityMap&gt;
-void
+void 
 relative_betweenness_centrality(const Graph&amp; g, CentralityMap centrality_map);

 template&lt;typename Graph, typename CentralityMap&gt;
@@ -137,8 +137,8 @@ IN: <tt>const Graph&amp; g</tt>

 <b>Python</b>: The parameter is named <tt>graph</tt>.
 </blockquote>
-
-UTIL: <tt>IncomingMap incoming</tt>
+    
+UTIL: <tt>IncomingMap incoming</tt> 
 <blockquote>
  This property map records the set of edges incoming to each vertex that comprise a shortest path from a particular source vertex through this vertex, and is used internally by the algorithm.The <tt>IncomingMap</tt> type must be a <a
  href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property
@@ -155,7 +155,7 @@ UTIL: <tt>IncomingMap incoming</tt>
  <b>Python</b>: Unsupported parameter.
 </blockquote>

-UTIL: <tt>DistanceMap distance_map</tt>
+UTIL: <tt>DistanceMap distance_map</tt> 
 <blockquote>
  The shortest path weight from each source vertex <tt>s</tt> to each
  vertex in the graph <tt>g</tt> is recorded in this property map, but
@@ -178,7 +178,7 @@ UTIL: <tt>DistanceMap distance_map</tt>
  <b>Python</b>: Unsupported parameter.
 </blockquote>

-UTIL: <tt>DependencyMap dependency</tt>
+UTIL: <tt>DependencyMap dependency</tt> 
 <blockquote>
  Property map used internally to accumulate partial betweenness
  centrality results. The type <tt>DependencyMap</tt> must be a model
@@ -198,7 +198,7 @@ UTIL: <tt>DependencyMap dependency</tt>
  <b>Python</b>: Unsupported parameter.
 </blockquote>

-UTIL: <tt>PathCountMap path_count</tt>
+UTIL: <tt>PathCountMap path_count</tt> 
 <blockquote>
  Property map used internally to accumulate the number of paths that
  pass through each particular vertex. The type <tt>PathCountMap</tt>
@@ -254,7 +254,7 @@ OUT/UTIL: <tt>EdgeCentralityMap edge_centrality_map</tt>
  <b>Python default</b>: <tt>graph.get_edge_double_map("centrality")</tt>
 </blockquote>

-IN: <tt>vertex_index_map(VertexIndexMap vertex_index)</tt>
+IN: <tt>vertex_index_map(VertexIndexMap vertex_index)</tt> 
 <blockquote>
  This maps each vertex to an integer in the range <tt>[0,
    num_vertices(g))</tt>. This is necessary for efficient updates of the
@@ -266,16 +266,16 @@ IN: <tt>vertex_index_map(VertexIndexMap vertex_index)</tt>
  <b>Default:</b> <tt>get(vertex_index, g)</tt>.
    Note: if you use this default, make sure your graph has
    an internal <tt>vertex_index</tt> property. For example,
-    <tt>adjacency_list</tt> with <tt>VertexList=listS</tt> does
+    <tt>adjacenty_list</tt> with <tt>VertexList=listS</tt> does
    not have an internal <tt>vertex_index</tt> property.<br>
  <b>Python</b>: Unsupported parameter.
 </blockquote>

-IN: <tt>weight_map(WeightMap w_map)</tt>
+IN: <tt>weight_map(WeightMap w_map)</tt>   
 <blockquote>
  The weight or ``length'' of each edge in the graph. The weights
  must all be non-negative, and the algorithm will throw a
-  <a href="./exception.html#negative_edge"><tt>negative_edge</tt></a>
+  <a href="./exception.html#negative_edge"><tt>negative_edge</tt></a> 
  exception is one of the edges is negative.
  The type <tt>WeightMap</tt> must be a model of
  <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map</a>. The edge descriptor type of
@@ -286,7 +286,7 @@ IN: <tt>weight_map(WeightMap w_map)</tt>
  <b>Python</b>: If supplied, must be an <tt>edge_double_map</tt> for the graph.
 </blockquote>

-<h3>Complexity</h3>
+<h3>Complexity</h3> 
 The time complexity is <em>O(VE)</em> for unweighted graphs and
 <em>O(VE + V(V+E) log V)</em> for weighted graphs. The space complexity
 is <em>O(VE)</em>.
@@ -297,7 +297,7 @@ is <em>O(VE)</em>.
 <TR valign=top>
 <TD nowrap>Copyright &copy; 2004</TD><TD>
 <A HREF="http://www.boost.org/people/doug_gregor.html">Douglas Gregor</A>, Indiana University (dgregor@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: bfs_visitor</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -22,7 +22,7 @@ bfs_visitor&lt;EventVisitorList&gt;
 </H1>

 This class is an adapter that converts a list of <a
-href="./EventVisitor.html">EventVisitor</a>s (constructed using
+href="./EventVisitor.html">EventVisitor</a>'s (constructed using
 <tt>std::pair</tt>) into a <a href="./BFSVisitor.html">BFSVisitor</a>.


@@ -38,10 +38,10 @@ visitor.
 <pre>
  // Construct graph G and obtain the source vertex s ...

-  boost::breadth_first_search(G, s,
+  boost::breadth_first_search(G, s, 
   boost::make_bfs_visitor(
    std::make_pair(boost::record_distances(d, boost::on_tree_edge()),
-    std::make_pair(boost::record_predecessors(p.begin(),
+    std::make_pair(boost::record_predecessors(p.begin(), 
                                              boost::on_tree_edge()),
                   copy_graph(G_copy, boost::on_examine_edge())))) );
 </pre>
@@ -80,7 +80,7 @@ with <tt>std::pair</tt>.
 This class implements all of the member functions required by <a
 href="./BFSVisitor.html">BFSVisitor</a>. In each function the
 appropriate event is dispatched to the <a
-href="./EventVisitor.html">EventVisitor</a> in the EventVisitorList.
+href="./EventVisitor.html">EventVisitor</a>'s in the EventVisitorList.

 <h3>Non-Member Functions</h3>

@@ -119,10 +119,10 @@ and <a href="./property_writer.html"><tt>property_writer</tt></a>.
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Named Parameters</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -38,7 +38,7 @@ reasons:
  he or she has to resort to providing all the parameters.

  <li>Since the list of parameters is long, it is easy to forget
-   the ordering.
+   the ordering. 
 </ul>

 <p>
@@ -54,7 +54,7 @@ indicates which parameter the argument is for. Each of the named
 parameters is separated by a <b>period</b>, not a comma.

 <pre>
-  bool r = boost::bellman_ford_shortest_paths(g, int(N),
+  bool r = boost::bellman_ford_shortest_paths(g, int(N), 
     boost::weight_map(weight).
     distance_map(&amp;distance[0]).
     predecessor_map(&amp;parent[0]));
@@ -66,7 +66,7 @@ an call to <tt>bellman_ford_shortest_paths</tt> that is equivalent to
 the one above.

 <pre>
-  bool r = boost::bellman_ford_shortest_paths(g, int(N),
+  bool r = boost::bellman_ford_shortest_paths(g, int(N), 
     boost::predecessor_map(&amp;parent[0]).
     distance_map(&amp;distance[0]).
     weight_map(weight));
@@ -87,7 +87,7 @@ like <tt>boost::weight_map</tt> that create an instance of
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Bibliography</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -148,7 +148,7 @@ J.&nbsp;W.&nbsp;H. Liu.

 <P></P><DT><A NAME="mehlhorn99:_leda">22</A>
 <DD>
-K.&nbsp;Mehlhorn and S.&nbsp;Näher.
+K.&nbsp;Mehlhorn and S.&nbsp;Näher.
 <BR><EM>The LEDA Platform of Combinatorial and Geometric Computing</EM>.
 <BR>Cambridge University Press, 1999.

@@ -264,7 +264,7 @@ SIAM Journal on Computing, 1(2):146-160, 1972
 <P></P><DT><A NAME="eppstein97:dynamic_graph">42</a>
 <DD>David Eppstein, Zvi Galil, and Giuseppe F. Italiano<BR>
 <EM>Dynamic Graph Algorithms.</EM><br>
-Chapter 22, CRC Handbook of Algorithms and Theory of Computation, 1997.
+Chapter 22, CRC Handbook of Algorithms and Theory of Computation, 1997. 

 <P></P><DT><A NAME="cuthill69:reducing_bandwith">43</a>
 <DD>E. Cuthill and J. McKee<BR>
@@ -330,7 +330,7 @@ BIT, 10, 1970, pp. 76-94.

 <p></p><dt><a name="brandes01">54</a>
 <dd>Ulrik Brandes<br>
-<em><a href="http://ella.slis.indiana.edu/~katy/L579/brandes.pdf">A
+<em><a href="http://ella.slis.indiana.edu/~katy/L579/brandes.pdf">A 
            Faster Algorithm for Betweenness Centrality</a></em><br>
 Journal of Mathematical Sociology 25 (2):163-177, 2001.

@@ -347,12 +347,12 @@ Technical Report BN9/71, Stichting Mahtematisch Centrum, Amsterdam, 1971.
 <p></p><dt><a name="kamada89">57</a>
 <dd>T. Kamada and S. Kawai<br>
 <em>An algorithm for drawing general undirected graphs.</em><br>
-Information Processing Letters, 31, pp. 7-15, 1989.
+Information Processing Letters, 31, pp. 7-15, 1989. 

 <p></p><dt><a name="fruchterman91">58</a>
 <dd>T. Fruchterman and E. Reingold<br>
  <em>Graph drawing by force-directed placement.</em><br>
-Software--Practice &amp; Experience, 21 (11), pp. 1129-1164, 1991.
+Software--Practice & Experience, 21 (11), pp. 1129-1164, 1991.

 <p></p><dt><a name="coleman83">59</a>
 <dd>Thomas F. Coleman and Jorge J. More<br>
@@ -409,7 +409,7 @@ PhD thesis, Cornell University, September 2003.
 <p></p><dt><a name="boykov-kolmogorov04">69</a>
  <dd>Yuri Boykov and Vladimir Kolmogorov<br>
    <em><a href="http://www.csd.uwo.ca/faculty/yuri/Abstracts/pami04-abs.html">An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision</a></em><br>
-    In <em>IEEE Transactions on Pattern Analysis and Machine Intelligence</em>, vol. 26, no. 9, pp. 1124-1137, Sept. 2004.
+    In IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, no. 9, pp. 1124-1137, Sept. 2004.

 <p></p><dt><a name="boyermyrvold04">70</a>
 <dd>John M. Boyer and Wendy J. Myrvold<br>
@@ -432,34 +432,8 @@ How to Draw a Planar Graph on a Grid
 </em><br>
 Combinatorica 10: 41-51, 1990.

-<P></P><DT><A NAME="wilson96generating">73</A>
-<DD>
-David&nbsp;Bruce&nbsp;Wilson
-<BR><em>Generating random spanning trees more quickly than the cover time</em>.
-ACM Symposium on the Theory of Computing, pp. 296-303, 1996.
-
-<p></p><dt><a name="edmonds65:_max_weighted_match">74</a>
-<dd>J. Edmonds<br>
-<em>Maximum Matching and a Polyhedron with 0, 1-Vertices</em><br>
-Journal of Research of the National Bureau of Standards B 69, pp. 125-130, 1965.
-
-<p></p><dt><a name="gabow76">75</a>
-<dd>Harold N. Gabow<br>
-<em>An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs</em><br>
-Journal of the ACM (JACM), 23(2): 221-234, 1976.
-
-<p></p><dt><a name="gabow90">76</a>
-<dd>Harold N. Gabow<br>
-<em>Data Structures for Weighted Matching and Nearest Common Ancestors with Linking</em><br>
-Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434-443, 1990.
-
-<p></p><dt><a name="galil86">77</a>
-<dd>Zvi Galil<br>
-<em><a href="https://dl.acm.org/doi/pdf/10.1145/6462.6502">Efficient Algorithms for Finding Maximum Matching in Graphs</a></em><br>
-ACM Computing Surveys (CSUR), 18(1), 23-38, 1986.
-
 </dl>
-
+  
 <br>
 <HR>
 <TABLE>
@@ -469,4 +443,4 @@ ACM Computing Surveys (CSUR), 18(1), 23-38, 1986.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,21 +1,21 @@
 <HTML>
 <!--
     Copyright 2001-2004 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
               Jeremy Siek
               Andrew Lumsdaine
  -->
 <Head>
 <Title>Boost Graph Library: Biconnected Components and Articulation Points</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -25,7 +25,7 @@
 <A NAME="sec:biconnected-components">biconnected_components
 </A>
 </TT>
-and
+and 
 <tt>articulation_points</tt>
 </h1>

@@ -34,25 +34,25 @@ and
 template &lt;typename Graph, typename ComponentMap, typename OutputIterator,
          typename P, typename T, typename R&gt;
 std::pair&lt;std::size_t, OutputIterator&gt;
-biconnected_components(const Graph& g, ComponentMap comp, OutputIterator out,
+biconnected_components(const Graph& g, ComponentMap comp, OutputIterator out, 
                       const bgl_named_params&lt;P, T, R&gt;&amp; params)

 template &lt;typename Graph, typename ComponentMap,
          typename P, typename T, typename R&gt;
 std::size_t
-biconnected_components(const Graph& g, ComponentMap comp,
+biconnected_components(const Graph& g, ComponentMap comp, 
                       const bgl_named_params&lt;P, T, R&gt;&amp; params)

-template &lt;typename Graph, typename OutputIterator,
+template &lt;typename Graph, typename OutputIterator, 
          typename P, typename T, typename R&gt;
-OutputIterator articulation_points(const Graph& g, OutputIterator out,
+OutputIterator articulation_points(const Graph& g, OutputIterator out, 
                                   const bgl_named_params&lt;P, T, R&gt;&amp; params)

 <i>// non-named parameter version</i>
 template &lt;typename Graph, typename ComponentMap, typename OutputIterator,
          typename DiscoverTimeMap, typename LowPointMap&gt;
 std::pair&lt;std::size_t, OutputIterator&gt;
-biconnected_components(const Graph& g, ComponentMap comp, OutputIterator out,
+biconnected_components(const Graph& g, ComponentMap comp, OutputIterator out, 
                       DiscoverTimeMap discover_time, LowPointMap lowpt);

 template &lt;typename Graph, typename ComponentMap, typename OutputIterator&gt;
@@ -121,7 +121,7 @@ records which component each edge in the graph belongs to by
 recording the component number in the component property map. The
 <tt>ComponentMap</tt> type must be a model of <a
 href="../../property_map/doc/WritablePropertyMap.html">Writable Property
-Map</a>. The value type should be an integer type, preferably the same
+Map</a>. The value type shouch be an integer type, preferably the same
 as the <tt>edges_size_type</tt> of the graph. The key type must be
 the graph's edge descriptor type.<br>
 <b>Default</b>: <tt>dummy_property_map</tt>.<br>
@@ -142,10 +142,10 @@ points.

 <h3>Named Parameters</h3>

-IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt>
+IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt> 
 <blockquote>
  This maps each vertex to an integer in the range <tt>[0,
-    num_vertices(g))</tt>. The type
+    num_vertices(g))</tt>. The type 
  <tt>VertexIndexMap</tt> must be a model of
  <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map</a>. The value type of the map must be an
  integer type. The vertex descriptor type of the graph needs to be
@@ -192,9 +192,9 @@ UTIL/OUT: <tt>lowpoint_map(LowPointMap lowpt)</tt>
  <b>Python</b>: Unsupported parameter.
 </blockquote>

-UTIL/OUT: <tt>predecessor_map(PredecessorMap p_map)</tt>
+UTIL/OUT: <tt>predecessor_map(PredecessorMap p_map)</tt> 
 <blockquote>
-  The predecessor map records the depth first search tree.
+  The predecessor map records the depth first search tree. 
  The <tt>PredecessorMap</tt> type
  must be a <a
  href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
@@ -239,15 +239,6 @@ href="../example/biconnected_components.cpp"><tt>examples/biconnected_components
 contains an example of calculating the biconnected components and
 articulation points of an undirected graph.

-<h3>Notes</h3>
-
-<p><a name="1">[1]</a>
-  Since the visitor parameter is passed by value, if your visitor
-  contains state then any changes to the state during the algorithm
-  will be made to a copy of the visitor object, not the visitor object
-  passed in. Therefore you may want the visitor to hold this state by
-  pointer or reference.
-
 <br>
 <HR>
 <TABLE>
@@ -260,4 +251,4 @@ HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -5,7 +5,7 @@
 \usepackage{amsfonts}
 \usepackage{amssymb}
 \usepackage{amsthm}
-\usepackage{latexsym}
+\usepackage{latexsym}     
 \usepackage{jweb}
 \usepackage{times}
 \usepackage{graphicx}
@@ -156,11 +156,11 @@ template.

@d Concept checking of type parameters
@{
-BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
-BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
-BOOST_CONCEPT_ASSERT(( WritablePropertyMapConcept<ComponentMap, edge_t> ));
-BOOST_CONCEPT_ASSERT(( ReadWritePropertyMapConcept<DiscoverTimeMap, vertex_t> ));
-BOOST_CONCEPT_ASSERT(( ReadWritePropertyMapConcept<LowPointMap, vertex_t> ));
+function_requires< VertexListGraphConcept<Graph> >();
+function_requires< IncidenceGraphConcept<Graph> >();
+function_requires< WritablePropertyMapConcept<ComponentMap, edge_t> >();
+function_requires< ReadWritePropertyMapConcept<DiscoverTimeMap, vertex_t> >();
+function_requires< ReadWritePropertyMapConcept<LowPointMap, vertex_t> >();
@}

 The first step of the algorithm is to initialize the discover times of
@@ -286,7 +286,6 @@ S.pop();
 #include <boost/graph/graph_traits.hpp>
 #include <boost/graph/graph_concepts.hpp>
 #include <boost/property_map/property_map.hpp>
-#include <boost/concept/assert.hpp>

 namespace boost {
  @<Biconnected Components Algorithm@>
@@ -358,7 +357,7 @@ int main()



-% \paragraph{Definition.} A \emph{palm tree} $P$ is a directed graph that
+% \paragraph{Definition.} A \emph{palm tree} $P$ is a directed graph that 
 % consists of two disjoint sets of edges, denoted by $v \rightarrow w$
 % and $v \backedge w$ respectively, with the following properties:

@@ -1,39 +1,39 @@
 <HTML>
 <!-- Copyright 2007 Aaron Windsor
-
+     
     Distributed under 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)
-
+    
  -->
 <Head>
 <Title>Boost Graph Library: Boyer-Myrvold Planarity Testing/Embedding</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

 <H1>Boyer-Myrvold Planarity Testing/Embedding</H1>

 <p>
-A graph is <a href="./planar_graphs.html#planar"><i>planar</i></a> if it can
-be drawn in two-dimensional space without any of its edges crossing. Such a
-drawing of a planar graph is called a
-<a href="./planar_graphs.html#plane_drawing"><i>plane drawing</i></a>. Each
+A graph is <a href="./planar_graphs.html#planar"><i>planar</i></a> if it can 
+be drawn in two-dimensional space without any of its edges crossing. Such a 
+drawing of a planar graph is called a 
+<a href="./planar_graphs.html#plane_drawing"><i>plane drawing</i></a>. Each 
 plane drawing belongs to an equivalence class called a <i>planar embedding</i>
-<a href="#1">[1]</a> that is defined by the clockwise ordering of adjacent
-edges around each vertex in the graph. A planar embedding is a convenient
-intermediate representation of an actual drawing of a planar graph, and many
-planar graph drawing algorithms are formulated as functions mapping a planar
+<a href="#1">[1]</a> that is defined by the clockwise ordering of adjacent 
+edges around each vertex in the graph. A planar embedding is a convenient 
+intermediate representation of an actual drawing of a planar graph, and many 
+planar graph drawing algorithms are formulated as functions mapping a planar 
 embedding to a plane drawing.
 <br>
 <br>
 <table align="center" class="image">
-<caption align="bottom"><h5>A planar graph (top left), along with a planar
-embedding of that graph (bottom left) can be used to create a plane drawing
-(right) by embedding edges around each vertex in the order in which they
+<caption align="bottom"><h5>A planar graph (top left), along with a planar 
+embedding of that graph (bottom left) can be used to create a plane drawing 
+(right) by embedding edges around each vertex in the order in which they 
 appear in the planar embedding.
 </h5></caption>
 <tr><td>
@@ -44,16 +44,16 @@ appear in the planar embedding.
 </table>
 <br>
 <p>
-The function <tt>boyer_myrvold_planarity_test</tt> implements the planarity
-testing/embedding algorithm of Boyer and Myrvold
+The function <tt>boyer_myrvold_planarity_test</tt> implements the planarity 
+testing/embedding algorithm of Boyer and Myrvold 
 [<a href="./bibliography.html#boyermyrvold04">70</a>].
-<tt>boyer_myrvold_planarity_test</tt> returns <tt>true</tt> if the input graph
+<tt>boyer_myrvold_planarity_test</tt> returns <tt>true</tt> if the input graph 
 is planar and <tt>false</tt> otherwise. As a side-effect of this test, a planar
-embedding can be constructed if the graph is planar or a minimal set of edges
-that form a <a href = "./planar_graphs.html#kuratowskisubgraphs">Kuratowski
+embedding can be constructed if the graph is planar or a minimal set of edges 
+that form a <a href = "./planar_graphs.html#kuratowskisubgraphs">Kuratowski 
 subgraph</a> can be found if the graph is not planar.
-<tt>boyer_myrvold_planarity_test</tt> uses named parameter arguments (courtesy
-of the <a href="../../parameter/doc/html/index.html">Boost.Parameter</a>
+<tt>boyer_myrvold_planarity_test</tt> uses named parameter arguments (courtesy 
+of the <a href="../../parameter/doc/html/index.html">Boost.Parameter</a> 
 library) to specify what the function actually does. Some examples are:

 <ul>
@@ -65,8 +65,8 @@ bool is_planar = boyer_myrvold_planarity_test(g);
 <li>Computing a planar embedding for a graph if it is planar, otherwise finding
 a set of edges that forms an obstructing Kuratowski subgraph:
 <pre>
-if (boyer_myrvold_planarity_test(boyer_myrvold_params::graph = g,
-                                 boyer_myrvold_params::embedding = embedding_pmap,
+if (boyer_myrvold_planarity_test(boyer_myrvold_params::graph = g, 
+                                 boyer_myrvold_params::embedding = embedding_pmap,  
                                 boyer_myrvold_params::kuratowski_subgraph = out_itr
                                 )
    )
@@ -81,81 +81,81 @@ else
 </ul>

 <p>
-The parameters passed to <tt>boyer_myrvold_planarity_test</tt> in the examples
-above do more than just carry the data structures used for input and output -
-the algorithm is optimized at compile time based on which parameters are
-present. A complete list of parameters accepted and their interactions are
-described below.
+The parameters passed to <tt>boyer_myrvold_planarity_test</tt> in the examples 
+above do more than just carry the data structures used for input and output - 
+the algorithm is optimized at compile time based on which parameters are 
+present. A complete list of parameters accepted and their interactions are 
+described below. 
 <p>
 <tt>boyer_myrvold_planarity_test</tt> accepts as input any undirected graph,
 even those with self-loops and multiple edges.
-However, many planar graph drawing algorithms make additional restrictions
-on the structure of the input graph - for example, requiring that the input
+However, many planar graph drawing algorithms make additional restrictions 
+on the structure of the input graph - for example, requiring that the input 
 graph is connected, biconnected, or even maximal planar (triangulated.)
-Fortunately, any planar graph on <i>n</i> vertices that lacks one of these
-properties can be augmented with additional edges so that it satisfies that
-property in <i>O(n)</i> time - the functions
+Fortunately, any planar graph on <i>n</i> vertices that lacks one of these 
+properties can be augmented with additional edges so that it satisfies that 
+property in <i>O(n)</i> time - the functions 
 <tt><a href="./make_connected.html">make_connected</a></tt>,
-<tt><a href="./make_biconnected_planar.html">make_biconnected_planar</a></tt>,
-and <tt><a href="./make_maximal_planar.html">make_maximal_planar</a></tt>
-exist for this purpose. If the graph drawing algorithm you're using requires,
-say, a biconnected graph, then you must make your input graph biconnected
+<tt><a href="./make_biconnected_planar.html">make_biconnected_planar</a></tt>, 
+and <tt><a href="./make_maximal_planar.html">make_maximal_planar</a></tt> 
+exist for this purpose. If the graph drawing algorithm you're using requires, 
+say, a biconnected graph, then you must make your input graph biconnected 
 <i>before</i> passing it into <tt>boyer_myrvold_planarity_test</tt> so that the
-computed planar embedding includes these additional edges. This may require
-more than one call to <tt>boyer_myrvold_planarity_test</tt> depending on the
-structure of the graph you begin with, since both
-<tt>make_biconnected_planar</tt> and <tt>make_maximal_planar</tt> require a
+computed planar embedding includes these additional edges. This may require 
+more than one call to <tt>boyer_myrvold_planarity_test</tt> depending on the 
+structure of the graph you begin with, since both 
+<tt>make_biconnected_planar</tt> and <tt>make_maximal_planar</tt> require a 
 planar embedding of the existing graph as an input parameter.

 <p><p>
 The named parameters accepted by <tt>boyer_myrvold_planarity_test</tt> are:

 <ul>
-<li><b><tt>graph</tt></b> : The input graph - this is the only required
+<li><b><tt>graph</tt></b> : The input graph - this is the only required 
 parameter.
-<li><b><tt>vertex_index_map</tt></b> : A mapping from vertices of the input
-graph to indexes in the range <tt>[0..num_vertices(g))</tt>. If this parameter
+<li><b><tt>vertex_index_map</tt></b> : A mapping from vertices of the input 
+graph to indexes in the range <tt>[0..num_vertices(g))</tt>. If this parameter 
 is not provided, the vertex index map is assumed to be available as an interior
 property of the graph, accessible by calling <tt>get(vertex_index, g)</tt>.
 <li><b><tt>edge_index_map</tt></b>: A mapping from the edges of the input graph
-to indexes in the range <tt>[0..num_edges(g))</tt>. This parameter is only
-needed if the <tt>kuratowski_subgraph</tt> argument is provided. If the
+to indexes in the range <tt>[0..num_edges(g))</tt>. This parameter is only 
+needed if the <tt>kuratowski_subgraph</tt> argument is provided. If the 
 <tt>kuratowski_subgraph</tt> argument is provided and this parameter is not
-provided, the EdgeIndexMap is assumed to be available as an interior property
+provided, the EdgeIndexMap is assumed to be available as an interior property 
 accessible by calling <tt>get(edge_index, g)</tt>.
-<li><b><tt>embedding</tt></b> : If the graph is planar, this will be populated
-with a mapping from vertices to the clockwise order of neighbors in the planar
+<li><b><tt>embedding</tt></b> : If the graph is planar, this will be populated 
+with a mapping from vertices to the clockwise order of neighbors in the planar 
 embedding.
 <li><b><tt>kuratowski_subgraph</tt></b> : If the graph is not planar, a minimal
-set of edges that form the obstructing Kuratowski subgraph will be written to
+set of edges that form the obstructing Kuratowski subgraph will be written to 
 this iterator.
 </ul>

-These named parameters all belong to the namespace
-<tt>boyer_myrvold_params</tt>. See below for more information on the concepts
-required for these arguments.
+These named parameters all belong to the namespace 
+<tt>boyer_myrvold_params</tt>. See below for more information on the concepts 
+required for these arguments. 

 <H3>Verifying the output</H3>

 Whether or not the input graph is planar, <tt>boyer_myrvold_planarity_test</tt>
-can produce a certificate that can be automatically checked to verify that the
-function is working properly.
+can produce a certificate that can be automatically checked to verify that the 
+function is working properly. 
 <p>
 If the graph is planar, a planar embedding can be produced. The
-planar embedding can be verified by passing it to a plane drawing routine
+planar embedding can be verified by passing it to a plane drawing routine 
 (such as <tt><a href="straight_line_drawing.html">
-chrobak_payne_straight_line_drawing</a></tt>) and using the function
-<tt><a href="is_straight_line_drawing.html">is_straight_line_drawing</a></tt>
+chrobak_payne_straight_line_drawing</a></tt>) and using the function 
+<tt><a href="is_straight_line_drawing.html">is_straight_line_drawing</a></tt> 
 to verify that the resulting graph is planar.
 <p>
-If the graph is not planar, a set of edges that forms a Kuratowski subgraph in
-the original graph can be produced. This set of edges can be passed to the
+If the graph is not planar, a set of edges that forms a Kuratowski subgraph in 
+the original graph can be produced. This set of edges can be passed to the 
 function <tt><a href="is_kuratowski_subgraph.html">is_kuratowski_subgraph</a>
-</tt> to verify that they can be contracted into a <i>K<sub>5</sub></i> or
-<i>K<sub>3,3</sub></i>. <tt>boyer_myrvold_planarity_test</tt> chooses the set
-of edges forming the Kuratowski subgraph in such a way that the contraction to
-a <i>K<sub>5</sub></i> or <i>K<sub>3,3</sub></i> can be done by a simple
-deterministic process which is described in the documentation to
+</tt> to verify that they can be contracted into a <i>K<sub>5</sub></i> or 
+<i>K<sub>3,3</sub></i>. <tt>boyer_myrvold_planarity_test</tt> chooses the set 
+of edges forming the Kuratowski subgraph in such a way that the contraction to 
+a <i>K<sub>5</sub></i> or <i>K<sub>3,3</sub></i> can be done by a simple 
+deterministic process which is described in the documentation to 
 <tt>is_kuratowski_subgraph</tt>.

 <H3>Where Defined</H3>
@@ -170,8 +170,8 @@ deterministic process which is described in the documentation to
 IN: <tt>Graph&amp; g</tt>

 <blockquote>
-Any undirected graph. The graph type must be a model of
-<a href="VertexAndEdgeListGraph.html">VertexAndEdgeListGraph</a> and
+Any undirected graph. The graph type must be a model of 
+<a href="VertexAndEdgeListGraph.html">VertexAndEdgeListGraph</a> and 
 <a href="IncidenceGraph.html">IncidenceGraph</a>.
 </blockquote>

@@ -184,7 +184,7 @@ Must model the <a href="PlanarEmbedding.html">PlanarEmbedding</a> concept.
 IN <tt>OutputIterator kuratowski_subgraph</tt>

 <blockquote>
-An OutputIterator which accepts values of the type
+An OutputIterator which accepts values of the type 
 <tt>graph_traits&lt;Graph&gt;::edge_descriptor</tt>
 </blockquote>

@@ -192,7 +192,7 @@ IN <tt>VertexIndexMap vm</tt>

 <blockquote>
 A <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map
-</a> that maps vertices from <tt>g</tt> to distinct integers in the range
+</a> that maps vertices from <tt>g</tt> to distinct integers in the range 
 <tt>[0, num_vertices(g) )</tt><br>
 <b>Default</b>: <tt>get(vertex_index,g)</tt><br>
 </blockquote>
@@ -201,21 +201,21 @@ IN <tt>EdgeIndexMap em</tt>

 <blockquote>
 A <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map
-</a> that maps edges from <tt>g</tt> to distinct integers in the range
+</a> that maps edges from <tt>g</tt> to distinct integers in the range 
 <tt>[0, num_edges(g) )</tt><br>
-<b>Default</b>: <tt>get(edge_index,g)</tt>, but this parameter is only used if
+<b>Default</b>: <tt>get(edge_index,g)</tt>, but this parameter is only used if 
 the <tt>kuratowski_subgraph_iterator</tt> is provided.<br>
 </blockquote>

 <H3>Complexity</H3>

-Assuming that both the vertex index and edge index supplied take time
-<i>O(1)</i> to return an index and there are <i>O(n)</i>
-total self-loops and parallel edges in the graph, most combinations of
-arguments given to
-<tt>boyer_myrvold_planarity_test</tt> result in an algorithm that runs in time
-<i>O(n)</i> for a graph with <i>n</i> vertices and <i>m</i> edges. The only
-exception is when Kuratowski subgraph isolation is requested for a dense graph
+Assuming that both the vertex index and edge index supplied take time 
+<i>O(1)</i> to return an index and there are <i>O(n)</i> 
+total self-loops and parallel edges in the graph, most combinations of 
+arguments given to 
+<tt>boyer_myrvold_planarity_test</tt> result in an algorithm that runs in time 
+<i>O(n)</i> for a graph with <i>n</i> vertices and <i>m</i> edges. The only 
+exception is when Kuratowski subgraph isolation is requested for a dense graph 
 (a graph with <i>n = o(m)</i>) - the running time will be <i>O(n+m)</i>
 <a href = "#2">[2]</a>.

@@ -224,9 +224,9 @@ exception is when Kuratowski subgraph isolation is requested for a dense graph
 <P>
 <ul>
 <li><a href="../example/simple_planarity_test.cpp">A simple planarity test</a>
-<li><a href="../example/kuratowski_subgraph.cpp">Isolating a Kuratowski
+<li><a href="../example/kuratowski_subgraph.cpp">Isolating a Kuratowski 
 Subgraph</a>
-<li><a href="../example/straight_line_drawing.cpp">Using a planar embedding to
+<li><a href="../example/straight_line_drawing.cpp">Using a planar embedding to 
 create a straight line drawing</a>
 </ul>

@@ -237,17 +237,17 @@ create a straight line drawing</a>

 <h3>Notes</h3>

-<p><a name="1">[1] A planar embedding is also called a <i>combinatorial
+<p><a name="1">[1] A planar embedding is also called a <i>combinatorial 
 embedding</i>.

-<p><a name="2">[2] The algorithm can still be made to run in time <i>O(n)</i>
-for this case, if needed. <a href="planar_graphs.html#EulersFormula">Euler's
+<p><a name="2">[2] The algorithm can still be made to run in time <i>O(n)</i> 
+for this case, if needed. <a href="planar_graphs.html#EulersFormula">Euler's 
 formula</a> implies that a planar graph with <i>n</i> vertices can have no more
-than <i>3n - 6</i> edges, which means that any non-planar graph on <i>n</i>
-vertices has a subgraph of only <i>3n - 5</i> edges that contains a Kuratowski
-subgraph. So, if you need to find a Kuratowski subgraph of a graph with more
-than <i>3n - 5</i> edges in time <i>O(n)</i>, you can create a subgraph of the
-original graph consisting of any arbitrary <i>3n - 5</i> edges and pass that
+than <i>3n - 6</i> edges, which means that any non-planar graph on <i>n</i> 
+vertices has a subgraph of only <i>3n - 5</i> edges that contains a Kuratowski 
+subgraph. So, if you need to find a Kuratowski subgraph of a graph with more 
+than <i>3n - 5</i> edges in time <i>O(n)</i>, you can create a subgraph of the 
+original graph consisting of any arbitrary <i>3n - 5</i> edges and pass that 
 graph to <tt>boyer_myrvold_planarity_test</tt>.


@@ -256,4 +256,4 @@ graph to <tt>boyer_myrvold_planarity_test</tt>.
 Copyright &copy; 2007 Aaron Windsor (<a href="mailto:aaron.windsor@gmail.com">
 aaron.windsor@gmail.com</a>)
 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000, 2001
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Breadth-First Search</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -24,15 +24,15 @@
 <PRE>
 <i>// named parameter version</i>
 template &lt;class Graph, class P, class T, class R&gt;
-void breadth_first_search(Graph& G,
-  typename graph_traits&lt;Graph&gt;::vertex_descriptor s,
+void breadth_first_search(Graph& G, 
+  typename graph_traits&lt;Graph&gt;::vertex_descriptor s, 
  const bgl_named_params&lt;P, T, R&gt;&amp; params);

 <i>// non-named parameter version</i>
-template &lt;class Graph, class Buffer, class BFSVisitor,
+template &lt;class Graph, class Buffer, class BFSVisitor, 
 	  class ColorMap&gt;
-void breadth_first_search(const Graph&amp; g,
-   typename graph_traits&lt;Graph&gt;::vertex_descriptor s,
+void breadth_first_search(const Graph&amp; g, 
+   typename graph_traits&lt;Graph&gt;::vertex_descriptor s, 
   Buffer&amp; Q, BFSVisitor vis, ColorMap color);
 </PRE>

@@ -70,25 +70,25 @@ BFS algorithm is a listed below.
 <pre>
 BFS(<i>G</i>, <i>s</i>)
  <b>for</b> each vertex <i>u in V[G]</i>
-    <i>color[u] :=</i> WHITE
-    <i>d[u] := infinity</i>
-    <i>p[u] := u</i>
+    <i>color[u] :=</i> WHITE 
+    <i>d[u] := infinity</i> 
+    <i>p[u] := u</i> 
  <b>end for</b>
-  <i>color[s] :=</i> GRAY
-  <i>d[s] := 0</i>
+  <i>color[s] :=</i> GRAY 
+  <i>d[s] := 0</i> 
  ENQUEUE(<i>Q</i>, <i>s</i>)
-  <b>while</b> (<i>Q != &Oslash;</i>)
+  <b>while</b> (<i>Q != &Oslash;</i>) 
    <i>u :=</i> DEQUEUE(Q)
    <b>for</b> each vertex <i>v in Adj[u]</i>
      <b>if</b> (<i>color[v] =</i> WHITE)
-        <i>color[v] :=</i> GRAY
-        <i>d[v] := d[u] + 1</i>
-        <i>p[v] := u</i>
+        <i>color[v] :=</i> GRAY 
+        <i>d[v] := d[u] + 1</i>  
+        <i>p[v] := u</i>  
        ENQUEUE(<i>Q</i>, <i>v</i>)
      <b>else</b>
-        <b>if</b> (<i>color[v] =</i> GRAY)
+        <b>if</b> (<i>color[v] =</i> GRAY) 
          ...
-        <b>else</b>
+        <b>else</b> 
          ...
    <b>end for</b>
    <i>color[u] :=</i> BLACK
@@ -99,29 +99,29 @@ BFS(<i>G</i>, <i>s</i>)
 <td valign="top">
 <pre>

-initialize vertex <i>u</i>
+initialize vertex <i>u</i> 






-discover vertex <i>s</i>
+discover vertex <i>s</i> 

-examine vertex <i>u</i>
+examine vertex <i>u</i> 
 examine edge <i>(u,v)</i>
-<i>(u,v)</i> is a tree edge
+<i>(u,v)</i> is a tree edge 



-discover vertex <i>v</i>
+discover vertex <i>v</i> 
 <i>(u,v)</i> is a non-tree edge

-<i>(u,v)</i> has a gray target
+<i>(u,v)</i> has a gray target 

-<i>(u,v)</i> has a black target
+<i>(u,v)</i> has a black target 

-finish vertex <i>u</i>
+finish vertex <i>u</i> 
 </pre>
 </tr>
 </table>
@@ -223,7 +223,7 @@ IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt>
  <b>Default:</b> <tt>get(vertex_index, g)</tt>.
    Note: if you use this default, make sure your graph has
    an internal <tt>vertex_index</tt> property. For example,
-    <tt>adjacency_list</tt> with <tt>VertexList=listS</tt> does
+    <tt>adjacenty_list</tt> with <tt>VertexList=listS</tt> does
    not have an internal <tt>vertex_index</tt> property.<br>

  <b>Python</b>: Unsupported parameter.
@@ -244,7 +244,7 @@ UTIL: <tt>buffer(Buffer&amp; Q)</tt>
  <b>Python</b>: The buffer must derive from the <a
  href="./Buffer.html">Buffer</a> type for the graph.

-</blockquote>
+</blockquote>  


 <H3><A NAME="SECTION001330300000000000000">
@@ -252,7 +252,7 @@ Complexity</A>
 </H3>

 <P>
-The time complexity is <i>O(E + V)</i>.
+The time complexity is <i>O(E + V)</i>. 

 <P>

@@ -260,13 +260,13 @@ The time complexity is <i>O(E + V)</i>.

 <ul>
 <li><b><tt>vis.initialize_vertex(v, g)</tt></b> is invoked on every vertex
-  before the start of the search.
+  before the start of the search. 

 <li><b><tt>vis.examine_vertex(u, g)</tt></b>r is invoked in each
  vertex as it is removed from the queue.

 <li><b><tt>vis.examine_edge(e, g)</tt></b> is invoked on every out-edge
-  of each vertex immediately after the vertex is removed from the queue.
+  of each vertex immediately after the vertex is removed from the queue. 

 <li><b><tt>vis.tree_edge(e, g)</tt></b> is invoked (in addition to
  <tt>examine_edge()</tt>) if the edge is a tree edge. The
@@ -275,20 +275,20 @@ The time complexity is <i>O(E + V)</i>.
 <li><b><tt>vis.discover_vertex(u, g)</tt></b> is invoked the first time the
  algorithm encounters vertex <i>u</i>. All vertices closer to the
  source vertex have been discovered, and vertices further from the
-  source have not yet been discovered.
+  source have not yet been discovered. 

 <li><b><tt>vis.non_tree_edge(e, g)</tt></b> is invoked (in addition to
-  <tt>examine_edge()</tt>) if the edge is not a tree edge.
+  <tt>examine_edge()</tt>) if the edge is not a tree edge. 

 <li><b><tt>vis.gray_target(e, g)</tt></b> is invoked (in addition to
  <tt>non_tree_edge()</tt>) if the target vertex is colored gray at the
  time of examination. The color gray indicates that
-  the vertex is currently in the queue.
+  the vertex is currently in the queue. 

 <li><b><tt>vis.black_target(e, g)</tt></b> is invoked (in addition to
  <tt>non_tree_edge()</tt>) if the target vertex is colored black at the
  time of examination. The color black indicates that the
-  vertex is no longer in the queue.
+  vertex is no longer in the queue. 

 <li><b><tt>vis.finish_vertex(u, g)</tt></b> is invoked after all of the out
  edges of <i>u</i> have been examined and all of the adjacent vertices
@@ -305,7 +305,7 @@ The example in <a
 href="../example/bfs-example.cpp"><TT>example/bfs-example.cpp</TT></a>
 demonstrates using the BGL Breadth-first search algorithm on the graph
 from <A HREF="./graph_theory_review.html#fig:bfs-example">Figure
-6</A>. The file
+5</A>. The file
 <a href="../example/bfs-example2.cpp"><TT>example/bfs-example2.cpp</TT></a>
 contains the same example, except that the <tt>adacency_list</tt>
 class used has <tt>VertexList</tt> and <tt>EdgeList</tt> set
@@ -319,7 +319,7 @@ to <tt>listS</tt>.

 <h3>Notes</h3>

-<p><a name="1">[1]</a>
+<p><a name="1">[1]</a> 
  Since the visitor parameter is passed by value, if your visitor
  contains state then any changes to the state during the algorithm
  will be made to a copy of the visitor object, not the visitor object
@@ -335,4 +335,4 @@ to <tt>listS</tt>.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000, 2001
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Breadth-First Visit</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -22,14 +22,14 @@
 <P>
 <PRE>
  template &lt;class <a href="./IncidenceGraph.html">IncidenceGraph</a>, class P, class T, class R&gt;
-  void breadth_first_visit(IncidenceGraph& G,
-    typename graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor s,
+  void breadth_first_visit(IncidenceGraph& G, 
+    typename graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor s, 
    const bgl_named_params&lt;P, T, R&gt;&amp; params);

  template &lt;class <a href="./IncidenceGraph.html">IncidenceGraph</a>, class <a href="./Buffer.html">Buffer</a>, class <a href="./BFSVisitor.html">BFSVisitor</a>, class ColorMap&gt;
  void breadth_first_visit
-    (const IncidenceGraph&amp; g,
-     typename graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor s,
+    (const IncidenceGraph&amp; g, 
+     typename graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor s, 
     Buffer&amp; Q, BFSVisitor vis, ColorMap color)
 </PRE>

@@ -110,7 +110,7 @@ UTIL: <tt>buffer(Buffer&amp; Q)</tt>

  <b>Python</b>: The buffer must derive from the <a
  href="./Buffer.html">Buffer</a> type for the graph.
-</blockquote>
+</blockquote>  


 <H3><A NAME="SECTION001330300000000000000">
@@ -118,7 +118,7 @@ Complexity</A>
 </H3>

 <P>
-The time complexity is <i>O(E)</i>.
+The time complexity is <i>O(E)</i>. 

 <P>

@@ -129,7 +129,7 @@ The time complexity is <i>O(E)</i>.
  vertex as it is removed from the queue.

 <li><b><tt>vis.examine_edge(e, g)</tt></b> is invoked on every out-edge
-  of each vertex immediately after the vertex is removed from the queue.
+  of each vertex immediately after the vertex is removed from the queue. 

 <li><b><tt>vis.tree_edge(e, g)</tt></b> is invoked (in addition to
  <tt>examine_edge()</tt>) if the edge is a tree edge. The
@@ -138,20 +138,20 @@ The time complexity is <i>O(E)</i>.
 <li><b><tt>vis.discover_vertex(u, g)</tt></b> is invoked the first time the
  algorithm encounters vertex <i>u</i>. All vertices closer to the
  source vertex have been discovered, and vertices further from the
-  source have not yet been discovered.
+  source have not yet been discovered. 

 <li><b><tt>vis.non_tree_edge(e, g)</tt></b> is invoked (in addition to
-  <tt>examine_edge()</tt>) if the edge is not a tree edge.
+  <tt>examine_edge()</tt>) if the edge is not a tree edge. 

 <li><b><tt>vis.gray_target(e, g)</tt></b> is invoked (in addition to
  <tt>non_tree_edge()</tt>) if the target vertex is colored gray at the
  time of examination. The color gray indicates that
-  the vertex is currently in the queue.
+  the vertex is currently in the queue. 

 <li><b><tt>vis.black_target(e, g)</tt></b> is invoked (in addition to
  <tt>non_tree_edge()</tt>) if the target vertex is colored black at the
  time of examination. The color black indicates that the
-  vertex is no longer in the queue.
+  vertex is no longer in the queue. 

 <li><b><tt>vis.finish_vertex(u, g)</tt></b> is invoked after all of the out
  edges of <i>u</i> have been examined and all of the adjacent vertices
@@ -167,7 +167,7 @@ The time complexity is <i>O(E)</i>.

 <h3>Notes</h3>

-<p><a name="1">[1]</a>
+<p><a name="1">[1]</a> 
  Since the visitor parameter is passed by value, if your visitor
  contains state then any changes to the state during the algorithm
  will be made to a copy of the visitor object, not the visitor object
@@ -183,4 +183,4 @@ The time complexity is <i>O(E)</i>.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -8,59 +8,57 @@

   For more information, see http://www.boost.org
 -->
-<head>
-<title>Bundled Properties</title>
-</head>
+  <head>
+    <title>Bundled Properties</title>
+  </head>

-<body BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-  ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-ALT="C++ Boost" width="277" height="86"/>
-<h1>Bundled Properties</h1>
+  <body BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000">
+    <IMG SRC="../../../boost.png" 
+      ALT="C++ Boost" width="277" height="86"/> 
+    <h1>Bundled Properties</h1>

-<p>Class templates <code><a
-href="adjacency_list.html">adjacency_list</a></code> and
-<code><a href="adjacency_matrix.html">adjacency_matrix</a></code> support
-the introduction of named properties via <a
-href="using_adjacency_list.html#sec:adjacency-list-properties">internal
-properties</a>. However, this method is cumbersome in many uses,
-where it would be more intuitive to just specify a structure or
-class that contains internal properties for edges or
-vertices. Bundled properties allow one to use
-<code>adjacency_list</code> and <code>adjacency_matrix</code> in this
-manner, providing a simple
-way to introduce and access any number of internal properties
-for vertices and edges.</p>
+      <p>Class templates <code><a
+      href="adjacency_list.html">adjacency_list</a></code> and 
+	  <code><a href="adjacency_matrix.html">adjacency_matrix</a></code> support
+      the introduction of named properties via <a
+      href="using_adjacency_list.html#sec:adjacency-list-properties">internal
+      properties</a>. However, this method is cumbersome in many uses,
+      where it would be more intuitive to just specify a structure or
+      class that contains internal properties for edges or
+      vertices. Bundled properties allow one to use
+      <code>adjacency_list</code> and <code>adjacency_matrix</code> in this 
+	  manner, providing a simple
+      way to introduce and access any number of internal properties
+      for vertices and edges.</p>

-<p>One can introduce bundled properties into an
-either graph type by providing a user-defined class
-type for the <code>VertexProperties</code> or
-<code>EdgeProperties</code> template arguments. The user-defined
-class may alternatively be placed at the end of a
-<code>property</code> list, replacing the (implicit)
-<code>boost::no_property</code> argument.</p>
+      <p>One can introduce bundled properties into an
+      either graph type by providing a user-defined class
+      type for the <code>VertexProperties</code> or
+      <code>EdgeProperties</code> template arguments. The user-defined
+      class may alternatively be placed at the end of a
+      <code>property</code> list, replacing the (implicit)
+      <code>boost::no_property</code> argument.</p>

-<h2>Example: Route planning</h2>
-<p>Consider the implementation of a simple route planner that
-  should find the shortest directions from one city to another
-  via a set of highways. The vertices of the graph are cities,
-  and we may wish to store several bits of information about the
-  city within each vertex:</p>
-<pre>
+      <h2>Example: Route planning</h2>
+      <p>Consider the implementation of a simple route planner that
+        should find the shortest directions from one city to another
+        via a set of highways. The vertices of the graph are cities,
+        and we may wish to store several bits of information about the
+        city within each vertex:</p>
+      <pre>
 struct City
 {
  string name;
  int population;
  vector&lt;int&gt; zipcodes;
 };
-</pre>
+      </pre>
+      
+      <p>The edges in the graph represent highways, which also have
+        several interesting attributes:</p>

-<p>
-The edges in the graph represent highways, which also have several interesting
-attributes:
-</p>
-
-<pre>
+      <pre>
 struct Highway
 {
  string name;
@@ -69,73 +67,41 @@ struct Highway
  int lanes;
  bool divided;
 };
-</pre>
+      </pre>

-<p>With bundled properties, we can directly use the <code>City</code> and
-<code>Highway</code> structures to define the graph:</p>
-<pre>
-typedef boost::adjacency_list&lt;
-    boost::listS, boost::vecS, boost::bidirectionalS,
-    City, Highway&gt;
-  Map;
-</pre>
-
-<p>Without bundled properties, translating this example directly
-into an instantiation of <code>adjacency_list</code> would
-involve several custom properties and would result in a type
-like this:</p>
-<pre>
+      <p>Without bundled properties, translating this example directly
+      into an instantiation of <code>adjacency_list</code> would
+      involve several custom properties and would result in a type
+      like this:</p>
+      <pre>
 typedef boost::adjacency_list&lt;
    boost::listS, boost::vecS, boost::bidirectionalS,
    // Vertex properties
-    boost::property&lt;boost::vertex_name_t, std::string,
+    boost::property&lt;boost::vertex_name_t, std::string, 
    boost::property&lt;population_t, int,
    boost::property&lt;zipcodes_t, std::vector&lt;int&gt; &gt; &gt; &gt;,
    // Edge properties
    boost::property&lt;boost::edge_name_t, std::string,
-    boost::property&lt;boost::edge_weight_t, double,
+    boost::property&lt;boost::edge_length_t, double,
    boost::property&lt;edge_speed_limit_t, int,
    boost::property&lt;edge_lanes_t, int,
    boost::property&lt;edge_divided, bool&gt; &gt; &gt; &gt; &gt; &gt;
  Map;
-</pre>
+      </pre>

-<p>
-Bundling vertex and edge properties greatly simplifies the declaration of
-graphs.
-</p>
-<p>
-In addition to vertex and edge bundles, we can also bundle properties of the
-graph itself. Suppopse we extend the application to include a portfolio of
-route-planning maps for different countries. In addition to the <code>City</code>
-and <code>Highway</code> bundles above, we can declare a graph bundle,
-<code>Country</Code>.
-</p>
-
-<pre>
-struct Country {
-  string name;
-  bool use_right;   // Drive on the left or right
-  bool use_metric;  // mph or km/h
-};
-</pre>
-
-<p>The graph would now be declared as:</p>
-
-<pre>
-<pre>
+      <p>With bundled properties, we can directly use the
+        <code>City</code> and <code>Highway</code> structures:</p>
+      <pre>
 typedef boost::adjacency_list&lt;
    boost::listS, boost::vecS, boost::bidirectionalS,
-    City, Highway, Country&gt;
-  Map;
-</pre>
-</pre>
+    City, Highway&gt; Map;
+      </pre>

-<h2>Accessing bundled properties</h2>
-<p>To access a bundled property for a particular edge or vertex,
-  subscript your graph with the descriptor of the edge or vertex
-  whose bundled property you wish to access. For instance:</p>
-<pre>
+    <h2>Accessing bundled properties</h2>
+    <p>To access a bundled property for a particular edge or vertex,
+        subscript your graph with the descriptor of the edge or vertex
+        whose bundled property you wish to access. For instance:</p>
+    <pre>
 Map map; // load the map
 Map::vertex_descriptor v = *vertices(map).first;
 map[v].name = "Troy";
@@ -143,86 +109,70 @@ map[v].population = 49170;
 map[v].zipcodes.push_back(12180);
 Map::edge_descriptor e = *out_edges(v, map).first;
 map[e].name = "I-87";
-map[e].miles = 10.;
+map[e].miles = 10;
 map[e].speed_limit = 65;
 map[e].lanes = 4;
 map[e].divided = true;
-</pre>
+    </pre>

-<p>
-The graph bundle, since it does not correspond to a vertex or edge descripor
-is accessed using the graph_bundle object as a key.
-</p>
-
-<pre>
-map[graph_bundle].name = "United States";
-map[graph_bundle].use_right = true;
-map[graph_bundle].use_metric = false;
-</pre>
-
-
-<h2>Properties maps from bundled properties</h2>
-<p>Often one needs to create a property map from an internal
-  property for use in a generic algorithm. For instance, using the
-  graph without bundled properties we might invoke <a
-    href="dijkstra_shortest_paths.html">Dijkstra's shortest
-    paths</a> algorithm like this:</p>
-<pre>
+    <h2>Properties maps from bundled properties</h2>
+    <p>Often one needs to create a property map from an internal
+      property for use in a generic algorithm. For instance, using the
+      graph without bundled properties we might invoke <a
+        href="dijkstra_shortest_paths.html">Dijkstra's shortest
+        paths</a> algorithm like this:</p>
+    <pre>
 vector&lt;double&gt; distances(num_vertices(map));
 dijkstra_shortest_paths(map, from,
      weight_map(get(edge_length, map))
      .distance_map(make_iterator_property_map(distances.begin(),
                                               get(vertex_index, map))));
-</pre>
+    </pre>

-<p>With bundled properties, we can just pass a <em>member pointer</em>
-as the property for <code>get</code>. The equivalent example using bundled
-properties is:</p>
-<pre>
+    <p>With bundled properties, we can just pass a <em>member pointer</em>
+	  as the property for <code>get</code>. The equivalent example
+      using bundled properties is:</p>
+    <pre>
 vector&lt;double&gt; distances(num_vertices(map));
 dijkstra_shortest_paths(map, from,
      weight_map(get(<font color="#ff0000">&amp;Highway::miles</font>, map))
      .distance_map(make_iterator_property_map(distances.begin(),
                                               get(vertex_index, map))));
-</pre>
+    </pre>

-<p>The type of the returned property map is <code>property_map&lt;Map, double Highway::*&gt;::type</code>
-or <code>property_map&lt;Map, double Highway::*&gt;::const_type</code>, depending on whether the graph
-<code>map</code> is non-constant or constant.
+    <p>The type of the returned property map is <code>property_map&lt;Map, int Highway::*&gt;::type</code> 
+	or <code>property_map&lt;Map, int Highway::*&gt;::const_type</code>, depending on whether the graph 
+	<code>map</code> is non-constant or constant.
+	
+    <p> You may also access the entire vertex or edge bundle as a property map 
+	using the <code>vertex_bundle</code> or <code>edge_bundle</code> properties,
+	respectively. For instance, the property map returned by <code>get(vertex_bundle, map)</code> is
+	an <a href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property Map</a> providing access to the
+	<code>City</code> values stored in each vertex.

-<p> You may also access the entire vertex or edge bundle as a property map
-using the <code>vertex_bundle</code> or <code>edge_bundle</code> properties,
-respectively. For instance, the property map returned by <code>get(vertex_bundle, map)</code> is
-an <a href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property Map</a> providing access to the
-<code>City</code> values stored in each vertex.
+    <h2>Getting the type of bundled properties</h2>

-<h2>Property maps for a graph bundle</h2>
-There is currently no support for creating property maps from the bundled
-properties of a graph.
+    <p>To get the type of the vertex or edge bundle for a given graph
+    type <tt>Graph</tt>, you can use the trait
+    classes <tt>vertex_bundle_type</tt>
+    and <tt>edge_bundle_type</tt>. The
+    type <tt>vertex_bundle_type&lt;Graph&gt;::type</tt> will be the
+    type bundled with vertices (or <tt>no_vertex_bundle</tt> if the
+    graph supports bundles but no vertex bundle
+    exists). Likewise, <tt>edge_bundle_type&lt;Graph&gt;::type</tt>
+    will be the type bundled with edges (or <tt>no_edge_bundle</tt> if
+    no edge bundle exists).</p>

-<h2>Getting the type of bundled properties</h2>
+    <h2>Compatibility</h2> <p>Bundled properties will only work
+    properly on compilers that support class template partial
+    specialization.</p>

-<p>To get the type of the vertex or edge bundle for a given graph
-type <tt>Graph</tt>, you can use the trait
-classes <tt>vertex_bundle_type</tt>
-and <tt>edge_bundle_type</tt>. The
-type <tt>vertex_bundle_type&lt;Graph&gt;::type</tt> will be the
-type bundled with vertices (or <tt>no_vertex_bundle</tt> if the
-graph supports bundles but no vertex bundle
-exists). Likewise, <tt>edge_bundle_type&lt;Graph&gt;::type</tt>
-will be the type bundled with edges (or <tt>no_edge_bundle</tt> if
-no edge bundle exists).</p>
-
-<h2>Compatibility</h2> <p>Bundled properties will only work
-properly on compilers that support class template partial
-specialization.</p>
-
-<hr>
+    <hr>
 Copyright &copy; 2004 <a href="http://www.boost.org/people/doug_gregor.html">Doug Gregor</a>.
-<address><a href="mailto:gregod@cs.rpi.edu"></a></address>
+    <address><a href="mailto:gregod@cs.rpi.edu"></a></address>
 <!-- Created: Fri May  7 09:59:21 EDT 2004 -->
 <!-- hhmts start -->
 Last modified: Fri May  7 10:56:01 EDT 2004
 <!-- hhmts end -->
-</body>
+  </body>
 </html>
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Challenge</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -37,18 +37,18 @@ review. The pending items are:</li>
     <tt>mutable_queue.hpp</tt>, <tt>fibonacci_heap.hpp</tt>.
      Somehow merge implementation with Dietmer's heaps and queues.</li>

-   <li><tt>disjoint_sets</tt> (see <a href="disjoint_sets.html">Disjoint Sets</a>)</li>
+   <li><tt>disjoint_sets</tt> </li>
  </ul>

 <li>Construct a set of planar graph algorithms.</li>
  <ul>
   <li> Is the graph planar?</li>
-   <li> &quot;Walk around the block&quot; and similar open and closed neighborhood
-traversals. Note that edge traversals need to resolve to particular ends
+   <li> &quot;Walk around the block&quot; and similar open and closed neighborhood 
+traversals. Note that edge traversals need to resolve to particular ends 
 and sides (see below), not just to the edge as a whole.</li>
-   <li> Given a point, find the nearest vertex, edge, or bounded polygon.
+   <li> Given a point, find the nearest vertex, edge, or bounded polygon. 
 Again, edges are viewed as having left and right sides.</li>
-   <li> Given a line segment, find intersecting vertices, edges, or bounded
+   <li> Given a line segment, find intersecting vertices, edges, or bounded 
 polygons.</li>
   <li> Given a polygon, find intersecting whatever...</li>
   <li> Various minimum bounding rectangle and clipping problems.</li>
@@ -61,12 +61,12 @@ polygons.</li>
 <li>Rewrite the Qhull algorithm using the Boost Graph Library (this is
 high difficulty challenge).  Or, for a more manageable challenge,
 write an interface for Qhull with the BGL.  <a
-href="http://www.qhull.org/">Qhull</a> computes the
+href="http://www.geom.umn.edu/locate/qhull">Qhull</a> computes the
 convex hull, Delaunay triangulation, Voronoi diagram, and halfspace
 intersection about a point.  Qhull runs in 2-d, 3-d, 4-d, and higher
 dimensions.  Qhull is used for collision detection, animation, plate
 tectonics, 3-d modeling, robot motion planning, and other <a
-href="http://www.qhull.org/news/qhull-news.html#users">applications</a>.
+href="http://www.geom.umn.edu/~bradb/qhull-news.html#use">applications</a>.
 It is currently difficult to use from a C++ program.

 </li>
@@ -117,4 +117,4 @@ It is currently difficult to use from a C++ program.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,14 +1,14 @@
 <html><!--
     Copyright (c) 2004 Trustees of Indiana University
-
+    
     Distributed under 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)
  -->
 <head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"><title>Function template circle_graph_layout</title></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><table cellpadding="2" width="100%"><td valign="top"><img src="../../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td><td align="center"><a href="../../../index.htm">Home</a></td><td align="center"><a href="../../libraries.htm">Libraries</a></td><td align="center"><a href="http://www.boost.org/people/people.htm">People</a></td><td align="center"><a href="http://www.boost.org/more/faq.htm">FAQ</a></td><td align="center"><a href="../../../more/index.htm">More</a></td></table><hr><div class="refentry" lang="en"><a name="id103562-bb"></a><div class="titlepage"><div></div><div></div></div><div class="refnamediv"><h2><img src="figs/python.gif" alt="(Python)"/><span class="refentrytitle">Function template circle_graph_layout</span></h2><p>boost::circle_graph_layout &#8212; Layout the graph with the vertices at the points of a regular n-polygon. </p></div><h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2><div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis">
-<span class="bold"><b>template</b></span>&lt;<span class="bold"><b>typename</b></span> VertexListGraph, <span class="bold"><b>typename</b></span> PositionMap, <span class="bold"><b>typename</b></span> Radius&gt;
-  <span class="type"><span class="bold"><b>void</b></span></span> circle_graph_layout(<span class="bold"><b>const</b></span> VertexListGraph &amp; g, PositionMap position,
-                           Radius radius);</pre></div><div class="refsect1" lang="en"><a name="id821794"></a><h2>Where Defined</h2><a href="../../../boost/graph/circle_layout.hpp">boost/graph/circle_layout.hpp</a><h2>Description</h2><p>The distance from the center of the polygon to each point is determined by the <tt class="computeroutput">radius</tt>  parameter. The <tt class="computeroutput">position</tt>  parameter must be an Lvalue Property Map whose value type is a class type containing <tt class="computeroutput">x</tt>  and <tt class="computeroutput">y</tt>  members that will be set to the <tt class="computeroutput">x</tt>  and <tt class="computeroutput">y</tt>  coordinates.
+<span class="bold"><b>template</b></span>&lt;<span class="bold"><b>typename</b></span> VertexListGraph, <span class="bold"><b>typename</b></span> PositionMap, <span class="bold"><b>typename</b></span> Radius&gt; 
+  <span class="type"><span class="bold"><b>void</b></span></span> circle_graph_layout(<span class="bold"><b>const</b></span> VertexListGraph &amp; g, PositionMap position, 
+                           Radius radius);</pre></div><div class="refsect1" lang="en"><a name="id821794"></a><h2>Where Defined</h2><a href="../../../boost/graph/circle_layout.hpp">boost/graph/circle_layout.hpp</a><h2>Description</h2><p>The distance from the center of the polygon to each point is determined by the <tt class="computeroutput">radius</tt>  parameter. The <tt class="computeroutput">position</tt>  parameter must be an Lvalue Property Map whose value type is a class type containing <tt class="computeroutput">x</tt>  and <tt class="computeroutput">y</tt>  members that will be set to the <tt class="computeroutput">x</tt>  and <tt class="computeroutput">y</tt>  coordinates. 

          <h2>Parameters</h2>
 IN: <tt>const VertexListGraph&amp; g</tt>
@@ -45,7 +45,7 @@ IN: <tt>Radius radius</tt>
 <TR valign=top>
 <TD nowrap>Copyright &copy; 2004</TD><TD>
 <A HREF="http://www.boost.org/people/doug_gregor.html">Douglas Gregor</A>, Indiana University (dgregor -at- cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (lums -at- osl.iu.edu)
 </TD></TR></TABLE>
                           </body></html>
@@ -2,7 +2,7 @@
 <html>
 <!--
     Copyright (c) 2005-2009 Trustees of Indiana University
-
+    
     Distributed under 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)
@@ -32,12 +32,12 @@ function address(host, user) {
 </script>

  </head>
-
+  
  <body>
-    <IMG SRC="../../../boost.png"
+    <IMG SRC="../../../boost.png" 
      ALT="C++ Boost" width="277" height="86"></img>
    <h1>Compressed Sparse Row Graph</h1>
-
+          
    <p>The class template <code>compressed_sparse_row_graph</code> is
    a graph class that uses the compact Compressed Sparse Row (CSR)
    format to store directed (and bidirectional) graphs. While CSR graphs have
@@ -49,6 +49,17 @@ function address(host, user) {
    applications or for very large graphs that you do not need to
    change.</p>

+    <p>There are two interfaces to the compressed sparse row graph.  The
+    old interface requires that all out edges from a single vertex are
+    sorted by target, and does not support construction of the graph from
+    unsorted arrays of sources and targets.  The new interface has these
+    new constructors, but does not support incremental construction of the
+    graph or the <tt>edge_range()</tt> and <tt>edge()</tt> functions.  The
+    old interface is the default, but will be removed in a later version of
+    Boost.  To select the new interface, add <tt>#define
+    BOOST_GRAPH_USE_NEW_CSR_INTERFACE</tt> before including
+    <tt>&lt;boost/graph/compressed_sparse_row_graph.hpp&gt;</tt>.</p>
+        
    <p>The CSR format stores vertices and edges in separate arrays,
    with the indices into these arrays corresponding to the identifier
    for the vertex or edge, respectively. The edge array is sorted by
@@ -68,8 +79,8 @@ function address(host, user) {
    the <a href="#template-parms">template parameters</a>.  The
    <tt>Directed</tt> template parameter controls whether one edge direction
    (the default) or both directions are stored.  A directed CSR graph has
-    <tt>Directed</tt> = <tt>directedS</tt> and a bidirectional CSR graph (with
-    a limited set of constructors)
+    <tt>Directed</tt> = <tt>directedS</tt> and a bidirectional CSR graph (only
+    supported with the new interface and with a limited set of constructors)
    has <tt>Directed</tt> = <tt>bidirectionalS</tt>.</p>

    <ul>
@@ -101,8 +112,8 @@ function address(host, user) {
    <pre>
 namespace boost {

-template&lt;typename <a href="#Directed">Directed</a> = directedS, typename <a href="#VertexProperty">VertexProperty</a> = no_property,
-         typename <a href="#EdgeProperty">EdgeProperty</a> = no_property, typename <a href="#GraphProperty">GraphProperty</a> = no_property,
+template&lt;typename <a href="#Directed">Directed</a> = directedS, typename <a href="#VertexProperty">VertexProperty</a> = void, 
+         typename <a href="#EdgeProperty">EdgeProperty</a> = void, typename <a href="#GraphProperty">GraphProperty</a> = no_property, 
         typename <a href="#Vertex">Vertex</a> = std::size_t, typename <a href="#EdgeIndex">EdgeIndex</a> = Vertex&gt;
 class compressed_sparse_row_graph
 {
@@ -110,7 +121,7 @@ public:
  <i>// <a href="#constructors">Graph constructors</a></i>
  <a href="#default-const">compressed_sparse_row_graph</a>();

-  <i>// Unsorted edge list constructors </i>
+  <i>// Unsorted edge list constructors <b>(new interface only)</b></i>
  template&lt;typename InputIterator&gt;
  <a href="#edge-const">compressed_sparse_row_graph</a>(edges_are_unsorted_t,
                              InputIterator edge_begin, InputIterator edge_end,
@@ -137,7 +148,21 @@ public:
                              vertices_size_type numverts,
                              const GraphProperty&amp; prop = GraphProperty());

-  <i>// New sorted edge list constructors <b>(directed only)</b></i>
+  <i>// Old sorted edge list constructors <b>(old interface only)</b></i>
+  template&lt;typename InputIterator&gt;
+  <a href="#edge-sorted-const">compressed_sparse_row_graph</a>(InputIterator edge_begin, InputIterator edge_end,
+                              vertices_size_type numverts,
+                              edges_size_type numedges = 0,
+                              const GraphProperty&amp; prop = GraphProperty());
+
+  template&lt;typename InputIterator, typename EdgePropertyIterator&gt;
+  <a href="#edge-sorted-prop-const">compressed_sparse_row_graph</a>(InputIterator edge_begin, InputIterator edge_end,
+                              EdgePropertyIterator ep_iter,
+                              vertices_size_type numverts,
+                              edges_size_type numedges = 0,
+                              const GraphProperty&amp; prop = GraphProperty());
+
+  <i>// New sorted edge list constructors <b>(both interfaces, directed only)</b></i>
  template&lt;typename InputIterator&gt;
  <a href="#edge-sorted-const">compressed_sparse_row_graph</a>(edges_are_sorted_t,
                              InputIterator edge_begin, InputIterator edge_end,
@@ -153,7 +178,7 @@ public:
                              edges_size_type numedges = 0,
                              const GraphProperty&amp; prop = GraphProperty());

-  <i>// In-place unsorted edge list constructors <b>(directed only)</b></i>
+  <i>// In-place unsorted edge list constructors <b>(new interface and directed only)</b></i>
  template&lt;typename InputIterator&gt;
  <a href="#edge-inplace-const">compressed_sparse_row_graph</a>(construct_inplace_from_sources_and_targets_t,
                              std::vector&lt;vertex_descriptor&gt;&amp; sources,
@@ -169,11 +194,11 @@ public:
                              vertices_size_type numverts,
                              const GraphProperty&amp; prop = GraphProperty());

-  <i>// Miscellaneous constructors <b>(directed only)</b></i>
+  <i>// Miscellaneous constructors <b>(both interfaces, directed only)</b></i>
  template&lt;typename Graph, typename VertexIndexMap&gt;
  <a href="#graph-const">compressed_sparse_row_graph</a>(const Graph&amp; g, const VertexIndexMap&amp; vi,
                              vertices_size_type numverts,
-                              edges_size_type numedges);
+                              edges_size_type numedges); 

  template&lt;typename Graph, typename VertexIndexMap&gt;
  compressed_sparse_row_graph(const Graph&amp; g, const VertexIndexMap&amp; vi);
@@ -181,7 +206,7 @@ public:
  template&lt;typename Graph&gt;
  explicit <a href="#graph-const">compressed_sparse_row_graph</a>(const Graph&amp; g);

-  <i>// <a href="#mutators">Graph mutators <b>(directed only)</b></a></i>
+  <i>// <a href="#mutators">Graph mutators <b>(both interfaces, directed only)</b></a></i>
  template&lt;typename Graph, typename VertexIndexMap&gt;
  void <a href="#assign">assign</a>(const Graph&amp; g, const VertexIndexMap&amp; vi,
              vertices_size_type numverts, edges_size_type numedges);
@@ -192,46 +217,51 @@ public:
  template&lt;typename Graph&gt;
  void <a href="#assign">assign</a>(const Graph&amp; g);

-  <i>// <a href="#property-access">Property Access</a></i>
+  <i>// <a href="#property-access">Property Access <b>(both interfaces)</b></a></i>
  VertexProperty&amp; <a href="#vertex-subscript">operator[]</a>(vertex_descriptor v);
  const VertexProperty&amp; <a href="#vertex-subscript">operator[]</a>(vertex_descriptor v) const;
  EdgeProperty&amp; <a href="#edge-subscript">operator[]</a>(edge_descriptor v);
  const EdgeProperty&amp; <a href="#edge-subscript">operator[]</a>(edge_descriptor v) const;
 };

-<i>// <a href="IncidenceGraph.html">Incidence Graph requirements</a></i>
+<i>// <a href="IncidenceGraph.html">Incidence Graph requirements <b>(both interfaces)</b></a></i>
 vertex_descriptor source(edge_descriptor, const compressed_sparse_row_graph&amp;);
 vertex_descriptor target(edge_descriptor, const compressed_sparse_row_graph&amp;);
-std::pair&lt;out_edge_iterator, out_edge_iterator&gt;
+std::pair&lt;out_edge_iterator, out_edge_iterator&gt; 
  out_edges(vertex_descriptor, const compressed_sparse_row_graph&amp;);
 degree_size_type out_degree(vertex_descriptor v, const compressed_sparse_row_graph&amp;);

-<i>// <a href="BidirectionalGraph.html">Bidirectional Graph requirements <b>(bidirectional only)</b></a></i>
-std::pair&lt;in_edge_iterator, in_edge_iterator&gt;
+<i>// <a href="BidirectionalGraph.html">Bidirectional Graph requirements <b>(new interface and bidirectional only)</b></a></i>
+std::pair&lt;in_edge_iterator, in_edge_iterator&gt; 
  in_edges(vertex_descriptor, const compressed_sparse_row_graph&amp;);
 degree_size_type in_degree(vertex_descriptor v, const compressed_sparse_row_graph&amp;);

-<i>// <a href="AdjacencyGraph.html">Adjacency Graph requirements</a></i>
-std::pair&lt;adjacency_iterator, adjacency_iterator&gt;
+<i>// <a href="AdjacencyGraph.html">Adjacency Graph requirements <b>(both interfaces)</b></a></i>
+std::pair&lt;adjacency_iterator, adjacency_iterator&gt; 
  adjacent_vertices(vertex_descriptor, const compressed_sparse_row_graph&amp;);

-<i>// <a href="VertexListGraph.html">Vertex List Graph requirements</a></i>
+<i>// <a href="VertexListGraph.html">Vertex List Graph requirements <b>(both interfaces)</b></a></i>
 std::pair&lt;vertex_iterator, vertex_iterator&gt; vertices(const compressed_sparse_row_graph&amp;);
 vertices_size_type num_vertices(const compressed_sparse_row_graph&amp;);

-<i>// <a href="EdgeListGraph.html">Edge List Graph requirements</a></i>
+<i>// <a href="EdgeListGraph.html">Edge List Graph requirements <b>(both interfaces)</b></a></i>
 std::pair&lt;edge_iterator, edge_iterator&gt; edges(const compressed_sparse_row_graph&amp;);
 edges_size_type num_edges(const compressed_sparse_row_graph&amp;);

-<i>// <a href="#vertex-access">Vertex access</a></i>
-vertex_descriptor <a href="#vertex-lookup">vertex</a>(vertices_size_type i, const compressed_sparse_row_graph&amp;);
+<i>// <a href="#vertex-access">Vertex access <b>(both interfaces)</b></a></i>
+vertex_descriptor <a href="#vertex">vertex</a>(vertices_size_type i, const compressed_sparse_row_graph&amp;);

 <i>// <a href="#edge-access">Edge access</a></i>
-std::pair&lt;edge_descriptor, bool&gt;
+<b>(old interface only)</b>
+std::pair&lt;out_edge_iterator, out_edge_iterator&gt; 
+  <a href="#edge_range">edge_range</a>(vertex_descriptor u, vertex_descriptor v, const compressed_sparse_row_graph&amp;);
+<b>(both interfaces)</b>
+std::pair&lt;edge_descriptor, bool&gt; 
  <a href="#edge">edge</a>(vertex_descriptor u, vertex_descriptor v, const compressed_sparse_row_graph&amp;);
+<b>(both interfaces)</b>
 edge_descriptor <a href="#edge_from_index">edge_from_index</a>(edges_size_type i, const compressed_sparse_row_graph&amp;);

-<i>// <a href="#property-map-accessors">Property map accessors</a></i>
+<i>// <a href="#property-map-accessors">Property map accessors <b>(both interfaces)</b></a></i>
 template&lt;typename <a href="./PropertyTag.html">PropertyTag</a>&gt;
 property_map&lt;compressed_sparse_row_graph, PropertyTag&gt;::type
 <a href="#get">get</a>(PropertyTag, compressed_sparse_row_graph&amp; g)
@@ -260,19 +290,31 @@ void <a href="#set_property">set_property</a>(const compressed_sparse_row_graph&
                  const typename graph_property&lt;compressed_sparse_row_graph, GraphPropertyTag&gt;::type&amp; value);

 <i>// <a href="#incremental-construction-functions">Incremental construction functions</a></i>
-<b>(directed only)</b>
+<b>(old interface only)</b>
+template&lt;typename Graph&gt;
+vertex_descriptor <a href="#add_vertex">add_vertex</a>(compressed_sparse_row_graph&amp; g);
+
+<b>(old interface only)</b>
+template&lt;typename Graph&gt;
+vertex_descriptor <a href="#add_vertices">add_vertices</a>(vertices_size_type count, compressed_sparse_row_graph&amp; g);
+
+<b>(old interface only)</b>
+template&lt;typename Graph&gt;
+edge_descriptor <a href="#add_edge">add_edge</a>(vertex_descriptor src, vertex_descriptor tgt, compressed_sparse_row_graph&amp; g);
+
+<b>(new interface and directed only)</b>
 template&lt;typename InputIterator, typename Graph&gt;
 void <a href="#add_edges">add_edges</a>(InputIterator first, InputIterator last, compressed_sparse_row_graph&amp; g);

-<b>(directed only)</b>
+<b>(new interface and directed only)</b>
 template&lt;typename InputIterator, typename EPIter, typename Graph&gt;
 void <a href="#add_edges_prop">add_edges</a>(InputIterator first, InputIterator last, EPIter ep_first, EPIter ep_last, compressed_sparse_row_graph&amp; g);

-<b>(directed only)</b>
+<b>(new interface and directed only)</b>
 template&lt;typename BidirectionalIterator, typename Graph&gt;
 void <a href="#add_edges_sorted">add_edges_sorted</a>(BidirectionalIterator first, BidirectionalIterator last, compressed_sparse_row_graph&amp; g);

-<b>(directed only)</b>
+<b>(new interface and directed only)</b>
 template&lt;typename BidirectionalIterator, typename EPIter, typename Graph&gt;
 void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator first, BidirectionalIterator last, EPIter ep_iter, compressed_sparse_row_graph&amp; g);

@@ -283,7 +325,7 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator
    <p><code>&lt;<a href="../../../boost/graph/compressed_sparse_row_graph.hpp">boost/graph/compressed_sparse_row_graph.hpp</a>&gt;</code></p>

    <a name="models"></a><h2>Models</h2>
-
+    
    <p>The <tt>compressed_sparse_row_graph</tt> class template models
    (i.e., implements the requirements of) many of the
    BGL <a href="graph_concepts.html">graph concepts</a>, allowing it
@@ -317,9 +359,8 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator
      <blockquote>
        A selector that determines whether the graph will be directed,
        bidirectional or undirected. At this time, the CSR graph type
-        only supports directed and bidirectional graphs, so this value must
-        be either <code>boost::directedS</code> or
-        <code>boost::bidirectionalS</code>.<br>
+        only supports directed graphs, so this value must
+        be <code>boost::directedS</code>.<br>
        <b>Default</b>: <code>boost::directedS</code>
      </blockquote>

@@ -416,7 +457,7 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator
      edges are specified by the iterator range <code>[edge_begin,
      edge_end)</code>. The <tt>InputIterator</tt> must be a model of
      <a
-      href="http://www.boost.org/sgi/stl/InputIterator.html">InputIterator</a>
+      href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</a>
      whose <code>value_type</code> is an <code>std::pair</code> of
      integer values. These integer values are the source and target
      vertices for the edges, and must fall within the range <code>[0,
@@ -424,6 +465,7 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator
      edge_end)</code> do not need to be sorted.  This constructor uses extra
      memory to save the edge information before adding it to the graph,
      avoiding the requirement for the iterator to have multi-pass capability.
+      <b>(This function is only provided by the new interface.)</b>
    </p>

    <p class="indent">
@@ -448,7 +490,7 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator
      to the <a href="#edge-const">edge range constructor</a>, except
      that edge properties are also initialized. The type
      <tt>EdgePropertyIterator</tt> must be a model of the <a
-      href="http://www.boost.org/sgi/stl/InputIterator.html">InputIterator</a>
+      href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</a>
      concept whose <tt>value_type</tt> is convertible to
      <tt>EdgeProperty</tt>. The iterator range <tt>[ep_iter, ep_ter +
        m)</tt> will be used to initialize the properties on the edges
@@ -456,11 +498,12 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator
      <tt>edge_begin</tt> to <tt>edge_end</tt>.  This constructor uses extra
      memory to save the edge information before adding it to the graph,
      avoiding the requirement for the iterator to have multi-pass capability.
+      <b>(This function is only provided by the new interface.)</b>
    </p>

    <hr></hr>

-    <pre><a name="edge-multi-const"></a>
+    <pre><a name="edge-const"></a>
  template&lt;typename MultiPassInputIterator&gt;
  compressed_sparse_row_graph(edges_are_unsorted_multi_pass_t,
                              MultiPassInputIterator edge_begin, MultiPassInputIterator edge_end,
@@ -480,6 +523,7 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator
      numverts)</code>. The edges in <code>[edge_begin,
      edge_end)</code> do not need to be sorted.  Multiple passes will be made
      over the edge range.
+      <b>(This function is only provided by the new interface.)</b>
    </p>

    <p class="indent">
@@ -489,7 +533,7 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator

    <hr></hr>

-    <pre><a name="edge-multi-prop-const"></a>
+    <pre><a name="edge-prop-const"></a>
  template&lt;typename MultiPassInputIterator, typename EdgePropertyIterator&gt;
  compressed_sparse_row_graph(edges_are_unsorted_multi_pass_t,
                              MultiPassInputIterator edge_begin, MultiPassInputIterator edge_end,
@@ -511,6 +555,7 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator
      of the graph, where <tt>m</tt> is distance from
      <tt>edge_begin</tt> to <tt>edge_end</tt>.  Multiple passes will be made
      over the edge and property ranges.
+      <b>(This function is only provided by the new interface.)</b>
    </p>

    <hr></hr>
@@ -532,14 +577,16 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator
      <code>edges_are_sorted</code> can be used to initialize this parameter.
      The <tt>InputIterator</tt> must be a model of
      <a
-      href="http://www.boost.org/sgi/stl/InputIterator.html">InputIterator</a>
+      href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</a>
      whose <code>value_type</code> is an <code>std::pair</code> of
      integer values. These integer values are the source and target
      vertices for the edges, and must fall within the range <code>[0,
      numverts)</code>. The edges in <code>[edge_begin,
      edge_end)</code> must be sorted so that all edges originating
-      from vertex <i>i</i> precede any edges originating from all
-      vertices <i>j</i> where <i>j &gt; i</i>.
+      from vertex <i>i</i> preceed any edges originating from all
+      vertices <i>j</i> where <i>j &gt; i</i>.  <b>(The version of this
+      constructor without the <tt>edges_are_sorted</tt> tag is deprecated and
+      only provided by the old interface.)</b>
    </p>

    <p class="indent">
@@ -572,12 +619,14 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator
      to the <a href="#edge-const">edge range constructor</a>, except
      that edge properties are also initialized. The type
      <tt>EdgePropertyIterator</tt> must be a model of the <a
-      href="http://www.boost.org/sgi/stl/InputIterator.html">InputIterator</a>
+      href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</a>
      concept whose <tt>value_type</tt> is convertible to
      <tt>EdgeProperty</tt>. The iterator range <tt>[ep_iter, ep_ter +
        m)</tt> will be used to initialize the properties on the edges
      of the graph, where <tt>m</tt> is distance from
-      <tt>edge_begin</tt> to <tt>edge_end</tt>.
+      <tt>edge_begin</tt> to <tt>edge_end</tt>.  <b>(The version of this
+      constructor without the <tt>edges_are_sorted</tt> tag is deprecated and
+      only provided by the old interface.)</b>
    </p>

    <hr></hr>
@@ -598,6 +647,7 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator
      share storage with the constructed graph (and so are safe to destroy).
      The parameter <code>prop</code>, if provided, is used to initialize the
      graph property.
+      <b>(This function is only provided by the new interface.)</b>
    </p>

    <hr></hr>
@@ -620,15 +670,16 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator
      not share storage with the constructed graph (and so are safe to
      destroy).  The parameter <code>prop</code>, if provided, is used to
      initialize the graph property.
+      <b>(This function is only provided by the new interface.)</b>
    </p>

    <hr></hr>

-    <pre><a name="graph-const"></a>
+    <pre><a name="#graph-const"></a>
  template&lt;typename Graph, typename VertexIndexMap&gt;
  compressed_sparse_row_graph(const Graph&amp; g, const VertexIndexMap&amp; vi,
                              vertices_size_type numverts,
-                              edges_size_type numedges);
+                              edges_size_type numedges); 

  template&lt;typename Graph, typename VertexIndexMap&gt;
  compressed_sparse_row_graph(const Graph&amp; g, const VertexIndexMap&amp; vi);
@@ -666,14 +717,14 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator

      <ul>
        <li><tt>g</tt>: The incoming graph.</li>
-
+        
        <li><tt>vi</tt>: A map from vertices to indices. If not
          provided, <tt>get(vertex_index, g)</tt> will be used.</li>
-
+        
        <li><tt>numverts</tt>: The number of vertices in the graph
          <tt>g</tt>. If not provided, <tt>Graph</tt> must be a model of
          <a href="VertexListGraph.html">VertexListGraph</a>.</li>
-
+        
        <li><tt>numedges</tt>: The number of edges in the graph
          <tt>g</tt>. If not provided, <tt>Graph</tt> must be a model of
          <a href="EdgeListGraph.html">EdgeListGraph</a>.</li>
@@ -713,7 +764,7 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator

    <a name="vertex-access"></a><h3>Vertex access</h3>

-    <pre><a name="vertex-lookup"></a>
+    <pre><a name="vertex"></a>
  vertex_descriptor vertex(vertices_size_type i, const compressed_sparse_row_graph&amp;);
    </pre>
    <p class="indent">
@@ -724,9 +775,21 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator
    <hr></hr>

    <a name="edge-access"></a><h3>Edge access</h3>
+    <pre><a name="edge_range"></a>
+  std::pair&lt;out_edge_iterator, out_edge_iterator&gt; 
+    edge_range(vertex_descriptor u, vertex_descriptor v, const compressed_sparse_row_graph&amp;);
+    </pre>
+
+    <p class="indent">
+      Returns all edges from <tt>u</tt> to <tt>v</tt>. Requires time
+      logarithmic in the number of edges outgoing from <tt>u</tt>.
+      <b>(This function is only provided by the old interface.)</b>
+    </p>
+
+    <hr></hr>

    <pre><a name="edge"></a>
-  std::pair&lt;edge_descriptor, bool&gt;
+  std::pair&lt;edge_descriptor, bool&gt; 
    edge(vertex_descriptor u, vertex_descriptor v, const compressed_sparse_row_graph&amp;);
    </pre>

@@ -735,11 +798,10 @@ void <a href="#add_edges_sorted_prop">add_edges_sorted</a>(BidirectionalIterator
      descriptor for that edge and <tt>true</tt>; otherwise, the
      second value in the pair will be <tt>false</tt>. If multiple
      edges exist from <tt>u</tt> to <tt>v</tt>, the first edge will
-      be returned; use <a href="IncidenceGraph.html"><tt>out_edges</tt></a> and a
-      conditional statement
-      to retrieve all edges to a given target.  This function requires linear
-      time in the
-      number of edges outgoing from <tt>u</tt>.
+      be returned; use <a href="#edge_range"><tt>edge_range</tt></a>
+      to retrieve all edges.  This function requires time logarithmic in the
+      number of edges outgoing from <tt>u</tt> for the old interface, and
+      linear time for the new interface.
    </p>

    <hr></hr>
@@ -766,7 +828,7 @@ template&lt;typename <a href="./PropertyTag.html">PropertyTag</a>&gt;
 property_map&lt;compressed_sparse_row_graph, Tag&gt;::const_type
 get(PropertyTag, const compressed_sparse_row_graph&amp; g)
    </pre>
-
+    
    <p class="indent">
      Returns the property map object for the vertex property
      specified by <TT>PropertyTag</TT>. The <TT>PropertyTag</TT> must
@@ -816,7 +878,7 @@ get_property(const compressed_sparse_row_graph&amp; g, GraphPropertyTag);

    <p class="indent">
      Return the property specified by <tt>GraphPropertyTag</tt> that
-      is attached to the graph object <tt>g</tt>.
+      is attached to the graph object <tt>g</tt>. 
    </p>

    <hr></hr>
@@ -836,18 +898,60 @@ void set_property(const compressed_sparse_row_graph&amp; g, GraphPropertyTag,

    <h3><a name="incremental-construction-functions">Incremental construction functions</a></h3>

+    <pre><a name="add_vertex"></a>
+vertex_descriptor add_vertex(compressed_sparse_row_graph&amp; g)
+    </pre>
+    
+    <p class="indent">
+      Add a new vertex to the end of the graph <tt>g</tt>, and return a
+      descriptor for that vertex.  The new vertex will be greater than any of
+      the previous vertices in <tt>g</tt>.
+      <b>(This function is only provided by the old interface.)</b>
+    </p>
+
+    <hr></hr>
+
+    <pre><a name="add_vertices"></a>
+vertex_descriptor add_vertices(vertices_size_type count, compressed_sparse_row_graph&amp; g)
+    </pre>
+    
+    <p class="indent">
+      Add <tt>count</tt> new vertices to the end of the graph <tt>g</tt>, and
+      return a descriptor for the smallest new vertex.  The new vertices will
+      be greater than any of the previous vertices in <tt>g</tt>.
+      <b>(This function is only provided by the old interface.)</b>
+    </p>
+
+    <hr></hr>
+
+    <pre><a name="add_edge"></a>
+edge_descriptor add_edge(vertex_descriptor src, vertex_descriptor tgt, compressed_sparse_row_graph&amp; g)
+    </pre>
+    
+    <p class="indent">
+      Add a new edge from <tt>src</tt> to <tt>tgt</tt> in the graph <tt>g</tt>,
+      and return a descriptor for it.  There must not be an edge in <tt>g</tt>
+      whose source vertex is greater than <tt>src</tt>.  If the vertex
+      <tt>src</tt> has out edges before this operation is called, there must be
+      none whose target is larger than <tt>tgt</tt>.
+      <b>(This function is only provided by the old interface.)</b>
+    </p>
+
+    <hr></hr>
+
    <pre><a name="add_edges"></a>
 template&lt;typename InputIterator&gt;
 void add_edges(InputIterator first, InputIterator last, compressed_sparse_row_graph&amp; g)
    </pre>
-
+    
    <p class="indent">
      Add a range of edges (from <tt>first</tt> to <tt>last</tt>) to the graph.
      The <tt>InputIterator</tt> must be a model of <a
-      href="http://www.boost.org/sgi/stl/InputIterator.html">InputIterator</a>
+      href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</a>
      whose <code>value_type</code> is an <code>std::pair</code> of integer
      values. These integer values are the source and target vertices of the
      new edges.  The edges do not need to be sorted.
+      <b>(This function is only provided by the new interface.)</b>
    </p>

    <hr></hr>
@@ -856,18 +960,19 @@ void add_edges(InputIterator first, InputIterator last, compressed_sparse_row_gr
 template&lt;typename InputIterator, typename EPIter&gt;
 void add_edges(InputIterator first, InputIterator last, EPIter ep_first, EPIter ep_last, compressed_sparse_row_graph&amp; g)
    </pre>
-
+    
    <p class="indent">
      Add a range of edges (from <tt>first</tt> to <tt>last</tt>) with
      corresponding edge properties (from <tt>ep_first</tt> to
      <tt>ep_last</tt>) to the graph.  The <tt>InputIterator</tt> and
      <tt>EPIter</tt> must be models of <a
-      href="http://www.boost.org/sgi/stl/InputIterator.html">InputIterator</a>;
+      href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</a>;
      the <code>value_type</code> of <tt>InputIterator</tt> must be an
      <code>std::pair</code> of integer values, and the <code>value_type</code>
      of <tt>EPIter</tt> must be the edge property type of the graph. The
      integer values produced by the <tt>InputIterator</tt> are the source and
      target vertices of the new edges.  The edges do not need to be sorted.
+      <b>(This function is only provided by the new interface.)</b>
    </p>

    <hr></hr>
@@ -876,15 +981,16 @@ void add_edges(InputIterator first, InputIterator last, EPIter ep_first, EPIter
 template&lt;typename BidirectionalIterator&gt;
 void add_edges_sorted(BidirectionalIterator first, BidirectionalIterator last, compressed_sparse_row_graph&amp; g)
    </pre>
-
+    
    <p class="indent">
      Add a range of edges (from <tt>first</tt> to <tt>last</tt>) to the graph.
      The <tt>BidirectionalIterator</tt> must be a model of <a
-      href="http://www.boost.org/sgi/stl/BidirectionalIterator.html">BidirectionalIterator</a>
+      href="http://www.sgi.com/tech/stl/BidirectionalIterator.html">BidirectionalIterator</a>
      whose <code>value_type</code> is an <code>std::pair</code> of integer
      values. These integer values are the source and target vertices of the
      new edges.  The edges must be sorted in increasing order by source vertex
      index.
+      <b>(This function is only provided by the new interface.)</b>
    </p>

    <hr></hr>
@@ -893,12 +999,12 @@ void add_edges_sorted(BidirectionalIterator first, BidirectionalIterator last, c
 template&lt;typename BidirectionalIterator, typename EPIter&gt;
 void add_edges_sorted(BidirectionalIterator first, BidirectionalIterator last, EPIter ep_iter, compressed_sparse_row_graph&amp; g)
    </pre>
-
+    
    <p class="indent">
      Add a range of edges (from <tt>first</tt> to <tt>last</tt>) to the graph.
      The <tt>BidirectionalIterator</tt> and <tt>EPIter</tt> must be models of
      <a
-      href="http://www.boost.org/sgi/stl/BidirectionalIterator.html">BidirectionalIterator</a>.
+      href="http://www.sgi.com/tech/stl/BidirectionalIterator.html">BidirectionalIterator</a>.
      The <code>value_type</code> of the <tt>BidirectionalIterator</tt> must be
      an <code>std::pair</code> of integer
      values. These integer values are the source and target vertices of the
@@ -907,6 +1013,7 @@ void add_edges_sorted(BidirectionalIterator first, BidirectionalIterator last, E
      property type of the graph.
      The edges must be sorted in increasing order by source vertex
      index.
+      <b>(This function is only provided by the new interface.)</b>
    </p>

    <hr></hr>
@@ -950,7 +1057,7 @@ BGL_FORALL_VERTICES(v, g, WebGraph)
 // Output each of the links
 std::cout &lt;&lt; "The web graph:" &lt;&lt; std::endl;
 BGL_FORALL_EDGES(e, g, WebGraph)
-  std::cout &lt;&lt; "  " &lt;&lt; g[source(e, g)].url &lt;&lt; " -> " &lt;&lt; g[target(e, g)].url
+  std::cout &lt;&lt; "  " &lt;&lt; g[source(e, g)].url &lt;&lt; " -> " &lt;&lt; g[target(e, g)].url 
            &lt;&lt; std::endl;
    </pre>

@@ -964,7 +1071,7 @@ BGL_FORALL_EDGES(e, g, WebGraph)
 <TD nowrap>Copyright &copy; 2005</TD><TD>
 <A HREF="http://www.boost.org/people/doug_gregor.html">Doug Gregor</A>, Indiana University (<script language="Javascript">address("cs.indiana.edu", "dgregor")</script>)<br>
 Jeremiah Willcock, Indiana University (<script language="Javascript">address("osl.iu.edu", "jewillco")</script>)<br>
-  <A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+  <A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<script language="Javascript">address("osl.iu.edu", "lums")</script>)
 </TD></TR></TABLE>
  </body>
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000-2001
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Connected Components</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -75,7 +75,7 @@ records which component each vertex in the graph belongs to by
 recording the component number in the component property map. The
 <tt>ComponentMap</tt> type must be a model of <a
 href="../../property_map/doc/WritablePropertyMap.html">Writable Property
-Map</a>. The value type should be an integer type, preferably the same
+Map</a>. The value type shouch be an integer type, preferably the same
 as the <tt>vertices_size_type</tt> of the graph. The key type must be
 the graph's vertex descriptor type.<br>

@@ -117,7 +117,7 @@ IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt>
  <b>Default:</b> <tt>get(vertex_index, g)</tt>.
    Note: if you use this default, make sure your graph has
    an internal <tt>vertex_index</tt> property. For example,
-    <tt>adjacency_list</tt> with <tt>VertexList=listS</tt> does
+    <tt>adjacenty_list</tt> with <tt>VertexList=listS</tt> does
    not have an internal <tt>vertex_index</tt> property.<br>

  <b>Python</b>: Unsupported parameter.
@@ -154,4 +154,4 @@ undirected graph.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Constructing Graph Algorithms</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -79,7 +79,7 @@ those types that model <a
 href="./VertexListGraph.html">VertexListGraph</a>. This is enforced by
 the use of those graph operations in the algorithm, and furthermore by
 our explicit requirement added as a concept check with
-<TT>BOOST_CONCEPT_ASSERT()</TT> (see Section <A
+<TT>function_requires()</TT> (see Section <A
 HREF="../../concept_check/concept_check.htm">Concept
 Checking</A> for more details about concept checking).

@@ -106,14 +106,14 @@ hence the return type of the function is the graph's
 graph algorithm as a template function, the concept checks, and some
 typedefs. The implementation is straightforward, the only step not
 discussed above is the color initialization step, where we set the
-color of all the vertices to "uncolored."
+color of all the vertices to ``uncolored''.

 <P>
 <PRE>
 namespace boost {
  template &lt;class VertexListGraph, class Order, class Color&gt;
  typename graph_traits&lt;VertexListGraph&gt;::vertices_size_type
-  sequential_vertex_color_ting(const VertexListGraph&amp; G,
+  sequential_vertex_color_ting(const VertexListGraph&amp; G, 
    Order order, Color color)
  {
    typedef graph_traits&lt;VertexListGraph&gt; GraphTraits;
@@ -122,32 +122,32 @@ namespace boost {
    typedef typename property_traits&lt;Color&gt;::value_type ColorType;
    typedef typename property_traits&lt;Order&gt;::value_type OrderType;

-    BOOST_CONCEPT_ASSERT(( VertexListGraphConcept&lt;VertexListGraph&gt; ));
-    BOOST_CONCEPT_ASSERT(( ReadWritePropertyMapConcept&lt;Color, vertex_descriptor&gt; ));
-    BOOST_CONCEPT_ASSERT(( IntegerConcept&lt;ColorType&gt; ));
-    BOOST_CONCEPT_ASSERT(( ReadablePropertyMapConcept&lt;Order, size_type&gt; ));
-    BOOST_STATIC_ASSERT((is_same&lt;OrderType, vertex_descriptor&gt;::value));
-
+    function_requires&lt; VertexListGraphConcept&lt;VertexListGraph&gt; &gt;();
+    function_requires&lt; ReadWritePropertyMapConcept&lt;Color, vertex_descriptor&gt; &gt;();
+    function_requires&lt; IntegerConcept&lt;ColorType&gt; &gt;();
+    function_requires&lt; size_type, ReadablePropertyMapConcept&lt;Order&gt; &gt;();
+    typedef typename same_type&lt;OrderType, vertex_descriptor&gt;::type req_same;
+    
    size_type max_color = 0;
    const size_type V = num_vertices(G);
-    std::vector&lt;size_type&gt;
+    std::vector&lt;size_type&gt; 
      mark(V, numeric_limits_max(max_color));
-
+    
    typename GraphTraits::vertex_iterator v, vend;
-    for (boost::tie(v, vend) = vertices(G); v != vend; ++v)
+    for (tie(v, vend) = vertices(G); v != vend; ++v)
      color[*v] = V - 1; // which means "not colored"
-
+    
    for (size_type i = 0; i &lt; V; i++) {
      vertex_descriptor current = order[i];

      // mark all the colors of the adjacent vertices
      typename GraphTraits::adjacency_iterator ai, aend;
-      for (boost::tie(ai, aend) = adjacent_vertices(current, G); ai != aend; ++ai)
-        mark[color[*ai]] = i;
+      for (tie(ai, aend) = adjacent_vertices(current, G); ai != aend; ++ai)
+        mark[color[*ai]] = i; 

      // find the smallest color unused by the adjacent vertices
      size_type smallest_color = 0;
-      while (smallest_color &lt; max_color &amp;&amp; mark[smallest_color] == i)
+      while (smallest_color &lt; max_color &amp;&amp; mark[smallest_color] == i) 
        ++smallest_color;

      // if all the colors are used up, increase the number of colors
@@ -174,10 +174,10 @@ namespace boost {
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,24 +1,24 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Copy Graph</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

 <H1><TT>copy_graph</TT></H1>

 <PRE>
-template &lt;class <a href="./VertexListGraph.html">VertexListGraph</a>, class <a href="./MutableGraph.html">MutableGraph</a>&gt;
+template &lt;class <a href="./VertexListGraph.html">VertexListGraph</a>, class <a href="./MutableGraph.html">MutableGraph</a>&gt; 
 void copy_graph(const VertexListGraph&amp; G, MutableGraph&amp; G_copy,
    const bgl_named_params&lt;P, T, R&gt;&amp; params = <i>all defaults</i>)
 </PRE>
@@ -52,7 +52,7 @@ href="./MutableGraph.html">Mutable Graph</a>.

 IN: <tt>vertex_copy(VertexCopier vc)</tt>
 <blockquote>
-This is a <a href="http://www.boost.org/sgi/stl/BinaryFunction.html">Binary Function</a> that copies the properties of a vertex in the original graph
+This is a <a href="http://www.sgi.com/tech/stl/BinaryFunction.html">Binary Function</a> that copies the properties of a vertex in the original graph
 into the corresponding vertex in the copy.<br>

 <b>Default:</b> <tt>vertex_copier&lt;VertexListGraph, MutableGraph&gt;</tt>
@@ -62,7 +62,7 @@ map from the graph.

 IN: <tt>edge_copy(EdgeCopier ec)</tt>
 <blockquote>
-This is a <a href="http://www.boost.org/sgi/stl/BinaryFunction.html">Binary Function</a> that copies the properties of an edge in the original graph
+This is a <a href="http://www.sgi.com/tech/stl/BinaryFunction.html">Binary Function</a> that copies the properties of an edge in the original graph
 into the corresponding edge in the copy.<br>

 <b>Default:</b> <tt>edge_copier&lt;VertexListGraph, MutableGraph&gt;</tt>
@@ -80,7 +80,7 @@ integers in the half-open range <tt>[0,num_vertices(G))</tt>.<br>
 <b>Default:</b> <tt>get(vertex_index, G)</tt>.
 Note: if you use this default, make sure your graph has
 an internal <tt>vertex_index</tt> property. For example,
-<tt>adjacency_list</tt> with <tt>VertexList=listS</tt> does
+<tt>adjacenty_list</tt> with <tt>VertexList=listS</tt> does
 not have an internal <tt>vertex_index</tt> property.
 </blockquote>

@@ -113,4 +113,4 @@ The time complexity is <i>O(V + E)</i>.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,19 +1,19 @@
 <HTML>

 <!--   Copyright (c) Jeremy Siek 2000
-
+  
     Distributed under 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)
  -->

-<Head>
+<Head> 
 <Title>Boost Graph Library: Cuthill-Mckee Ordering</Title>
 </Head>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -46,25 +46,25 @@
  OutputIterator
  cuthill_mckee_ordering(const IncidenceGraph&amp; g,
                         typename graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor s,
-                         OutputIterator inverse_permutation,
+                         OutputIterator inverse_permutation, 
                         ColorMap color, DegreeMap degree)

  (2)
  template &lt;class VertexListGraph, class OutputIterator&gt;
  OutputIterator
-  cuthill_mckee_ordering(const VertexListGraph&amp; g, OutputIterator inverse_permutation);
+  cuthill_mckee_ordering(const VertexListGraph&amp; g, OutputIterator inverse_permutation); 

  template &lt;class VertexListGraph, class OutputIterator, class VertexIndexMap&gt;
  OutputIterator
-  cuthill_mckee_ordering(const VertexListGraph&amp; g, OutputIterator inverse_permutation,
-                         VertexIndexMap index_map);
-
-  template &lt;class VertexListGraph, class OutputIterator,
+  cuthill_mckee_ordering(const VertexListGraph&amp; g, OutputIterator inverse_permutation, 
+                         VertexIndexMap index_map); 
+ 
+  template &lt;class VertexListGraph, class OutputIterator, 
            class ColorMap, class DegreeMap&gt;
  OutputIterator
-  cuthill_mckee_ordering(const VertexListGraph&amp; g, OutputIterator inverse_permutation,
+  cuthill_mckee_ordering(const VertexListGraph&amp; g, OutputIterator inverse_permutation, 
                         ColorMap color, DegreeMap degree)
-
+                         
  (3)
  template &lt;class IncidenceGraph, class OutputIterator,
            class ColorMap, class DegreeMap&gt;
@@ -72,7 +72,7 @@
  cuthill_mckee_ordering(const IncidenceGraph&amp; g,
    			 std::deque&lt; typename
 			 graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor &gt; vertex_queue,
-                         OutputIterator inverse_permutation,
+                         OutputIterator inverse_permutation, 
                         ColorMap color, DegreeMap degree)
 </pre>

@@ -92,10 +92,10 @@ increasing degree.
 <p>
 Version 1 of the algorithm lets the user choose the ``starting
 vertex'', version 2 finds a good starting vertex using the
-pseudo-peripheral pair heuristic (among each component), while version 3
-contains the starting nodes for each vertex in the deque.  The choice of the
-``starting vertex'' can have a significant effect on the quality of the
-ordering.  For versions 2 and 3, <tt>find_starting_vertex</tt> will be called
+pseudo-peripheral pair heuristic (among each component), while version 3 
+contains the starting nodes for each vertex in the deque.  The choice of the 
+``starting vertex'' can have a significant effect on the quality of the 
+ordering.  For versions 2 and 3, <tt>find_starting_vertex</tt> will be called 
 for each component in the graph, increasing run time significantly.
 </p>

@@ -140,7 +140,7 @@ For version 1:

 <ul>

-<li> <tt>IncidenceGraph&amp; g</tt> &nbsp;(IN) <br>
+<li> <tt>IncidenceGraph&amp; g</tt> &nbsp;(IN) <br> 
  An undirected graph. The graph's type must be a model of <a
  href="./IncidenceGraph.html">IncidenceGraph</a>.<br>
  <b>Python</b>: The parameter is named <tt>graph</tt>.
@@ -149,13 +149,13 @@ For version 1:
  The starting vertex.<br>
  <b>Python</b>: Unsupported parameter.

-<li> <tt>OutputIterator inverse_permutation</tt> &nbsp(OUT) <br>
+<li> <tt>OutputIterator inverse_permutation</tt> &nbsp(OUT) <br> 
  The new vertex ordering. The vertices are written to the <a
-  href="http://www.boost.org/sgi/stl/OutputIterator.html">output
+  href="http://www.sgi.com/tech/stl/OutputIterator.html">output
  iterator</a> in their new order.<br>
  <b>Python</b>: This parameter is unused in Python. The new vertex
  ordering is returned as a Python <tt>list</tt>.
-
+  
 <li> <tt>ColorMap color_map</tt> &nbsp(WORK) <br>
  Used internally to keep track of the progress of the algorithm
  (to avoid visiting the same vertex twice).<br>
@@ -171,13 +171,13 @@ For version 2:

 <ul>

-<li> <tt>VertexListGraph&amp; g</tt> &nbsp;(IN) <br>
+<li> <tt>VertexListGraph&amp; g</tt> &nbsp;(IN) <br> 
  An undirected graph. The graph's type must be a model of <a
                                                              href="./VertexListGraph.html">VertexListGraph</a> and <a href="./IncidenceGraph.html">IncidenceGraph</a>.<br>
  <b>Python</b>: The parameter is named <tt>graph</tt>.

-<li> <tt><a href="http://www.boost.org/sgi/stl/OutputIterator.html">
-  OutputIterator</a> inverse_permutation</tt> &nbsp(OUT) <br>
+<li> <tt><a href="http://www.sgi.com/tech/stl/OutputIterator.html">
+  OutputIterator</a> inverse_permutation</tt> &nbsp(OUT) <br> 
  The new vertex ordering. The vertices are written to the
  output iterator in their new order.<br>
  <b>Python</b>: This parameter is unused in Python. The new vertex
@@ -198,7 +198,7 @@ For version 3:

 <ul>

-<li> <tt>IncidenceGraph&amp; g</tt> &nbsp;(IN) <br>
+<li> <tt>IncidenceGraph&amp; g</tt> &nbsp;(IN) <br> 
  An undirected graph. The graph's type must be a model of <a
  href="./IncidenceGraph.html">IncidenceGraph</a>.<br>
  <b>Python</b>: The parameter is named <tt>graph</tt>.
@@ -207,13 +207,13 @@ For version 3:
  The deque containing the starting vertices for each component.<br>
  <b>Python</b>: Unsupported parameter.

-<li> <tt>OutputIterator inverse_permutation</tt> &nbsp(OUT) <br>
+<li> <tt>OutputIterator inverse_permutation</tt> &nbsp(OUT) <br> 
  The new vertex ordering. The vertices are written to the <a
-  href="http://www.boost.org/sgi/stl/OutputIterator.html">output
+  href="http://www.sgi.com/tech/stl/OutputIterator.html">output
  iterator</a> in their new order.<br>
  <b>Python</b>: This parameter is unused in Python. The new vertex
  ordering is returned as a Python <tt>list</tt>.
-
+  
 <li> <tt>ColorMap color_map</tt> &nbsp(WORK) <br>
  Used internally to keep track of the progress of the algorithm
  (to avoid visiting the same vertex twice).<br>
@@ -245,4 +245,4 @@ and <tt>degree_property_map</tt> in <tt>boost/graph/properties.hpp</tt>.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,223 +0,0 @@
-<HTML>
-<!--
-     Copyright (c) Piotr Wygocki 2013
-
-     Distributed under 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)
-  -->
-<Head>
-<Title>Boost Graph Library: Cycle Canceling for  Min Cost Max Flow</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
-
-<BR Clear>
-
-<H1><A NAME="sec:cycle_canceling">
-<TT>cycle_canceling</TT>
-</H1>
-
-<PRE>
-<i>// named parameter version</i>
-template &lt;class <a href="./Graph.html">Graph</a>, class P, class T, class R&gt;
-void cycle_canceling(
-        Graph &amp;g,
-        const bgl_named_params&lt;P, T, R&gt; &amp; params  = <i>all defaults</i>)
-
-<i>// non-named parameter version</i>
-template &lt;class <a href="./Graph.html">Graph</a>, class Pred, class Distance, class Reversed, class ResidualCapacity, class Weight&gt;
-void cycle_canceling(const Graph &amp; g, Weight weight, Reversed rev, ResidualCapacity residual_capacity, Pred pred, Distance distance)
-</PRE>
-
-<P>
-The <tt>cycle_canceling()</tt> function calculates the minimum cost flow of a network with given flow. See Section <a
-href="./graph_theory_review.html#sec:network-flow-algorithms">Network
-Flow Algorithms</a> for a description of maximum flow.
-For given flow values <i> f(u,v)</i>  function minimizes flow cost in such a way, that for each <i>v in V</i> the
- <i> sum<sub> u in V</sub>  f(v,u) </i> is preserved. Particularly if the input flow was the maximum flow, the function produces min cost max flow.
-
-
- The function calculates the flow values <i>f(u,v)</i> for all <i>(u,v)</i> in
-<i>E</i>, which are returned in the form of the residual capacity
-<i>r(u,v) = c(u,v) - f(u,v)</i>.
-
-<p>
-There are several special requirements on the input graph and property
-map parameters for this algorithm. First, the directed graph
-<i>G=(V,E)</i> that represents the network must be augmented to
-include the reverse edge for every edge in <i>E</i>.  That is, the
-input graph should be <i>G<sub>in</sub> = (V,{E U
-E<sup>T</sup>})</i>. The <tt>ReverseEdgeMap</tt> argument <tt>rev</tt>
-must map each edge in the original graph to its reverse edge, that is
-<i>(u,v) -> (v,u)</i> for all <i>(u,v)</i> in <i>E</i>.
-The <tt>WeightMap</tt> has to map each edge from <i>E<sup>T</sup></i> to <i>-weight</i> of its reversed edge.
-Note that edges from <i>E</i> can have negative weights.
-<p>
-If weights in the graph are nonnegative, the
-<a href="./successive_shortest_path_nonnegative_weights.html"><tt>successive_shortest_path_nonnegative_weights()</tt></a>
-might be better choice for min cost max flow.
-
-<p>
-The algorithm is described in <a
-href="./bibliography.html#ahuja93:_network_flows">Network Flows</a>.
-
-<p>
-In each round algorithm augments the negative cycle (in terms of weight) in the residual graph.
-If there is no negative cycle in the network, the cost is optimized.
-
-<p>
-Note that, although we mention capacity in the problem description, the actual algorithm doesn't have to now it.
-
-<p>
-In order to find the cost of the result flow use:
-<a href="./find_flow_cost.html"><tt>find_flow_cost()</tt></a>.
-
-
-<H3>Where Defined</H3>
-
-<P>
-<a href="../../../boost/graph/successive_shortest_path_nonnegative_weights.hpp"><TT>boost/graph/successive_shortest_path_nonnegative_weights.hpp</TT></a>
-
-<P>
-
-<h3>Parameters</h3>
-
-IN: <tt>Graph&amp; g</tt>
-<blockquote>
-  A directed graph. The
-  graph's type must be a model of <a
-  href="./VertexListGraph.html">VertexListGraph</a> and <a href="./IncidenceGraph.html">IncidenceGraph</a> For each edge
-  <i>(u,v)</i> in the graph, the reverse edge <i>(v,u)</i> must also
-  be in the graph.
-</blockquote>
-
-<h3>Named Parameters</h3>
-
-
-IN/OUT: <tt>residual_capacity_map(ResidualCapacityEdgeMap res)</tt>
-<blockquote>
-  This maps edges to their residual capacity. The type must be a model
-  of a mutable <a
-  href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property
-  Map</a>. The key type of the map must be the graph's edge descriptor
-  type.<br>
-  <b>Default:</b> <tt>get(edge_residual_capacity, g)</tt>
-</blockquote>
-
-IN: <tt>reverse_edge_map(ReverseEdgeMap rev)</tt>
-<blockquote>
-  An edge property map that maps every edge <i>(u,v)</i> in the graph
-  to the reverse edge <i>(v,u)</i>. The map must be a model of
-  constant <a href="../../property_map/doc/LvaluePropertyMap.html">Lvalue
-  Property Map</a>. The key type of the map must be the graph's edge
-  descriptor type.<br>
-  <b>Default:</b> <tt>get(edge_reverse, g)</tt>
-</blockquote>
-
-IN: <tt>weight_map(WeightMap w)</tt>
-<blockquote>
-  The weight (also know as ``length'' or ``cost'') of each edge in the
-  graph.  The <tt>WeightMap</tt> type must be a model of <a
-  href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
-  Map</a>.  The key type for this property map must be the edge
-  descriptor of the graph.  The value type for the weight map must be
-  <i>Addable</i> with the distance map's value type. <br>
-  <b>Default:</b> <tt>get(edge_weight, g)</tt><br>
-</blockquote>
-
-UTIL: <tt>predecessor_map(PredEdgeMap pred)</tt>
-<blockquote>
-  Use by the algorithm to store augmenting paths. The map must be a
-  model of mutable <a
-  href="../../property_map/doc/LvaluePropertyMap.html">Lvalue Property Map</a>.
-  The key type must be the graph's vertex descriptor type and the
-  value type must be the graph's edge descriptor type.<br>
-
-  <b>Default:</b> an <a
-  href="../../property_map/doc/iterator_property_map.html">
-  <tt>iterator_property_map</tt></a> created from a <tt>std::vector</tt>
-  of edge descriptors of size <tt>num_vertices(g)</tt> and
-  using the <tt>i_map</tt> for the index map.
-</blockquote>
-
-UTIL: <tt>distance_map(DistanceMap d_map)</tt>
-<blockquote>
-  The shortest path weight from the source vertex <tt>s</tt> to each
-  vertex in the graph <tt>g</tt> is recorded in this property map. The
-  shortest path weight is the sum of the edge weights along the
-  shortest path.  The type <tt>DistanceMap</tt> must be a model of <a
-  href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
-  Property Map</a>. The vertex descriptor type of the graph needs to
-  be usable as the key type of the distance map.
-
-  <b>Default:</b> <a
-  href="../../property_map/doc/iterator_property_map.html">
-  <tt>iterator_property_map</tt></a> created from a
-  <tt>std::vector</tt> of the <tt>WeightMap</tt>'s value type of size
-  <tt>num_vertices(g)</tt> and using the <tt>i_map</tt> for the index
-  map.<br>
-
-</blockquote>
-
-IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt>
-<blockquote>
-  Maps each vertex of the graph to a unique integer in the range
-  <tt>[0, num_vertices(g))</tt>. This property map is only needed
-  if the default for the distance or predecessor map is used.
-  The vertex index map must be a model of <a
-  href="../../property_map/doc/ReadablePropertyMap.html">Readable Property
-  Map</a>. The key type of the map must be the graph's vertex
-  descriptor type.<br>
-  <b>Default:</b> <tt>get(vertex_index, g)</tt>
-    Note: if you use this default, make sure your graph has
-    an internal <tt>vertex_index</tt> property. For example,
-    <tt>adjacency_list</tt> with <tt>VertexList=listS</tt> does
-    not have an internal <tt>vertex_index</tt> property.
-</blockquote>
-
-<h3>Complexity</h3>
-In the integer capacity and weight case, if <i>C</i> is the initial cost of the flow, then the complexity is <i> O(C * |V| * |E|)</i>,
-where <i>O(|E|* |V|)</i> is the complexity of the bellman ford shortest paths algorithm and <i>C</i> is upper bound on number of iteration.
-In many real world cases number of iterations is much smaller than <i>C</i>.
-
-
-<h3>Example</h3>
-
-The program in <a
-href="../example/cycle_canceling_example.cpp"><tt>example/cycle_canceling_example.cpp</tt></a>.
-
-
-<h3>See Also</h3>
-
-<a href="./successive_shortest_path_nonnegative_weights.html"><tt>successive_shortest_path_nonnegative_weights()</tt></a><br>
-<a href="./find_flow_cost.html"><tt>find_flow_cost()</tt></a>.
-
-<br>
-<HR>
-<TABLE>
-<TR valign=top>
-<TD nowrap>Copyright &copy; 2013</TD><TD>
-Piotr Wygocki, University of Warsaw (<A HREF="mailto:wygos@mimuw.edu.pl">wygos at mimuw.edu.pl</A>)
-</TD></TR></TABLE>
-
-</BODY>
-</HTML>
-<!--  LocalWords:  HTML Siek Edmonds BGCOLOR ffffff ee VLINK ALINK ff IMG SRC
- -->
-<!--  LocalWords:  gif ALT BR sec edmonds karp TT DIV CELLPADDING TR TD PRE lt
- -->
-<!--  LocalWords:  typename VertexListGraph CapacityEdgeMap ReverseEdgeMap gt
- -->
-<!--  LocalWords:  ResidualCapacityEdgeMap VertexIndexMap src rev ColorMap pred
- -->
-<!--  LocalWords:  PredEdgeMap tt href html hpp ul li nbsp br LvaluePropertyMap
- -->
-<!--  LocalWords:  num ColorValue DIMACS cpp pre config iostream dimacs int std
- -->
-<!--  LocalWords:  namespace vecS directedS cout endl iter ei HR valign nowrap
- -->
-<!--  LocalWords:  jeremy siek htm Univ mailto jsiek lsc edu
-p -->
-
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Directed Acyclic Graph Shortest Paths</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -30,21 +30,21 @@ void dag_shortest_paths(const VertexListGraph&amp; g,
   const bgl_named_params&lt;Param,Tag,Rest&gt;&amp; params)

 <i>// non-named parameter version</i>
-template &lt;class VertexListGraph, class DijkstraVisitor,
-	  class DistanceMap, class WeightMap, class ColorMap,
+template &lt;class VertexListGraph, class DijkstraVisitor, 
+	  class DistanceMap, class WeightMap, class ColorMap, 
 	  class PredecessorMap,
-	  class Compare, class Combine,
+	  class Compare, class Combine, 
 	  class DistInf, class DistZero&gt;
 void dag_shortest_paths(const VertexListGraph&amp; g,
-   typename graph_traits&lt;VertexListGraph&gt;::vertex_descriptor s,
+   typename graph_traits&lt;VertexListGraph&gt;::vertex_descriptor s, 
   DistanceMap distance, WeightMap weight, ColorMap color,
-   PredecessorMap pred, DijkstraVisitor vis,
+   PredecessorMap pred, DijkstraVisitor vis, 
   Compare compare, Combine combine, DistInf inf, DistZero zero)
 </PRE>

 <P>
 This algorithm&nbsp;[<A HREF="bibliography.html#clr90">8</A>] solves
-the single-source shortest-paths problem on a weighted, directed
+the single-source shortest-paths problem on a weighted, directed 
 acyclic graph (DAG). This algorithm is more efficient for DAG's
 than either the Dijkstra or Bellman-Ford algorithm.
 Use breadth-first search instead of this algorithm
@@ -74,7 +74,7 @@ algorithm's event points.</P>

 <h3>Parameters</h3>

-IN: <tt>const VertexListGraph&amp; g</tt>
+IN: <tt>const VertexListGraph&amp; g</tt> 
 <blockquote>
  The graph object on which the algorithm will be applied.
  The type <tt>VertexListGraph</tt> must be a model of \concept{VertexListGraph}.<br>
@@ -82,7 +82,7 @@ IN: <tt>const VertexListGraph&amp; g</tt>
  <b>Python</b>: The parameter is named <tt>graph</tt>.
 </blockquote>

-IN: <tt>vertex_descriptor s</tt>
+IN: <tt>vertex_descriptor s</tt> 
 <blockquote>
  The source vertex. All distance will be calculated from this vertex,
  and the shortest paths tree will be rooted at this vertex.<br>
@@ -92,7 +92,7 @@ IN: <tt>vertex_descriptor s</tt>

 <h3>Named Parameters</h3>

-IN: <tt>weight_map(WeightMap w_map)</tt>
+IN: <tt>weight_map(WeightMap w_map)</tt>   
 <blockquote>
  The weight or ``length'' of each edge in the graph.
  The type <tt>WeightMap</tt> must be a model of
@@ -106,7 +106,7 @@ IN: <tt>weight_map(WeightMap w_map)</tt>

 </blockquote>

-IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt>
+IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt> 
 <blockquote>
  This maps each vertex to an integer in the range <tt>[0,
    num_vertices(g))</tt>. This is necessary for efficient updates of the
@@ -118,13 +118,13 @@ IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt>
  <b>Default:</b> <tt>get(vertex_index, g)</tt>.
    Note: if you use this default, make sure your graph has
    an internal <tt>vertex_index</tt> property. For example,
-    <tt>adjacency_list</tt> with <tt>VertexList=listS</tt> does
+    <tt>adjacenty_list</tt> with <tt>VertexList=listS</tt> does
    not have an internal <tt>vertex_index</tt> property.<br>

  <b>Python</b>: Unsupported parameter.
 </blockquote>

-OUT: <tt>predecessor_map(PredecessorMap p_map)</tt>
+OUT: <tt>predecessor_map(PredecessorMap p_map)</tt> 
 <blockquote>
  The predecessor map records the edges in the minimum spanning
  tree. Upon completion of the algorithm, the edges <i>(p[u],u)</i>
@@ -139,7 +139,7 @@ OUT: <tt>predecessor_map(PredecessorMap p_map)</tt>
  <b>Python</b>: Must be a <tt>vertex_vertex_map</tt> for the graph.<br>
 </blockquote>

-UTIL/OUT: <tt>distance_map(DistanceMap d_map)</tt>
+UTIL/OUT: <tt>distance_map(DistanceMap d_map)</tt> 
 <blockquote>
  The shortest path weight from the source vertex <tt>s</tt> to each
  vertex in the graph <tt>g</tt> is recorded in this property map. The
@@ -147,13 +147,13 @@ UTIL/OUT: <tt>distance_map(DistanceMap d_map)</tt>
  shortest path.  The type <tt>DistanceMap</tt> must be a model of <a
  href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
  Property Map</a>. The vertex descriptor type of the graph needs to
-  be usable as the key type of the distance map.
+  be usable as the key type of the distance map. 

  The value type of the distance map is the element type of a <a
  href="./Monoid.html">Monoid</tt> formed with the <tt>combine</tt>
  function object and the <tt>zero</tt> object for the identity
  element. Also the distance value type must have a <a
-  href="http://www.boost.org/sgi/stl/StrictWeakOrdering.html">
+  href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">
  StrictWeakOrdering</a> provided by the <tt>compare</tt> function
  object.<br>
  <b>Default:</b> <a
@@ -166,12 +166,12 @@ UTIL/OUT: <tt>distance_map(DistanceMap d_map)</tt>
  <b>Python</b>: Must be a <tt>vertex_double_map</tt> for the graph.
 </blockquote>

-IN: <tt>distance_compare(CompareFunction cmp)</tt>
+IN: <tt>distance_compare(CompareFunction cmp)</tt> 
 <blockquote>
  This function is use to compare distances to determine which vertex
  is closer to the source vertex.  The <tt>CompareFunction</tt> type
  must be a model of <a
-  href="http://www.boost.org/sgi/stl/BinaryPredicate.html">Binary
+  href="http://www.sgi.com/tech/stl/BinaryPredicate.html">Binary
  Predicate</a> and have argument types that match the value type of
  the <tt>DistanceMap</tt> property map.<br>

@@ -182,11 +182,11 @@ IN: <tt>distance_compare(CompareFunction cmp)</tt>
  <b>Python</b>: Unsupported parameter.
 </blockquote>

-IN: <tt>distance_combine(CombineFunction cmb)</tt>
+IN: <tt>distance_combine(CombineFunction cmb)</tt> 
 <blockquote>
  This function is used to combine distances to compute the distance
  of a path. The <tt>CombineFunction</tt> type must be a model of <a
-  href="http://www.boost.org/sgi/stl/BinaryFunction.html">Binary
+  href="http://www.sgi.com/tech/stl/BinaryFunction.html">Binary
  Function</a>. The first argument type of the binary function must
  match the value type of the <tt>DistanceMap</tt> property map and
  the second argument type must match the value type of the
@@ -199,7 +199,7 @@ IN: <tt>distance_combine(CombineFunction cmb)</tt>
  <b>Python</b>: Unsupported parameter.
 </blockquote>

-IN: <tt>distance_inf(D inf)</tt>
+IN: <tt>distance_inf(D inf)</tt> 
 <blockquote>
  The <tt>inf</tt> object must be the greatest value of any <tt>D</tt> object.
  That is, <tt>compare(d, inf) == true</tt> for any <tt>d != inf</tt>.
@@ -209,7 +209,7 @@ IN: <tt>distance_inf(D inf)</tt>
  <b>Python</b>: Unsupported parameter.
 </blockquote>

-IN: <tt>distance_zero(D zero)</tt>
+IN: <tt>distance_zero(D zero)</tt> 
 <blockquote>
  The <tt>zero</tt> value must be the identity element for the
  <a href="./Monoid.html">Monoid</a> formed by the distance values
@@ -220,7 +220,7 @@ IN: <tt>distance_zero(D zero)</tt>
  <b>Python</b>: Unsupported parameter.
 </blockquote>

-UTIL/OUT: <tt>color_map(ColorMap c_map)</tt>
+UTIL/OUT: <tt>color_map(ColorMap c_map)</tt> 
 <blockquote>
  This is used during the execution of the algorithm to mark the
  vertices. The vertices start out white and become gray when they are
@@ -242,13 +242,13 @@ UTIL/OUT: <tt>color_map(ColorMap c_map)</tt>
  the graph.

 </blockquote>
-
-OUT: <tt>visitor(DijkstraVisitor v)</tt>
+  
+OUT: <tt>visitor(DijkstraVisitor v)</tt>  
 <blockquote>
  Use this to specify actions that you would like to happen
  during certain event points within the algorithm.
  The type <tt>DijkstraVisitor</tt> must be a model of the
-  <a href="./DijkstraVisitor.html">Dijkstra Visitor</a> concept.
+  <a href="./DijkstraVisitor.html">Dijkstra Visitor</a> concept. 
 The visitor object is passed by value <a
  href="#1">[1]</a>.<br>
  <b>Default:</b> <tt>dijkstra_visitor&lt;null_visitor&gt;</tt><br>
@@ -272,21 +272,21 @@ The time complexity is <i>O(V + E)</i>.
  is invoked on each vertex in the graph before the start of the
  algorithm.
 <li><b><tt>vis.examine_vertex(u, g)</tt></b>
-  is invoked on a vertex as it is added to set <i>S</i>.
+  is invoked on a vertex as it is added to set <i>S</i>. 
  At this point we know that <i>(p[u],u)</i>
-  is a shortest-paths tree edge so
-  <i>d[u] = delta(s,u) = d[p[u]] + w(p[u],u)</i>. Also, the distances
+  is a shortest-paths tree edge so 
+  <i>d[u] = delta(s,u) = d[p[u]] + w(p[u],u)</i>. Also, the distances 
  of the examined vertices is monotonically increasing
-  <i>d[u<sub>1</sub>] <= d[u<sub>2</sub>] <= d[u<sub>n</sub>]</i>.
+  <i>d[u<sub>1</sub>] <= d[u<sub>2</sub>] <= d[u<sub>n</sub>]</i>. 
 <li><b><tt>vis.examine_edge(e, g)</tt></b>
  is invoked on each out-edge of a vertex immediately after it has
-  been added to set <i>S</i>.
+  been added to set <i>S</i>. 
 <li><b><tt>vis.edge_relaxed(e, g)</tt></b>
  is invoked on edge <i>(u,v)</i> if <i>d[u] + w(u,v) < d[v]</i>.
  The edge <i>(u,v)</i> that participated in the last
-  relaxation for vertex <i>v</i> is an edge in the shortest paths tree.
+  relaxation for vertex <i>v</i> is an edge in the shortest paths tree. 
 <li><b><tt>vis.discover_vertex(v, g)</tt></b>
-  is invoked on vertex <i>v</i> when the edge
+  is invoked on vertex <i>v</i> when the edge 
  <i>(u,v)</i> is examined and <i>v</i> is WHITE. Since
  a vertex is colored GRAY when it is discovered,
  each reacable vertex is discovered exactly once.
@@ -306,7 +306,7 @@ algorithm.

 <H3>Notes</H3>

-<p><a name="1">[1]</a>
+<p><a name="1">[1]</a> 
  Since the visitor parameter is passed by value, if your visitor
  contains state then any changes to the state during the algorithm
  will be made to a copy of the visitor object, not the visitor object
@@ -322,5 +322,5 @@ algorithm.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 

@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Depth-First Search</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -31,7 +31,7 @@ template &lt;class Graph, class <a href="DFSVisitor.html">DFSVisitor</a>, class
 void depth_first_search(const Graph&amp; g, DFSVisitor vis, ColorMap color)

 template &lt;class Graph, class <a href="DFSVisitor.html">DFSVisitor</a>, class ColorMap&gt;
-void depth_first_search(const Graph&amp; g, DFSVisitor vis, ColorMap color,
+void depth_first_search(const Graph&amp; g, DFSVisitor vis, ColorMap color, 
                        typename graph_traits&lt;Graph&gt;::vertex_descriptor start)

 </PRE>
@@ -84,33 +84,32 @@ be used to do this.
 <td valign="top">
 <pre>
 DFS(<i>G</i>)
-  <b>for</b> each vertex <i>u in V</i>
+  <b>for</b> each vertex <i>u in V</i> 
    <i>color[u] :=</i> WHITE
-    <i>p[u] = u</i>
+    <i>p[u] = u</i> 
  <b>end for</b>
  <i>time := 0</i>
  <b>if</b> there is a starting vertex <i>s</i>
    <b>call</b> DFS-VISIT(<i>G</i>, <i>s</i>)
-  <b>for</b> each vertex <i>u in V</i>
+  <b>for</b> each vertex <i>u in V</i> 
    <b>if</b> <i>color[u] =</i> WHITE
      <b>call</b> DFS-VISIT(<i>G</i>, <i>u</i>)
  <b>end for</b>
  return (<i>p</i>,<i>d_time</i>,<i>f_time</i>) <br>
-DFS-VISIT(<i>G</i>, <i>u</i>)
+DFS-VISIT(<i>G</i>, <i>u</i>) 
  <i>color[u] :=</i> GRAY
-  <i>d_time[u] := time := time + 1</i>
-  <b>for</b> each <i>v in Adj[u]</i>
+  <i>d_time[u] := time := time + 1</i> 
+  <b>for</b> each <i>v in Adj[u]</i> 
    <b>if</b> (<i>color[v] =</i> WHITE)
-      <i>p[v] = u</i>
+      <i>p[v] = u</i> 
      <b>call</b> DFS-VISIT(<i>G</i>, <i>v</i>)
-    <b>else if</b> (<i>color[v] =</i> GRAY)
+    <b>else if</b> (<i>color[v] =</i> GRAY) 
      <i>...</i>
-    <b>else if</b> (<i>color[v] =</i> BLACK)
+    <b>else if</b> (<i>color[v] =</i> BLACK) 
      <i>...</i>
-    <i>...</i>
  <b>end for</b>
  <i>color[u] :=</i> BLACK
-  <i>f_time[u] := time := time + 1</i>
+  <i>f_time[u] := time := time + 1</i> 
 <pre>
 </td>
 <td valign="top">
@@ -141,8 +140,6 @@ examine edge <i>(u,v)</i>
 -
 <i>(u,v)</i> is a cross or forward edge
 -
-finish edge <i>(u,v)</i>
-
 finish vertex <i>u</i>
 -
 </pre>
@@ -226,7 +223,7 @@ IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt>
  <b>Default:</b> <tt>get(vertex_index, g)</tt>.
    Note: if you use this default, make sure your graph has
    an internal <tt>vertex_index</tt> property. For example,
-    <tt>adjacency_list</tt> with <tt>VertexList=listS</tt> does
+    <tt>adjacenty_list</tt> with <tt>VertexList=listS</tt> does
    not have an internal <tt>vertex_index</tt> property.<br>

  <b>Python</b>: Unsupported parameter.
@@ -252,27 +249,24 @@ The time complexity is <i>O(E + V)</i>.

 <li><b><tt>vis.start_vertex(s, g)</tt></b> is invoked on the source
  vertex once before the start of the search.
-
+  
 <li><b><tt>vis.discover_vertex(u, g)</tt></b> is invoked when a vertex
  is encountered for the first time.
-
+  
 <li><b><tt>vis.examine_edge(e, g)</tt></b> is invoked on every out-edge
  of each vertex after it is discovered.

 <li><b><tt>vis.tree_edge(e, g)</tt></b> is invoked on each edge as it
  becomes a member of the edges that form the search tree. If you
  wish to record predecessors, do so at this event point.
-
+  
 <li><b><tt>vis.back_edge(e, g)</tt></b> is invoked on the back edges in
  the graph.
-
+  
 <li><b><tt>vis.forward_or_cross_edge(e, g)</tt></b> is invoked on
  forward or cross edges in the graph. In an undirected graph this
  method is never called.
-
-<li><b><tt>vis.finish_edge(e, g)</tt></b> is invoked on the non-tree edges in
-  the graph as well as on each tree edge after its target vertex is finished.
-
+  
 <li><b><tt>vis.finish_vertex(u, g)</tt></b> is invoked on a vertex after
  all of its out edges have been added to the search tree and all of
  the adjacent vertices have been discovered (but before their
@@ -295,7 +289,7 @@ The example in <a href="../example/dfs-example.cpp">

 <h3>Notes</h3>

-<p><a name="1">[1]</a>
+<p><a name="1">[1]</a> 
  Since the visitor parameter is passed by value, if your visitor
  contains state then any changes to the state during the algorithm
  will be made to a copy of the visitor object, not the visitor object
@@ -311,10 +305,10 @@ The example in <a href="../example/dfs-example.cpp">
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Depth-First Visit</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -25,13 +25,13 @@
 <PRE>
 template &lt;class <a href="./IncidenceGraph.html">IncidenceGraph</a>, class <a href="./DFSVisitor.html">DFSVisitor</a>, class ColorMap&gt;
 void depth_first_visit(IncidenceGraph& g,
-  typename graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor s,
+  typename graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor s, 
  DFSVisitor&amp; vis, ColorMap color)

-template &lt;class <a href="./IncidenceGraph.html">IncidenceGraph</a>, class <a href="./DFSVisitor.html">DFSVisitor</a>, class ColorMap,
+template &lt;class <a href="./IncidenceGraph.html">IncidenceGraph</a>, class <a href="./DFSVisitor.html">DFSVisitor</a>, class ColorMap, 
          class TerminatorFunc&gt;
 void depth_first_visit(IncidenceGraph& g,
-  typename graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor s,
+  typename graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor s, 
  DFSVisitor&amp; vis, ColorMap color, TerminatorFunc func = TerminatorFunc())
 </PRE>

@@ -41,7 +41,7 @@ component as the source vertex <tt>s</tt>, using the <a
 href="./graph_theory_review.html#sec:dfs-algorithm">depth-first
 pattern</a>. The main purpose of the function is for the
 implementation of <TT>depth_first_search()</TT> though sometimes it is
-useful on its own.
+useful on its own. 

 <p>
 The <tt>DFSVisitor</tt> supplied by the user determines what
@@ -124,7 +124,7 @@ Time complexity is <i>O(E)</i>.

 <h3>Notes</h3>

-<p><a name="1">[1]</a>
+<p><a name="1">[1]</a> 
  Since the visitor parameter is passed by value, if your visitor
  contains state then any changes to the state during the algorithm
  will be made to a copy of the visitor object, not the visitor object
@@ -141,4 +141,4 @@ Time complexity is <i>O(E)</i>.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: dfs_visitor</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -22,7 +22,7 @@ dfs_visitor&lt;EventVisitorList&gt;
 </H1>

 This class is an adapter that converts a list of <a
-href="./EventVisitor.html">EventVisitor</a>s (constructed using
+href="./EventVisitor.html">EventVisitor</a>'s (constructed using
 <tt>std::pair</tt>) into a <a href="./DFSVisitor.html">DFSVisitor</a>.


@@ -63,7 +63,7 @@ with <tt>std::pair</tt>.
 This class implements all of the member functions required by <a
 href="./DFSVisitor.html">DFSVisitor</a>. In each function the
 appropriate event is dispatched to the <a
-href="./EventVisitor.html">EventVisitor</a> in the EventVisitorList.
+href="./EventVisitor.html">EventVisitor</a>'s in the EventVisitorList.

 <h3>Non-Member Functions</h3>

@@ -102,10 +102,10 @@ and <a href="./property_writer.html"><tt>property_writer</tt></a>.
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Dijkstra's Shortest Paths</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -29,14 +29,14 @@ dijkstra_shortest_paths(Graph&amp; g,
  const bgl_named_params&lt;P, T, R&gt;&amp; params);

 <i>// non-named parameter version</i>
-template &lt;typename Graph, typename <a href="DijkstraVisitor.html">DijkstraVisitor</a>,
+template &lt;typename Graph, typename <a href="DijkstraVisitor.html">DijkstraVisitor</a>, 
 	  typename PredecessorMap, typename DistanceMap,
-	  typename WeightMap, typename VertexIndexMap, typename <a href="http://www.boost.org/sgi/stl/BinaryPredicate.html">CompareFunction</a>, typename <a href="http://www.boost.org/sgi/stl/BinaryFunction.html">CombineFunction</a>,
+	  typename WeightMap, typename VertexIndexMap, typename <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">CompareFunction</a>, typename <a href="http://www.sgi.com/tech/stl/BinaryFunction.html">CombineFunction</a>, 
 	  typename DistInf, typename DistZero, typename ColorMap = <i>default</i>&gt;
 void dijkstra_shortest_paths
  (const Graph&amp; g,
-   typename graph_traits&lt;Graph&gt;::vertex_descriptor s,
-   PredecessorMap predecessor, DistanceMap distance, WeightMap weight,
+   typename graph_traits&lt;Graph&gt;::vertex_descriptor s, 
+   PredecessorMap predecessor, DistanceMap distance, WeightMap weight, 
   VertexIndexMap index_map,
   CompareFunction compare, CombineFunction combine, DistInf inf, DistZero zero,
   DijkstraVisitor vis, ColorMap color = <i>default</i>)
@@ -123,12 +123,12 @@ indicated by the labels on the right.
 <pre>
 DIJKSTRA(<i>G</i>, <i>s</i>, <i>w</i>)
  <b>for</b> each vertex <i>u in V</i> <b>(This loop is not run in dijkstra_shortest_paths_no_init)</b>
-    <i>d[u] := infinity</i>
-    <i>p[u] := u</i>
+    <i>d[u] := infinity</i> 
+    <i>p[u] := u</i> 
    <i>color[u] :=</i> WHITE
  <b>end for</b>
-  <i>color[s] := </i>GRAY
-  <i>d[s] := 0</i>
+  <i>color[s] := </i>GRAY 
+  <i>d[s] := 0</i> 
  INSERT(<i>Q</i>, <i>s</i>)
  <b>while</b> (<i>Q != &Oslash;</i>)
    <i>u :=</i> EXTRACT-MIN(<i>Q</i>)
@@ -136,10 +136,10 @@ DIJKSTRA(<i>G</i>, <i>s</i>, <i>w</i>)
    <b>for</b> each vertex <i>v in Adj[u]</i>
      <b>if</b> (<i>w(u,v) + d[u] < d[v]</i>)
        <i>d[v] := w(u,v) + d[u]</i>
-        <i>p[v] := u</i>
-        <b>if</b> (<i>color[v] =</i> WHITE)
+        <i>p[v] := u</i> 
+        <b>if</b> (<i>color[v] =</i> WHITE) 
          <i>color[v] :=</i> GRAY
-          INSERT(<i>Q</i>, <i>v</i>)
+          INSERT(<i>Q</i>, <i>v</i>) 
        <b>else if</b> (<i>color[v] =</i> GRAY)
          DECREASE-KEY(<i>Q</i>, <i>v</i>)
      <b>else</b>
@@ -188,17 +188,17 @@ finish vertex <i>u</i>

 <h3>Parameters</h3>

-IN: <tt>const Graph&amp; g</tt>
+IN: <tt>const Graph&amp; g</tt> 
 <blockquote>
  The graph object on which the algorithm will be applied.
-  The type <tt>Graph</tt> must be a model of
+  The type <tt>Graph</tt> must be a model of 
  <a href="./VertexListGraph.html">Vertex List Graph</a>
  and <a href="./IncidenceGraph.html">Incidence Graph</a>.<br>

  <b>Python</b>: The parameter is named <tt>graph</tt>.
 </blockquote>

-IN: <tt>vertex_descriptor s</tt>
+IN: <tt>vertex_descriptor s</tt> 
 <blockquote>
  The source vertex. All distance will be calculated from this vertex,
  and the shortest paths tree will be rooted at this vertex.<br>
@@ -208,11 +208,11 @@ IN: <tt>vertex_descriptor s</tt>

 <h3>Named Parameters</h3>

-IN: <tt>weight_map(WeightMap w_map)</tt>
+IN: <tt>weight_map(WeightMap w_map)</tt>   
 <blockquote>
  The weight or ``length'' of each edge in the graph. The weights
  must all be non-negative, and the algorithm will throw a
-  <a href="./exception.html#negative_edge"><tt>negative_edge</tt></a>
+  <a href="./exception.html#negative_edge"><tt>negative_edge</tt></a> 
  exception is one of the edges is negative.
  The type <tt>WeightMap</tt> must be a model of
  <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map</a>. The edge descriptor type of
@@ -225,13 +225,13 @@ IN: <tt>weight_map(WeightMap w_map)</tt>
  <b>Python default</b>: <tt>graph.get_edge_double_map("weight")</tt>
 </blockquote>

-IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt>
+IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt> 
 <blockquote>
  This maps each vertex to an integer in the range <tt>[0,
    num_vertices(g))</tt>. This is necessary for efficient updates of the
  heap data structure&nbsp;[<A
  HREF="bibliography.html#driscoll88">61</A>] when an edge is relaxed.
-  The type
+  The type 
  <tt>VertexIndexMap</tt> must be a model of
  <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map</a>. The value type of the map must be an
  integer type. The vertex descriptor type of the graph needs to be
@@ -239,22 +239,18 @@ IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt>
  <b>Default:</b> <tt>get(vertex_index, g)</tt>.
    Note: if you use this default, make sure your graph has
    an internal <tt>vertex_index</tt> property. For example,
-    <tt>adjacency_list</tt> with <tt>VertexList=listS</tt> does
+    <tt>adjacenty_list</tt> with <tt>VertexList=listS</tt> does
    not have an internal <tt>vertex_index</tt> property.
   <br>

  <b>Python</b>: Unsupported parameter.
 </blockquote>

-OUT: <tt>predecessor_map(PredecessorMap p_map)</tt>
+OUT: <tt>predecessor_map(PredecessorMap p_map)</tt> 
 <blockquote>
-  The predecessor map records the edges in the shortest path tree, the tree computed
-  by the traversal of the graph. Upon completion of the algorithm, the edges
-  <i>(p[u],u)</i> for all <i>u in V</i> are in the tree.  The shortest path
-  from vertex <i>s</i> to each vertex <i>v</i> in the graph consists of the
-  vertices <i>v</i>, <i>p[v]</i>, <i>p[p[v]]</i>, and so on until <i>s</i> is
-  reached, in reverse order.  The
-  tree is not guaranteed to be a minimum spanning tree. If <i>p[u] =
+  The predecessor map records the edges in the minimum spanning
+  tree. Upon completion of the algorithm, the edges <i>(p[u],u)</i>
+  for all <i>u in V</i> are in the minimum spanning tree. If <i>p[u] =
  u</i> then <i>u</i> is either the source vertex or a vertex that is
  not reachable from the source.  The <tt>PredecessorMap</tt> type
  must be a <a
@@ -266,7 +262,7 @@ OUT: <tt>predecessor_map(PredecessorMap p_map)</tt>
  <b>Python</b>: Must be a <tt>vertex_vertex_map</tt> for the graph.<br>
 </blockquote>

-UTIL/OUT: <tt>distance_map(DistanceMap d_map)</tt>
+UTIL/OUT: <tt>distance_map(DistanceMap d_map)</tt> 
 <blockquote>
  The shortest path weight from the source vertex <tt>s</tt> to each
  vertex in the graph <tt>g</tt> is recorded in this property map. The
@@ -274,13 +270,13 @@ UTIL/OUT: <tt>distance_map(DistanceMap d_map)</tt>
  shortest path.  The type <tt>DistanceMap</tt> must be a model of <a
  href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
  Property Map</a>. The vertex descriptor type of the graph needs to
-  be usable as the key type of the distance map.
+  be usable as the key type of the distance map. 

  The value type of the distance map is the element type of a <a
  href="./Monoid.html">Monoid</a> formed with the <tt>combine</tt>
  function object and the <tt>zero</tt> object for the identity
  element. Also the distance value type must have a <a
-  href="http://www.boost.org/sgi/stl/StrictWeakOrdering.html">
+  href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">
  StrictWeakOrdering</a> provided by the <tt>compare</tt> function
  object.<br>
  <b>Default:</b> <a
@@ -293,12 +289,12 @@ UTIL/OUT: <tt>distance_map(DistanceMap d_map)</tt>
  <b>Python</b>: Must be a <tt>vertex_double_map</tt> for the graph.<br>
 </blockquote>

-IN: <tt>distance_compare(CompareFunction cmp)</tt>
+IN: <tt>distance_compare(CompareFunction cmp)</tt> 
 <blockquote>
  This function is use to compare distances to determine which vertex
  is closer to the source vertex.  The <tt>CompareFunction</tt> type
  must be a model of <a
-  href="http://www.boost.org/sgi/stl/BinaryPredicate.html">Binary
+  href="http://www.sgi.com/tech/stl/BinaryPredicate.html">Binary
  Predicate</a> and have argument types that match the value type of
  the <tt>DistanceMap</tt> property map.<br>

@@ -309,36 +305,34 @@ IN: <tt>distance_compare(CompareFunction cmp)</tt>
  <b>Python</b>: Unsupported parameter.
 </blockquote>

-IN: <tt>distance_combine(CombineFunction cmb)</tt>
+IN: <tt>distance_combine(CombineFunction cmb)</tt> 
 <blockquote>
  This function is used to combine distances to compute the distance
  of a path. The <tt>CombineFunction</tt> type must be a model of <a
-  href="http://www.boost.org/sgi/stl/BinaryFunction.html">Binary
+  href="http://www.sgi.com/tech/stl/BinaryFunction.html">Binary
  Function</a>. The first argument type of the binary function must
  match the value type of the <tt>DistanceMap</tt> property map and
  the second argument type must match the value type of the
  <tt>WeightMap</tt> property map.  The result type must be the same
  type as the distance value type.<br>

-  <b>Default:</b> <tt>std::plus&lt;D&gt;</tt> with
+  <b>Default:</b> <tt>closed_plus&lt;D&gt;</tt> with
   <tt>D=typename property_traits&lt;DistanceMap&gt;::value_type</tt><br>

  <b>Python</b>: Unsupported parameter.
 </blockquote>

-IN: <tt>distance_inf(D inf)</tt>
+IN: <tt>distance_inf(D inf)</tt> 
 <blockquote>
  The <tt>inf</tt> object must be the greatest value of any <tt>D</tt> object.
  That is, <tt>compare(d, inf) == true</tt> for any <tt>d != inf</tt>.
-  The type <tt>D</tt> is the value type of the <tt>DistanceMap</tt>.  Edges
-  are assumed to have a weight less than (using <tt>distance_compare</tt> for
-  comparison) this value.<br>
+  The type <tt>D</tt> is the value type of the <tt>DistanceMap</tt>.<br>
  <b>Default:</b> <tt>std::numeric_limits&lt;D&gt;::max()</tt><br>

  <b>Python</b>: Unsupported parameter.
 </blockquote>

-IN: <tt>distance_zero(D zero)</tt>
+IN: <tt>distance_zero(D zero)</tt> 
 <blockquote>
  The <tt>zero</tt> value must be the identity element for the
  <a href="./Monoid.html">Monoid</a> formed by the distance values
@@ -350,7 +344,7 @@ IN: <tt>distance_zero(D zero)</tt>
  <b>Python</b>: Unsupported parameter.
 </blockquote>

-UTIL/OUT: <tt>color_map(ColorMap c_map)</tt>
+UTIL/OUT: <tt>color_map(ColorMap c_map)</tt> 
 <blockquote>
  This is used during the execution of the algorithm to mark the
  vertices. The vertices start out white and become gray when they are
@@ -371,13 +365,13 @@ UTIL/OUT: <tt>color_map(ColorMap c_map)</tt>
  <b>Python</b>: The color map must be a <tt>vertex_color_map</tt> for
  the graph.
 </blockquote>
-
-OUT: <tt>visitor(DijkstraVisitor v)</tt>
+  
+OUT: <tt>visitor(DijkstraVisitor v)</tt>  
 <blockquote>
  Use this to specify actions that you would like to happen
  during certain event points within the algorithm.
  The type <tt>DijkstraVisitor</tt> must be a model of the
-  <a href="./DijkstraVisitor.html">Dijkstra Visitor</a> concept.
+  <a href="./DijkstraVisitor.html">Dijkstra Visitor</a> concept. 
 The visitor object is passed by value <a
  href="#2">[2]</a>.<br>
  <b>Default:</b> <tt>dijkstra_visitor&lt;null_visitor&gt;</tt><br>
@@ -392,7 +386,7 @@ OUT: <tt>visitor(DijkstraVisitor v)</tt>
 <H3>Complexity</H3>

 <P>
-The time complexity is <i>O(V log V + E)</i>.
+The time complexity is <i>O(V log V)</i>.


 <h3>Visitor Event Points</h3>
@@ -404,22 +398,22 @@ The time complexity is <i>O(V log V + E)</i>.
 <li><b><tt>vis.examine_vertex(u, g)</tt></b>
  is invoked on a vertex as it is removed from the priority queue
  and added to set <i>S</i>. At this point we know that <i>(p[u],u)</i>
-  is a shortest-paths tree edge so
-  <i>d[u] = delta(s,u) = d[p[u]] + w(p[u],u)</i>. Also, the distances
+  is a shortest-paths tree edge so 
+  <i>d[u] = delta(s,u) = d[p[u]] + w(p[u],u)</i>. Also, the distances 
  of the examined vertices is monotonically increasing
-  <i>d[u<sub>1</sub>] <= d[u<sub>2</sub>] <= d[u<sub>n</sub>]</i>.
+  <i>d[u<sub>1</sub>] <= d[u<sub>2</sub>] <= d[u<sub>n</sub>]</i>. 
 <li><b><tt>vis.examine_edge(e, g)</tt></b>
  is invoked on each out-edge of a vertex immediately after it has
-  been added to set <i>S</i>.
+  been added to set <i>S</i>. 
 <li><b><tt>vis.edge_relaxed(e, g)</tt></b>
  is invoked on edge <i>(u,v)</i> if <i>d[u] + w(u,v) < d[v]</i>.
  The edge <i>(u,v)</i> that participated in the last
-  relaxation for vertex <i>v</i> is an edge in the shortest paths tree.
+  relaxation for vertex <i>v</i> is an edge in the shortest paths tree. 
 <li><b><tt>vis.discover_vertex(v, g)</tt></b>
-  is invoked on vertex <i>v</i> when the edge
+  is invoked on vertex <i>v</i> when the edge 
  <i>(u,v)</i> is examined and <i>v</i> is WHITE. Since
  a vertex is colored GRAY when it is discovered,
-  each reachable vertex is discovered exactly once. This
+  each reacable vertex is discovered exactly once. This
  is also when the vertex is inserted into the priority queue.
 <li><b><tt>vis.edge_not_relaxed(e, g)</tt></b>
  is invoked if the edge is not relaxed (see above).
@@ -435,7 +429,7 @@ See <a href="../example/dijkstra-example.cpp">
 <TT>example/dijkstra-example.cpp</TT></a> for an example of using Dijkstra's
 algorithm.

-<H3>See also</H3> <a href="dijkstra_shortest_paths_no_color_map.html">dijkstra_shortest_paths_no_color_map</a> for a version of Dijkstra's shortest path that does not use a color map.
+<H3>See also</H3> <a href="dijkstra_shortest_paths_no_color_map.html">dijkstra_shortest_paths_no_color_map</a> for a version of dijkstra's shortest path that does not use a color map.

 <H3>Notes</H3>

@@ -445,7 +439,7 @@ S</i> vertices in the priority queue at once, but instead only those
 vertices in <i>V - S</i> that are discovered and therefore have a
 distance less than infinity.

-<p><a name="2">[2]</a>
+<p><a name="2">[2]</a> 
  Since the visitor parameter is passed by value, if your visitor
  contains state then any changes to the state during the algorithm
  will be made to a copy of the visitor object, not the visitor object
@@ -461,4 +455,4 @@ distance less than infinity.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Michael Hansen 2009
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Dijkstra's Shortest Paths (No Color Map)</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -27,29 +27,29 @@ void dijkstra_shortest_paths_no_color_map
  (const Graph&amp; graph,
   typename graph_traits&lt;Graph&gt;::vertex_descriptor start_vertex,
   const bgl_named_params<Param,Tag,Rest>& params);
-
+   
 <i>// non-named parameter version</i>
-template &lt;typename Graph, typename <a href="DijkstraVisitor.html">DijkstraVisitor</a>,
+template &lt;typename Graph, typename <a href="DijkstraVisitor.html">DijkstraVisitor</a>, 
 	  typename PredecessorMap, typename DistanceMap,
-	  typename WeightMap, typename VertexIndexMap, typename <a href="http://www.boost.org/sgi/stl/BinaryPredicate.html">DistanceCompare</a>, typename <a href="http://www.boost.org/sgi/stl/BinaryFunction.html">DistanceWeightCombine</a>,
+	  typename WeightMap, typename VertexIndexMap, typename <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">DistanceCompare</a>, typename <a href="http://www.sgi.com/tech/stl/BinaryFunction.html">DistanceWeightCombine</a>, 
 	  typename DistanceInfinity, typename DistanceZero&gt;
 void dijkstra_shortest_paths_no_color_map
  (const Graph&amp; graph,
-   typename graph_traits&lt;Graph&gt;::vertex_descriptor start_vertex,
-   PredecessorMap predecessor_map, DistanceMap distance_map, WeightMap weight_map,
+   typename graph_traits&lt;Graph&gt;::vertex_descriptor start_vertex, 
+   PredecessorMap predecessor_map, DistanceMap distance_map, WeightMap weight_map, 
   VertexIndexMap index_map,
   DistanceCompare distance_compare, DistanceWeightCombine distance_weight_combine,
   DistanceInfinity distance_infinity, DistanceZero distance_zero);

 <i>// version that does not initialize the property maps</i>
-template &lt;typename Graph, typename <a href="DijkstraVisitor.html">DijkstraVisitor</a>,
+template &lt;typename Graph, typename <a href="DijkstraVisitor.html">DijkstraVisitor</a>, 
 	  typename PredecessorMap, typename DistanceMap,
-	  typename WeightMap, typename VertexIndexMap, typename <a href="http://www.boost.org/sgi/stl/BinaryPredicate.html">DistanceCompare</a>, typename <a href="http://www.boost.org/sgi/stl/BinaryFunction.html">DistanceWeightCombine</a>,
+	  typename WeightMap, typename VertexIndexMap, typename <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">DistanceCompare</a>, typename <a href="http://www.sgi.com/tech/stl/BinaryFunction.html">DistanceWeightCombine</a>, 
 	  typename DistanceInfinity, typename DistanceZero&gt;
 void dijkstra_shortest_paths_no_color_map_no_init
  (const Graph&amp; graph,
-   typename graph_traits&lt;Graph&gt;::vertex_descriptor start_vertex,
-   PredecessorMap predecessor_map, DistanceMap distance_map, WeightMap weight_map,
+   typename graph_traits&lt;Graph&gt;::vertex_descriptor start_vertex, 
+   PredecessorMap predecessor_map, DistanceMap distance_map, WeightMap weight_map, 
   VertexIndexMap index_map,
   DistanceCompare distance_compare, DistanceWeightCombine distance_weight_combine,
   DistanceInfinity distance_infinity, DistanceZero distance_zero);
@@ -69,7 +69,7 @@ Algorithms</A> for some background to the shortest-path problem.
 </P>

 <P>
-	<tt>dijkstra_shortest_paths_no_color_map</tt> differs from the original <tt>dijkstra_shortest_paths</tt> algorithm by not using a color map to identify vertices as discovered or undiscovered.  Instead, this is done with the distance map: a vertex <i>u</i> such that <i>distance_compare(distance_map[u], distance_infinity) == false</i> is considered to be undiscovered.  Note that this means that edges with infinite weight will not work correctly in this algorithm.
+	<tt>dijkstra_shortest_paths_no_color_map</tt> differs from the original <tt>dijkstra_shortest_paths</tt> algorithm by not using a color map to identify vertices as discovered or undiscovered.  Instead, this is done with the distance map: a vertex <i>u</i> such that <i>distance_compare(distance_map[u], distance_infinity) == false</i> is considered to be undiscovered.
 </P>

 <P>
@@ -116,20 +116,23 @@ indicated by the labels on the right.
 <td valign="top">
 <pre>
 DIJKSTRA(<i>G</i>, <i>s</i>, <i>w</i>)
-  <i>d[s] := 0</i>
+  <b>for</b> each vertex <i>u in V</i> <b>(This loop is not run in dijkstra_shortest_paths_no_color_map_no_init)</b>
+    <i>d[u] := infinity</i> 
+    <i>p[u] := u</i> 
+  <b>end for</b>
+  <i>d[s] := 0</i> 
  INSERT(<i>Q</i>, <i>s</i>)
  <b>while</b> (<i>Q != &Oslash;</i>)
    <i>u :=</i> EXTRACT-MIN(<i>Q</i>)
    <b>for</b> each vertex <i>v in Adj[u]</i>
      <b>if</b> (<i>w(u,v) + d[u] < d[v]</i>)
        <i>d[v] := w(u,v) + d[u]</i>
-        <i>p[v] := u</i>
-        <b>if</b> (<i>d[v]</i> was originally infinity)
-          INSERT(<i>Q</i>, <i>v</i>)
-        <b>else</b>
-          DECREASE-KEY(<i>Q</i>, <i>v</i>)
+        <i>p[v] := u</i> 
+        DECREASE-KEY(<i>Q</i>, <i>v</i>)
      <b>else</b>
      	...
+      <b>if</b> (<i>d[v]</i> was originally infinity) 
+        INSERT(<i>Q</i>, <i>v</i>)   
    <b>end for</b>
  <b>end while</b>
  return (<i>d</i>, <i>p</i>)
@@ -138,6 +141,10 @@ DIJKSTRA(<i>G</i>, <i>s</i>, <i>w</i>)
 <td valign="top">
 <pre>

+initialize vertex <i>u</i>
+
+
+

 discover vertex <i>s</i>

@@ -147,11 +154,10 @@ examine edge <i>(u,v)</i>
 edge <i>(u,v)</i> relaxed


-discover vertex <i>v</i>
-

 edge <i>(u,v)</i> not relaxed

+discover vertex <i>v</i>
 finish vertex <i>u</i>
 </pre>
 </td>
@@ -164,15 +170,15 @@ finish vertex <i>u</i>

 <h3>Parameters</h3>

-IN: <tt>const Graph&amp; graph</tt>
+IN: <tt>const Graph&amp; graph</tt> 
 <blockquote>
  The graph object on which the algorithm will be applied.
-  The type <tt>Graph</tt> must be a model of
+  The type <tt>Graph</tt> must be a model of 
  <a href="./VertexListGraph.html">Vertex List Graph</a>
  and <a href="./IncidenceGraph.html">Incidence Graph</a>.<br>
 </blockquote>

-IN: <tt>vertex_descriptor start_vertex</tt>
+IN: <tt>vertex_descriptor start_vertex</tt> 
 <blockquote>
  The source vertex. All distance will be calculated from this vertex,
  and the shortest paths tree will be rooted at this vertex.<br>
@@ -180,11 +186,11 @@ IN: <tt>vertex_descriptor start_vertex</tt>

 <h3>Named Parameters</h3>

-IN: <tt>weight_map(WeightMap weight_map)</tt>
+IN: <tt>weight_map(WeightMap weight_map)</tt>   
 <blockquote>
  The weight or ``length'' of each edge in the graph. The weights
  must all be non-negative and non-infinite <a href="#3">[3]</a>. The algorithm will throw a
-  <a href="./exception.html#negative_edge"><tt>negative_edge</tt></a>
+  <a href="./exception.html#negative_edge"><tt>negative_edge</tt></a> 
  exception is one of the edges is negative.
  The type <tt>WeightMap</tt> must be a model of
  <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map</a>. The edge descriptor type of
@@ -194,13 +200,13 @@ IN: <tt>weight_map(WeightMap weight_map)</tt>
  <b>Default:</b>  <tt>get(edge_weight, graph)</tt><br>
 </blockquote>

-IN: <tt>index_map(VertexIndexMap index_map)</tt>
+IN: <tt>index_map(VertexIndexMap index_map)</tt> 
 <blockquote>
  This maps each vertex to an integer in the range <tt>[0,
    num_vertices(graph))</tt>. This is necessary for efficient updates of the
  heap data structure&nbsp;[<A
  HREF="bibliography.html#driscoll88">61</A>] when an edge is relaxed.
-  The type
+  The type 
  <tt>VertexIndexMap</tt> must be a model of
  <a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map</a>. The value type of the map must be an
  integer type. The vertex descriptor type of the graph needs to be
@@ -208,12 +214,12 @@ IN: <tt>index_map(VertexIndexMap index_map)</tt>
  <b>Default:</b> <tt>get(vertex_index, graph)</tt>.
    Note: if you use this default, make sure your graph has
    an internal <tt>vertex_index</tt> property. For example,
-    <tt>adjacency_list</tt> with <tt>VertexList=listS</tt> does
+    <tt>adjacenty_list</tt> with <tt>VertexList=listS</tt> does
    not have an internal <tt>vertex_index</tt> property.
   <br>
 </blockquote>

-OUT: <tt>predecessor_map(PredecessorMap predecessor_map)</tt>
+OUT: <tt>predecessor_map(PredecessorMap predecessor_map)</tt> 
 <blockquote>
  The predecessor map records the edges in the minimum spanning
  tree. Upon completion of the algorithm, the edges <i>(p[u],u)</i>
@@ -229,7 +235,7 @@ OUT: <tt>predecessor_map(PredecessorMap predecessor_map)</tt>
  <b>Python</b>: Must be a <tt>vertex_vertex_map</tt> for the graph.<br>
 </blockquote>

-UTIL/OUT: <tt>distance_map(DistanceMap distance_map)</tt>
+UTIL/OUT: <tt>distance_map(DistanceMap distance_map)</tt> 
 <blockquote>
  The shortest path weight from the source vertex <tt>start_vertex</tt> to each
  vertex in the graph <tt>graph</tt> is recorded in this property map. The
@@ -237,13 +243,13 @@ UTIL/OUT: <tt>distance_map(DistanceMap distance_map)</tt>
  shortest path.  The type <tt>DistanceMap</tt> must be a model of <a
  href="../../property_map/doc/ReadWritePropertyMap.html">Read/Write
  Property Map</a>. The vertex descriptor type of the graph needs to
-  be usable as the key type of the distance map.
+  be usable as the key type of the distance map. 

  The value type of the distance map is the element type of a <a
  href="./Monoid.html">Monoid</a> formed with the <tt>distance_weight_combine</tt>
  function object and the <tt>distance_zero</tt> object for the identity
  element. Also the distance value type must have a <a
-  href="http://www.boost.org/sgi/stl/StrictWeakOrdering.html">
+  href="http://www.sgi.com/tech/stl/StrictWeakOrdering.html">
  StrictWeakOrdering</a> provided by the <tt>distance_compare</tt> function
  object.<br>
  <b>Default:</b> <a
@@ -254,12 +260,12 @@ UTIL/OUT: <tt>distance_map(DistanceMap distance_map)</tt>
  map.<br>
 </blockquote>

-IN: <tt>distance_compare(CompareFunction distance_compare)</tt>
+IN: <tt>distance_compare(CompareFunction distance_compare)</tt> 
 <blockquote>
  This function is use to compare distances to determine which vertex
  is closer to the source vertex.  The <tt>DistanceCompareFunction</tt> type
  must be a model of <a
-  href="http://www.boost.org/sgi/stl/BinaryPredicate.html">Binary
+  href="http://www.sgi.com/tech/stl/BinaryPredicate.html">Binary
  Predicate</a> and have argument types that match the value type of
  the <tt>DistanceMap</tt> property map.<br>

@@ -268,11 +274,11 @@ IN: <tt>distance_compare(CompareFunction distance_compare)</tt>
  property_traits&lt;DistanceMap&gt;::value_type</tt><br>
 </blockquote>

-IN: <tt>distance_combine(CombineFunction distance_weight_combine)</tt>
+IN: <tt>distance_combine(CombineFunction distance_weight_combine)</tt> 
 <blockquote>
  This function is used to combine distances to compute the distance
  of a path. The <tt>DistanceWeightCombineFunction</tt> type must be a model of <a
-  href="http://www.boost.org/sgi/stl/BinaryFunction.html">Binary
+  href="http://www.sgi.com/tech/stl/BinaryFunction.html">Binary
  Function</a>. The first argument type of the binary function must
  match the value type of the <tt>DistanceMap</tt> property map and
  the second argument type must match the value type of the
@@ -283,17 +289,15 @@ IN: <tt>distance_combine(CombineFunction distance_weight_combine)</tt>
   <tt>D=typename property_traits&lt;DistanceMap&gt;::value_type</tt><br>
 </blockquote>

-IN: <tt>distance_inf(D distance_infinity)</tt>
+IN: <tt>distance_inf(D distance_infinity)</tt> 
 <blockquote>
  The <tt>distance_infinity</tt> object must be the greatest value of any <tt>D</tt> object.
  That is, <tt>distance_compare(d, distance_infinity) == true</tt> for any <tt>d != distance_infinity</tt>.
-  The type <tt>D</tt> is the value type of the <tt>DistanceMap</tt>.  All edges
-  are assumed to have weight less than (by <tt>distance_compare</tt>) this
-  value.<br>
+  The type <tt>D</tt> is the value type of the <tt>DistanceMap</tt>.<br>
  <b>Default:</b> <tt>std::numeric_limits&lt;D&gt;::max()</tt><br>
 </blockquote>

-IN: <tt>distance_zero(D distance_zero)</tt>
+IN: <tt>distance_zero(D distance_zero)</tt> 
 <blockquote>
  The <tt>distance_zero</tt> value must be the identity element for the
  <a href="./Monoid.html">Monoid</a> formed by the distance values
@@ -302,13 +306,13 @@ IN: <tt>distance_zero(D distance_zero)</tt>
  <b>Default:</b> <tt>D()</tt>with
   <tt>D=typename property_traits&lt;DistanceMap&gt;::value_type</tt><br>
 </blockquote>
-
-OUT: <tt>visitor(DijkstraVisitor v)</tt>
+  
+OUT: <tt>visitor(DijkstraVisitor v)</tt>  
 <blockquote>
  Use this to specify actions that you would like to happen
  during certain event points within the algorithm.
  The type <tt>DijkstraVisitor</tt> must be a model of the
-  <a href="./DijkstraVisitor.html">Dijkstra Visitor</a> concept.
+  <a href="./DijkstraVisitor.html">Dijkstra Visitor</a> concept. 
 The visitor object is passed by value <a
  href="#2">[2]</a>.<br>
  <b>Default:</b> <tt>dijkstra_visitor&lt;null_visitor&gt;</tt><br>
@@ -318,7 +322,7 @@ OUT: <tt>visitor(DijkstraVisitor v)</tt>
 <H3>Complexity</H3>

 <P>
-The time complexity is <i>O(V log V + E)</i>.
+The time complexity is <i>O(V log V)</i>.


 <h3>Visitor Event Points</h3>
@@ -330,19 +334,19 @@ The time complexity is <i>O(V log V + E)</i>.
 <li><b><tt>vis.examine_vertex(u, g)</tt></b>
  is invoked on a vertex as it is removed from the priority queue
  and added to set <i>S</i>. At this point we know that <i>(p[u],u)</i>
-  is a shortest-paths tree edge so
-  <i>d[u] = delta(s,u) = d[p[u]] + w(p[u],u)</i>. Also, the distances
+  is a shortest-paths tree edge so 
+  <i>d[u] = delta(s,u) = d[p[u]] + w(p[u],u)</i>. Also, the distances 
  of the examined vertices is monotonically increasing
-  <i>d[u<sub>1</sub>] <= d[u<sub>2</sub>] <= d[u<sub>n</sub>]</i>.
+  <i>d[u<sub>1</sub>] <= d[u<sub>2</sub>] <= d[u<sub>n</sub>]</i>. 
 <li><b><tt>vis.examine_edge(e, g)</tt></b>
  is invoked on each out-edge of a vertex immediately after it has
-  been added to set <i>S</i>.
+  been added to set <i>S</i>. 
 <li><b><tt>vis.edge_relaxed(e, g)</tt></b>
  is invoked on edge <i>(u,v)</i> if <i>d[u] + w(u,v) < d[v]</i>.
  The edge <i>(u,v)</i> that participated in the last
-  relaxation for vertex <i>v</i> is an edge in the shortest paths tree.
+  relaxation for vertex <i>v</i> is an edge in the shortest paths tree. 
 <li><b><tt>vis.discover_vertex(v, g)</tt></b>
-  is invoked on vertex <i>v</i> when the edge
+  is invoked on vertex <i>v</i> when the edge 
  <i>(u,v)</i> is examined and <i>v</i> has not yet been discovered (i.e. its distance was infinity before relaxation was attempted on the edge).  This
  is also when the vertex is inserted into the priority queue.
 <li><b><tt>vis.edge_not_relaxed(e, g)</tt></b>
@@ -358,7 +362,7 @@ The time complexity is <i>O(V log V + E)</i>.
 See <a href="../example/dijkstra-no-color-map-example.cpp">
 <TT>example/dijkstra-no-color-map-example.cpp</TT></a> for an example of using Dijkstra's algorithm.

-<H3>See also</H3> <a href="dijkstra_shortest_paths.html">dijkstra_shortest_paths</a> for a version of Dijkstra's shortest path that uses a color map.
+<H3>See also</H3> <a href="dijkstra_shortest_paths.html">dijkstra_shortest_paths</a> for a version of dijkstra's shortest path that uses a color map.

 <H3>Notes</H3>

@@ -370,17 +374,17 @@ S</i> vertices in the priority queue at once, but instead only those
 vertices in <i>V - S</i> that are discovered and therefore have a
 distance less than infinity.

-<p><a name="2">[2]</a>
+<p><a name="2">[2]</a> 
  Since the visitor parameter is passed by value, if your visitor
  contains state then any changes to the state during the algorithm
  will be made to a copy of the visitor object, not the visitor object
  passed in. Therefore you may want the visitor to hold this state by
  pointer or reference.
-
-<p><a name="3">[3]</a>
+  
+<p><a name="3">[3]</a> 
  The algorithm will not work correctly if any of the edge weights are equal to infinity since the infinite distance value is used to determine if a vertex has been discovered.
-
-<p><a name="4">[4]</a>
+  
+<p><a name="4">[4]</a> 
  Calls to the visitor events occur in the same order as <tt>dijkstra_shortest_paths</tt> (i.e. <i>discover_vertex(u)</i> will always be called after <i>examine_vertex(u)</i> for an undiscovered vertex <i>u</i>).  However, the vertices of the graph given to <i>dijkstra_shortest_paths_no_color_map</i> will <b>not</b> necessarily be visited in the same order as <i>dijkstra_shortest_paths</i>.

 <br>
@@ -391,4 +395,4 @@ distance less than infinity.
 Trustees of Indiana University</TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: dijkstra_visitor</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -22,7 +22,7 @@ dijkstra_visitor&lt;EventVisitorList&gt;
 </H1>

 This class is an adapter that converts a list of <a
-href="./EventVisitor.html">EventVisitor</a>s (constructed using
+href="./EventVisitor.html">EventVisitor</a>'s (constructed using
 <tt>std::pair</tt>) into a <a
 href="./DijkstraVisitor.html">DijkstraVisitor</a>.

@@ -37,7 +37,7 @@ by Dijkstra's algorithm.

 <pre>
 boost::dijkstra_shortest_paths
-  (G, vertex(a, G),
+  (G, vertex(a, G), 
   distance_map(make_iterator_property_map(distance.begin(), vertex_id, distance[0])).
   predecessor_map(make_iterator_property_map(parent.begin(), vertex_id, parent[0])).
   visitor(make_dijkstra_visitor(copy_graph(G_copy, on_examine_edge()))));
@@ -77,7 +77,7 @@ with <tt>std::pair</tt>.
 This class implements all of the member functions required by <a
 href="./DijkstraVisitor.html">DijkstraVisitor</a>. In each
 function the appropriate event is dispatched to the <a
-href="./EventVisitor.html">EventVisitor</a> in the EventVisitorList.
+href="./EventVisitor.html">EventVisitor</a>'s in the EventVisitorList.

 <h3>Non-Member Functions</h3>

@@ -116,10 +116,10 @@ and <a href="./property_writer.html"><tt>property_writer</tt></a>.
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,96 +0,0 @@
-<HTML>
-<!--
-     Copyright (c) David Doria 2012
-
-     Distributed under 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)
-  -->
-<Head>
-<Title>Boost Graph Library: Directed Graph</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
-
-<BR Clear>
-
-<H1><A NAME="sec:directed-graph-class"></A>
-<pre>
-directed_graph&lt;VertexProp, EdgeProp, GraphProp&gt;
-</pre>
-</H1>
-
-
-<P>
-The <tt>directed_graph</tt> class template is a simplified version
-of the BGL adjacency list. This class is provided for ease of use, but
-may not perform as well as custom-defined adjacency list classes. Instances
-of this template model the BidirectionalGraph, VertexIndexGraph, and
-EdgeIndexGraph concepts.
-
-<H3>Example</H3>
-
-A simple examples of creating a directed_graph is available here <a href="../../../libs/graph/example/directed_graph.cpp"><tt>libs/graph/example/directed_graph.cpp</tt></a>.
-<P>
-
-
-<PRE>
-  typedef boost::directed_graph&lt;&gt; Graph;
-  Graph g;
-  boost::graph_traits&lt;Graph&gt;::vertex_descriptor v0 = g.add_vertex();
-  boost::graph_traits&lt;Graph&gt;::vertex_descriptor v1 = g.add_vertex();
-
-  g.add_edge(v0, v1);
-</PRE>
-
-<H3>Template Parameters</H3>
-
-<P>
-<TABLE border>
-<TR>
-<th>Parameter</th><th>Description</th><th>Default</th>
-</tr>
-
-<TR><TD><TT>VertexProp</TT></TD>
-<TD>A property map for the graph vertices.</TD>
-<TD>&nbsp;</TD>
-</TR>
-
-<TR>
-<TD><TT>EdgeProp</TT></TD>
-<TD>A property map for the graph edges.</TD>
-<TD>&nbsp;</TD>
-</TR>
-
-<TR>
-<TD><TT>GraphProp</TT></TD>
-<TD>A property map for the graph itself.</TD>
-</TR>
-
-</TABLE>
-<P>
-
-<H3>Where Defined</H3>
-
-<P>
-<a href="../../../boost/graph/directed_graph.hpp"><TT>boost/graph/directed_graph.hpp</TT></a>
-
-<P>
-
-<br>
-<HR>
-<TABLE>
-<TR valign=top>
-<TD nowrap>Copyright &copy; 2000-2001</TD><TD>
-<A HREF="http://www.boost.org/people/jeremy_siek.htm">Jeremy Siek</A>,
-Indiana University (<A
-HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
-<A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
-Indiana University (<A
-HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
-</TD></TR></TABLE>
-
-</BODY>
-</HTML>
@@ -1,309 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-<head>
-  <meta http-equiv="Content-Language" content="en-us">
-  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
-
-  <title>Boost Disjoint Sets</title>
-</head>
-
-<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
-"#FF0000">
-  <img src="../../../boost.png" alt="C++ Boost" width="277" height=
-  "86"><br clear="none">
-
-  <h1><a name="sec:disjoint-sets" id="sec:disjoint-sets"></a> Disjoint
-  Sets</h1>
-  <pre>
-disjoint_sets&lt;Rank, Parent, FindCompress&gt;
-</pre>
-
-  <p>This is a class that provides disjoint set operations with <i>union by
-  rank</i> and <i>path compression</i>. A disjoint-sets data structure
-  maintains a collection <i>S = {S<sub>1</sub>, S<sub>2</sub>, ...,
-  S<sub>k</sub>}</i> of disjoint sets. Each set is identified by a
-  <i>representative</i> which is some member of of the set. Sets are
-  represented by rooted trees which are encoded in the <tt>Parent</tt>
-  property map. Two heuristics: "union by rank" and "path compression" are
-  used to speed up the operations&nbsp;[<a href=
-  "./disjoint_sets_biblio.html#tarjan83:_data_struct_network_algo">1</a>, <a href=
-  "./disjoint_sets_biblio.html#clr90">2</a>].</p>
-
-  <h3>Where Defined</h3><a href=
-  "../../boost/pending/disjoint_sets.hpp"><tt>boost/pending/disjoint_sets.hpp</tt></a>
-
-  <h3>Template Parameters</h3>
-
-  <table border summary="">
-    <tr>
-      <td><tt>Rank</tt></td>
-
-      <td>must be a model of <a href=
-      "../property_map/doc/ReadWritePropertyMap.html">ReadWritePropertyMap</a>
-      with an integer value type and a key type equal to the set's element
-      type.</td>
-    </tr>
-
-    <tr>
-      <td><tt>Parent</tt></td>
-
-      <td>must be a model of <a href=
-      "../property_map/doc/ReadWritePropertyMap.html">ReadWritePropertyMap</a>
-      and the key and value type the same as the set's element type.</td>
-    </tr>
-
-    <tr>
-      <td><tt>FindCompress</tt></td>
-
-      <td>should be one of the find representative and path compress function
-      objects.</td>
-    </tr>
-  </table>
-
-  <h3>Example</h3>
-
-  <p>A typical usage pattern for <tt>disjoint_sets</tt> can be seen in the
-  <a href=
-  "../graph/doc/kruskal_min_spanning_tree.html"><tt>kruskal_minimum_spanning_tree()</tt></a>
-  algorithm. In this example, we call <tt>link()</tt> instead of
-  <tt>union_set()</tt> because <tt>u</tt> and <tt>v</tt> were obtained from
-  <tt>find_set()</tt> and therefore are already the representatives for their
-  sets.</p>
-  <pre>
-  ...
-  disjoint_sets&lt;Rank, Parent, FindCompress&gt; dsets(rank, p);
-
-  for (ui  = vertices(G).first; ui != vertices(G).second; ++ui)
-    dsets.make_set(*ui);
-  ...
-  while ( !Q.empty() ) {
-    e = Q.front();
-    Q.pop();
-    u = dsets.find_set(source(e));
-    v = dsets.find_set(target(e));
-    if ( u != v ) {
-      *out++ = e;
-      dsets.link(u, v);
-    }
-  }
-</pre>
-
-  <h3>Members</h3>
-
-  <table border summary="">
-    <tr>
-      <th>Member</th>
-
-      <th>Description</th>
-    </tr>
-
-    <tr>
-      <td><tt>disjoint_sets(Rank r, Parent p)</tt></td>
-
-      <td>Constructor.</td>
-    </tr>
-
-    <tr>
-      <td><tt>disjoint_sets(const disjoint_sets&amp; x)</tt></td>
-
-      <td>Copy constructor.</td>
-    </tr>
-
-    <tr>
-      <td><tt>template &lt;class Element&gt;<br>
-      void make_set(Element x)</tt></td>
-
-      <td>Creates a singleton set containing Element <tt>x</tt>.</td>
-    </tr>
-
-    <tr>
-      <td><tt>template &lt;class Element&gt;<br>
-      void link(Element x, Element y)</tt></td>
-
-      <td>Union the two sets <i>represented</i> by element <tt>x</tt> and
-      <tt>y</tt>.</td>
-    </tr>
-
-    <tr>
-      <td><tt>template &lt;class Element&gt;<br>
-      void union_set(Element x, Element y)</tt></td>
-
-      <td>Union the two sets that <i>contain</i> elements <tt>x</tt> and
-      <tt>y</tt>. This is equivalent to
-      <tt>link(find_set(x),find_set(y))</tt>.</td>
-    </tr>
-
-    <tr>
-      <td><tt>template &lt;class Element&gt;<br>
-      Element find_set(Element x)</tt></td>
-
-      <td>Return the representative for the set containing element
-      <tt>x</tt>.</td>
-    </tr>
-
-    <tr>
-      <td><tt>template &lt;class ElementIterator&gt;<br>
-      std::size_t count_sets(ElementIterator first, ElementIterator
-      last)</tt></td>
-
-      <td>Returns the number of disjoint sets.</td>
-    </tr>
-
-    <tr>
-      <td><tt>template &lt;class ElementIterator&gt;<br>
-      void compress_sets(ElementIterator first, ElementIterator
-      last)</tt></td>
-
-      <td>Flatten the parents tree so that the parent of every element is its
-      representative.</td>
-    </tr>
-  </table>
-
-  <h3>Complexity</h3>
-
-  <p>The time complexity is <i>O(m alpha(m,n))</i>, where <i>alpha</i> is the
-  inverse Ackermann's function, <i>m</i> is the number of disjoint-set
-  operations (<tt>make_set()</tt>, <tt>find_set()</tt>, and <tt>link()</tt>
-  and <i>n</i> is the number of elements. The <i>alpha</i> function grows
-  very slowly, much more slowly than the <i>log</i> function.</p>
-
-  <h3>See Also</h3><a href=
-  "incremental_components.html"><tt>incremental_connected_components()</tt></a>
-  <hr>
-  <pre>
-disjoint_sets_with_storage&lt;ID,InverseID,FindCompress&gt;
-</pre>
-
-  <p>This class manages the storage for the rank and parent properties
-  internally. The storage is in arrays, which are indexed by element ID,
-  hence the requirement for the <tt>ID</tt> and <tt>InverseID</tt> functors.
-  The rank and parent properties are initialized during construction so the
-  each element is in a set by itself (so it is not necessary to initialize
-  objects of this class with the <a href=
-  "incremental_components.html#sec:initialize-incremental-components">
-  <tt>initialize_incremental_components()</tt></a> function). This class is
-  especially useful when computing the (dynamic) connected components of an
-  <tt>edge_list</tt> graph which does not provide a place to store vertex
-  properties.</p>
-
-  <h3>Template Parameters</h3>
-
-  <table border summary="">
-    <tr>
-      <th>Parameter</th>
-
-      <th>Description</th>
-
-      <th>Default</th>
-    </tr>
-
-    <tr>
-      <td><tt>ID</tt></td>
-
-      <td>must be a model of <a href=
-      "../property_map/doc/ReadablePropertyMap.html">ReadablePropertyMap</a> that
-      maps elements to integers between zero 0 and N, the total number of
-      elements in the sets.</td>
-
-      <td><tt>boost::identity_property_map</tt></td>
-    </tr>
-
-    <tr>
-      <td><tt>InverseID</tt></td>
-
-      <td>must be a model of <a href=
-      "../property_map/doc/ReadablePropertyMap.html">ReadablePropertyMap</a> that
-      maps integers to elements.</td>
-
-      <td><tt>boost::identity_property_map</tt></td>
-    </tr>
-
-    <tr>
-      <td><tt>FindCompress</tt></td>
-
-      <td>should be one of the find representative and path compress function
-      objects.</td>
-
-      <td><tt>representative_with_full_path_compression</tt></td>
-    </tr>
-  </table>
-
-  <h3>Members</h3>
-
-  <p>This class has all of the members in <tt>disjoint_sets</tt> as well as
-  the following members.</p>
-  <pre>
-disjoint_sets_with_storage(size_type n = 0,
-                           ID id = ID(),
-                           InverseID inv = InverseID())
-</pre>Constructor.
-  <pre>
-template &lt;class ElementIterator&gt;
-void disjoint_sets_with_storage::
-  normalize_sets(ElementIterator first, ElementIterator last)
-</pre>This rearranges the representatives such that the representative of
-each set is the element with the smallest ID.<br>
-  Postcondition: <tt>v &gt;= parent[v]</tt><br>
-  Precondition: the disjoint sets structure must be compressed.<br>
-  <hr>
-
-  <h2><a name="sec:representative-with-path-halving" id=
-  "sec:representative-with-path-halving"></a></h2>
-  <pre>
-representative_with_path_halving&lt;Parent&gt;
-</pre>
-
-  <p>This is a functor which finds the representative vertex for the same
-  component as the element <tt>x</tt>. While traversing up the representative
-  tree, the functor also applies the path halving technique to shorten the
-  height of the tree.</p>
-  <pre>
-Element operator()(Parent p, Element x)
-</pre>
-  <hr>
-
-  <h2><a name="sec:representative-with-full-path-compression" id=
-  "sec:representative-with-full-path-compression"></a><br></h2>
-  <pre>
-representative_with_full_path_compression&lt;Parent&gt;
-</pre>
-
-  <p>This is a functor which finds the representative element for the set
-  that element <tt>x</tt> belongs to.</p>
-  <pre>
-Element operator()(Parent p, Element x)
-</pre>
-
-  <p><br></p>
-  <hr>
-
-  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
-  "../../doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
-  height="31" width="88"></a></p>
-
-  <p>Revised
-  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->01
-  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38508" --></p>
-
-  <table summary="">
-    <tr valign="top">
-      <td nowrap><i>Copyright &copy; 2000</i></td>
-
-      <td><i><a href="http://www.boost.org/people/jeremy_siek.htm">Jeremy Siek</a>, Univ.of
-      Notre Dame (<a href="mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</a>)<br>
-      <a href="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</a>,
-      Univ.of Notre Dame (<a href=
-      "mailto:llee1@lsc.nd.edu">llee1@lsc.nd.edu</a>)<br>
-      <a href="http://www.lsc.nd.edu/~lums">Andrew Lumsdaine</a>, Univ.of
-      Notre Dame (<a href=
-      "mailto:lums@lsc.nd.edu">lums@lsc.nd.edu</a>)</i></td>
-    </tr>
-  </table>
-
-  <p><i>Distributed under the Boost Software License, Version 1.0. (See
-  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
-  copy at <a href=
-  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
-</body>
-</html>
@@ -1,59 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-<head>
-  <meta http-equiv="Content-Language" content="en-us">
-  <meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
-
-  <title>Boost Utility Library: Bibliography</title>
-</head>
-
-<body bgcolor="#FFFFFF" link="#0000EE" text="#000000" vlink="#551A8B" alink=
-"#FF0000">
-  <img src="../../../boost.png" alt="C++ Boost" width="277" height=
-  "86"><br clear="none">
-
-  <h2>Bibliography</h2>
-
-  <dl compact>
-    <dt><a name="tarjan83:_data_struct_network_algo" id=
-    "tarjan83:_data_struct_network_algo">1</a></dt>
-
-    <dd>R.&nbsp;E. Tarjan.<br>
-    <em>Data Structures and Network Algorithms</em>.<br>
-    Society for Industrial and Applied Mathematics, 1983.</dd>
-
-    <dt>&nbsp;</dt>
-
-    <dt><a name="clr90" id="clr90">2</a></dt>
-
-    <dd>T.&nbsp;Cormen, C.&nbsp;Leiserson, and R.&nbsp;Rivest.<br>
-    <em>Introduction to Algorithms</em>.<br>
-    McGraw-Hill, 1990.</dd>
-  </dl><br>
-  <hr>
-
-  <p><a href="http://validator.w3.org/check?uri=referer"><img border="0" src=
-  "../../doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
-  height="31" width="88"></a></p>
-
-  <p>Revised
-  <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %B, %Y" startspan -->01
-  December, 2006<!--webbot bot="Timestamp" endspan i-checksum="38508" --></p>
-
-  <table summary="">
-    <tr valign="top">
-      <td nowrap><i>Copyright &copy; 2000</i></td>
-
-      <td><i><a href="http://www.boost.org/people/jeremy_siek.htm">Jeremy Siek</a>, Univ.of
-      Notre Dame (<a href=
-      "mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</a>)</i></td>
-    </tr>
-  </table>
-
-  <p><i>Distributed under the Boost Software License, Version 1.0. (See
-  accompanying file <a href="../../LICENSE_1_0.txt">LICENSE_1_0.txt</a> or
-  copy at <a href=
-  "http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</a>)</i></p>
-</body>
-</html>
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: distance_recorder</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -27,7 +27,7 @@ href="property_map.html">property map</a>) from some
 source vertex during a graph search. When applied to edge <i>e =
 (u,v)</i>, the distance of <i>v</i> is recorded to be one more than
 the distance of <i>u</i>. The distance recorder is typically used with
-the <tt>on_tree_edge</tt> or <tt>on_relax_edge</tt> events and
+the <tt>on_tree_edge</tt> or <tt>on_relax_edge</tt> events, and
 cannot be used with vertex events.

 <p>
@@ -64,7 +64,7 @@ See the example for <a href="./bfs_visitor.html"><tt>bfs_visitor</tt></a>.
 <TR><TD><TT>DistanceMap</TT></TD>
 <TD>
 A <a
-href="../../property_map/doc/WritablePropertyMap.html">WritablePropertyMap</a>
+href="../../property_map/doc/WritablePropertyMap.html">WritablePropertyMap</a>,
 where the key type and the value type are the vertex descriptor type
 of the graph.
 </TD>
@@ -124,7 +124,7 @@ template &lt;class Edge, class Graph&gt;<br>
 void operator()(Edge e, const Graph& g);
 </tt></td>
 <td>
-Given edge <i>e = (u,v)</i>, this records the distance of <i>v</i> as
+Given edge <i>e = (u,v)</i>, this records the distance of <i>v</i> as 
 one plus the distance of <i>u</i>.
 </td>
 </tr>
@@ -153,7 +153,7 @@ A convenient way to create a <tt>distance_recorder</tt>.
 <a href="./visitor_concepts.html">Visitor concepts</a>
 <p>
 The following are other event visitors: <a
- href="./predecessor_recorder.html"><tt>predecessor_recorder</tt></a>,
+ href="./distance_recorder.html"><tt>predecessor_recorder</tt></a>,
 <a href="./time_stamper.html"><tt>time_stamper</tt></a>,
 and <a href="./property_writer.html"><tt>property_writer</tt></a>.

@@ -167,13 +167,13 @@ and <a href="./property_writer.html"><tt>property_writer</tt></a>.
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
 <!--  LocalWords:  DistanceMap EventTag EventVisitor map bfs dfs const Siek
 -->
 <!--  LocalWords:  EventVisitorList WritablePropertyMap Univ Quan
@@ -1,98 +0,0 @@
-<HTML>
-<!--
-  ~~ Copyright (c) Maciej Piechotka 2013
-  ~~
-     Distributed under 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)
-->
-
-
-<Head>
-<Title>Boost Graph Library: Edge Coloring</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
-
-<BR Clear>
-
-<H1>
-<!-- <img src="figs/python.gif" alt="(Python)"/> -->
-<TT>edge_coloring</TT>
-</H1>
-
-
-<P>
-<DIV ALIGN="LEFT">
-<TABLE CELLPADDING=3 border>
-<TR><TH ALIGN="LEFT"><B>Graphs:</B></TH>
-<TD ALIGN="LEFT">undirected, loop-free</TD>
-</TR>
-<TR><TH ALIGN="LEFT"><B>Properties:</B></TH>
-<TD ALIGN="LEFT">color</TD>
-</TR>
-<TR><TH ALIGN="LEFT"><B>Complexity:</B></TH>
-<TD ALIGN="LEFT">time: <i>O(|E| |V|)</i> </TD>
-</TR>
-</TABLE>
-</DIV>
-
-
-<pre>
-  template &lt;class Graph, class ColorMap&gt;
-  typename boost::property_traits<ColorMap>::value_type
-  edge_coloring(const Graph &amp;g, ColorMap color);
-</pre>
-
-<p>Computes an edge coloring for the vertices in the graph, using
-an algorithm proposed by Misra et al. []. Given edges ordered
-e<sub>1</sub>, e<sub>2</sub>, ..., e<sub>n</sub> it assignes a
-colors c<sub>1</sub>, c<sub>2</sub>, ..., c<sub>n</sub> in a way
-that no vertex connects with 2 edges of the same color. Furthermore
-at most m + 1 colors are used.
-
-<!-- Misra, J., & Gries, D. (1992). A constructive proof of Vizing's theorem. In Information Processing Letters. -->
-
-<h3>Where defined</h3>
-<a href="../../../boost/graph/edge_coloring.hpp"><tt>boost/graph/edge_coloring.hpp</tt></a>
-
-<h3>Parameters</h3>
-
-IN: <tt>const Graph&amp; g</tt>
-<blockquote>
-  The graph object on which the algorithm will be applied. The type
-  <tt>Graph</tt> must be a model of <a href="EdgeListGraph.html">
-  Edge List Graph</a> and <a href="IncidenceGraph.html">Incidence
-  Graph</a>.
-</blockquote>
-
-OUT: <tt>ColorMap color</tt>
-<blockquote>
-  This property map records the colors of each edges. It must be a
-  model of <A HREF="../../property_map/doc/ReadWritePropertyMap.html">
-  Read/Write Property Map</A> whose key type is the same as the edge
-  descriptor type of the graph and whose value type is an integral type
-  that can store all values smaller or equal to m.
-</blockquote>
-
-
-<h3>Example</h3>
-
-See <A
-href="../example/edge_coloring.cpp"><tt>example/edge_coloring.cpp</tt></A>.
-
-<h3>See Also</h3>
-
-<A href="./sequential_vertex_coloring.html">sequential vertex ordering</tt></A>.
-
-<br>
-<HR>
-<TABLE>
-<TR valign=top>
-<TD nowrap>Copyright &copy; 2013</TD><TD>
-Maciej Piechotka (<A HREF="mailto:uzytkownik2@gmail.com">uzytkownik2@gmail.com</A>)
-</TD></TR></TABLE>
-
-</BODY>
-</HTML>
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Edge List Class</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -52,7 +52,7 @@ Applying the Bellman-Ford shortest paths algorithm to an
                E(x,y), E(x,v),
                E(y,v), E(y,z),
                E(z,u), E(z,x) };
-
+  
  int weight[] = { -4, 8, 5,
                   -2,
                   9, -3,
@@ -61,16 +61,16 @@ Applying the Bellman-Ford shortest paths algorithm to an

  typedef boost::edge_list&lt;E*&gt; Graph;
  Graph g(edges, edges + sizeof(edges) / sizeof(E));
-
+    
  std::vector&lt;int&gt; distance(N, std::numeric_limits&lt;short&gt;::max());
  std::vector&lt;int&gt; parent(N,-1);
-
+  
  distance[z] = 0;
  parent[z] = z;
  bool r = boost::bellman_ford_shortest_paths(g, int(N), weight,
                                              distance.begin(),
                                              parent.begin());
-  if (r)
+  if (r)  
    for (int i = 0; i &lt; N; ++i)
      std::cout &lt;&lt; name[i] &lt;&lt; ": " &lt;&lt; distance[i]
                &lt;&lt; " " &lt;&lt; name[parent[i]] &lt;&lt; std::endl;
@@ -104,7 +104,7 @@ of each vertex in the shortest paths tree.
 </tr>

 <TR><TD><TT>EdgeIterator</TT></TD> <TD>Must be model of <a
-href="http://www.boost.org/sgi/stl/InputIterator.html">InputIterator</a>
+href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</a>
 who's <TT>value_type</TT> must be a pair of vertex descriptors.</TD>
 </TR>

@@ -145,7 +145,7 @@ boost::graph_traits&lt;edge_list&gt;::edge_descriptor
 </tt>
 <br><br>
 The type for the edge descriptors associated with the
-<TT>edge_list</TT>.
+<TT>edge_list</TT>. 

 <hr>

@@ -212,10 +212,10 @@ Returns the target vertex of edge <TT>e</TT>.
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,197 +0,0 @@
-<HTML>
-<!--
-     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
-     Distributed under 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)
-  -->
-<Head>
-<Title>Boost Graph Library: edge_predecessor_recorder</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
-
-<BR Clear>
-
-<H1>
-<pre>
-edge_predecessor_recorder&lt;PredEdgeMap, EventTag&gt;
-</pre>
-</H1>
-
-This is an <a href="./EventVisitor.html">EventVisitor</a> that records
-the predecessor (or parent) edge of a vertex in a property
-map. This is particularly useful in graph search algorithms where
-recording the predecessors is an efficient way to encode the search
-tree that was traversed during the search. The edge predecessor recorder is
-typically used with the <tt>on_tree_edge</tt> or
-<tt>on_relax_edge</tt> events and cannot be used with vertex events.  This
-visitor is meant to be used instead of <a
-href="predecessor_recorder.html"><tt>predecessor_recorder</tt></a> when a
-graph has parallel edges and it is necessary to know which incoming edge a
-search algorithm
-used to get to a particular vertex.
-
-<p>
-<tt>edge_predecessor_recorder</tt> can be used with graph algorithms by
-wrapping it with an algorithm-specific adaptor, such as <a
-href="./bfs_visitor.html"><tt>bfs_visitor</tt></a> and <a
-href="./dfs_visitor.html"><tt>dfs_visitor</tt></a>. Also, this event
-visitor can be combined with other event visitors using
-<tt>std::pair</tt> to form an EventVisitorList.
-
-<p>
-Algorithms such as Dijkstra's and breadth-first search will not assign
-a predecessor edge to the source vertex (which is the root of the search
-tree). It is often useful to initialize the source vertex's
-predecessor to a special value, thereby identifying the root vertex.
-When using an algorithm like
-depth-first search that creates a forest (multiple search trees) it
-is useful to do the same for every vertex. This
-way all the root nodes can be distinguished.
-
-
-<!-- <h3>Example</h3>
-
-See the example for <a href="./bfs_visitor.html"><tt>bfs_visitor</tt></a>.
-->
-
-<h3>Model of</h3>
-
-<a href="./EventVisitor.html">EventVisitor</a>
-
-
-<H3>Where Defined</H3>
-
-<P>
-<a href="../../../boost/graph/visitors.hpp">
-<TT>boost/graph/visitors.hpp</TT></a>
-
-<H3>Template Parameters</H3>
-
-<P>
-<TABLE border>
-<TR>
-<th>Parameter</th><th>Description</th><th>Default</th>
-</tr>
-
-<TR><TD><TT>PredEdgeMap</TT></TD>
-<TD>
-A <a
-href="../../property_map/doc/WritablePropertyMap.html">WritablePropertyMap</a>
-where the key and value types are the vertex and edge descriptor types, respectively, of the graph.
-</TD>
-<TD>&nbsp;</TD>
-</TR>
-
-<TR><TD><TT>EventTag</TT></TD>
-<TD>
-The tag to specify when the <tt>edge_predecessor_recorder</tt> should be
-applied during the graph algorithm. <tt>EventTag</tt> must be an
-edge event.
-</TD>
-<TD>&nbsp;</TD>
-</TR>
-
-</table>
-
-<H2>Associated Types</H2>
-
-<table border>
-
-<tr>
-<th>Type</th><th>Description</th>
-</tr>
-
-<tr>
-<td><tt>edge_predecessor_recorder::event_filter</tt></td>
-<td>
-This will be the same type as the template parameter <tt>EventTag</tt>.
-</td>
-</tr>
-
-</table>
-
-<h3>Member Functions</h3>
-
-<p>
-
-<table border>
-<tr>
-<th>Member</th><th>Description</th>
-</tr>
-
-<tr>
-<td><tt>
-edge_predecessor_recorder(PredEdgeMap pa);
-</tt></td>
-<td>
-Construct an edge predecessor recorder object with predecessor property map
-<tt>pa</tt>.
-</td>
-</tr>
-
-<tr>
-<td><tt>
-template &lt;class Edge, class Graph&gt;<br>
-void operator()(Edge e, const Graph& g);
-</tt></td>
-<td>
-Given edge <i>e = (u,v)</i>, this records <i>e</i> as the
-predecessor (or parent) edge of <i>v</i>.
-</td>
-</tr>
-
-</table>
-
-<h3>Non-Member Functions</h3>
-
-<table border>
-<tr>
-<th>Function</th><th>Description</th>
-</tr>
-
-<tr><td><tt>
-template &lt;class PredEdgeMap, class Tag&gt;<br>
-edge_predecessor_recorder&lt;PredEdgeMap, Tag&gt; <br>
-record_edge_predecessors(PredEdgeMap pa, Tag);
-</tt></td><td>
-A convenient way to create a <tt>edge_predecessor_recorder</tt>.
-</td></tr>
-
-</table>
-
-<h3>See Also</h3>
-
-<a href="./visitor_concepts.html">Visitor concepts</a>
-<p>
-The following are other event visitors: <a
-<a href="./distance_recorder.html"><tt>distance_recorder</tt></a>,
-<a href="./time_stamper.html"><tt>time_stamper</tt></a>,
-and <a href="./property_writer.html"><tt>property_writer</tt></a>.
-
-
-<br>
-<HR>
-<TABLE>
-<TR valign=top>
-<TD nowrap>Copyright &copy; 2000-2001</TD><TD>
-<A HREF="http://www.boost.org/people/jeremy_siek.htm">Jeremy Siek</A>,
-Indiana University (<A
-HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
-<A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
-Indiana University (<A
-HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
-</TD></TR></TABLE>
-
-</BODY>
-</HTML>
-<!--  LocalWords:  PredEdgeMap EventTag EventVisitor map bfs dfs const
- -->
-<!--  LocalWords:  EventVisitorList WritablePropertyMap Siek Univ Quan
- -->
-<!--  LocalWords:  Lumsdaine
- -->
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Edmonds-Karp Maximum Flow</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -20,23 +20,23 @@
 </H1>

 <PRE>
-<i>// named parameter version</i>
+<i>// named paramter version</i>
 template &lt;class <a href="./Graph.html">Graph</a>, class P, class T, class R&gt;
 typename detail::edge_capacity_value&lt;Graph, P, T, R&gt;::value_type
-edmonds_karp_max_flow(Graph& g,
+edmonds_karp_max_flow(Graph& g, 
   typename graph_traits&lt;Graph&gt;::vertex_descriptor src,
   typename graph_traits&lt;Graph&gt;::vertex_descriptor sink,
   const bgl_named_params&lt;P, T, R&gt;&amp; params = <i>all defaults</i>)

 <i>// non-named parameter version</i>
-template &lt;class <a href="./Graph.html">Graph</a>,
+template &lt;class <a href="./Graph.html">Graph</a>, 
 	  class CapacityEdgeMap, class ResidualCapacityEdgeMap,
 	  class ReverseEdgeMap, class ColorMap, class PredEdgeMap&gt;
 typename property_traits&lt;CapacityEdgeMap&gt;::value_type
-edmonds_karp_max_flow(Graph&amp; g,
+edmonds_karp_max_flow(Graph&amp; g, 
   typename graph_traits&lt;Graph&gt;::vertex_descriptor src,
   typename graph_traits&lt;Graph&gt;::vertex_descriptor sink,
-   CapacityEdgeMap cap, ResidualCapacityEdgeMap res, ReverseEdgeMap rev,
+   CapacityEdgeMap cap, ResidualCapacityEdgeMap res, ReverseEdgeMap rev, 
   ColorMap color, PredEdgeMap pred)
 </PRE>

@@ -48,7 +48,7 @@ Flow Algorithms</a> for a description of maximum flow.  The calculated
 maximum flow will be the return value of the function. The function
 also calculates the flow values <i>f(u,v)</i> for all <i>(u,v)</i> in
 <i>E</i>, which are returned in the form of the residual capacity
-<i>r(u,v) = c(u,v) - f(u,v)</i>.
+<i>r(u,v) = c(u,v) - f(u,v)</i>. 

 <p>
 There are several special requirements on the input graph and property
@@ -76,7 +76,7 @@ the maximum flow problem. However, there are several reasons why this
 algorithm is not as good as the <a
 href="./push_relabel_max_flow.html"><tt>push_relabel_max_flow()</tt></a>
 or the <a
-href="./boykov_kolmogorov_max_flow.html"><tt>boykov_kolmogorov_max_flow()</tt></a>
+href="./kolmogorov_max_flow.html"><tt>kolmogorov_max_flow()</tt></a>
 algorithm.

 <ul>
@@ -112,12 +112,12 @@ IN: <tt>vertex_descriptor src</tt>
 <blockquote>
  The source vertex for the flow network graph.
 </blockquote>
-
+  
 IN: <tt>vertex_descriptor sink</tt>
 <blockquote>
  The sink vertex for the flow network graph.
 </blockquote>
-
+  
 <h3>Named Parameters</h3>


@@ -129,7 +129,7 @@ IN: <tt>capacity_map(CapacityEdgeMap cap)</tt>
  key type of the map must be the graph's edge descriptor type.<br>
  <b>Default:</b> <tt>get(edge_capacity, g)</tt>
 </blockquote>
-
+  
 OUT: <tt>residual_capacity_map(ResidualCapacityEdgeMap res)</tt>
 <blockquote>
  This maps edges to their residual capacity. The type must be a model
@@ -195,7 +195,7 @@ IN: <tt>vertex_index_map(VertexIndexMap i_map)</tt>
  <b>Default:</b> <tt>get(vertex_index, g)</tt>
    Note: if you use this default, make sure your graph has
    an internal <tt>vertex_index</tt> property. For example,
-    <tt>adjacency_list</tt> with <tt>VertexList=listS</tt> does
+    <tt>adjacenty_list</tt> with <tt>VertexList=listS</tt> does
    not have an internal <tt>vertex_index</tt> property.
 </blockquote>

@@ -217,7 +217,7 @@ from a file in the DIMACS format and computes the maximum flow.
 <h3>See Also</h3>

 <a href="./push_relabel_max_flow.html"><tt>push_relabel_max_flow()</tt></a><br>
-<a href="./boykov_kolmogorov_max_flow.html"><tt>boykov_kolmogorov_max_flow()</tt></a>.
+<a href="./kolmogorov_max_flow.html"><tt>kolmogorov_max_flow()</tt></a>.

 <br>
 <HR>
@@ -228,7 +228,7 @@ from a file in the DIMACS format and computes the maximum flow.
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
 <!--  LocalWords:  HTML Siek Edmonds BGCOLOR ffffff ee VLINK ALINK ff IMG SRC
 -->
 <!--  LocalWords:  gif ALT BR sec edmonds karp TT DIV CELLPADDING TR TD PRE lt
@@ -30,95 +30,77 @@

 using namespace boost;

-enum
+
+enum { a, b, c, d, e, f, g, h };
+enum { _1, _2, _3, _4, _5, _6, _7, _8 };
+
+void test_isomorphism() 
 {
-    a,
-    b,
-    c,
-    d,
-    e,
-    f,
-    g,
-    h
-};
-enum
-{
-    _1,
-    _2,
-    _3,
-    _4,
-    _5,
-    _6,
-    _7,
-    _8
-};
+  typedef adjacency_list<vecS, vecS, bidirectionalS> GraphA;
+  typedef adjacency_list<vecS, vecS, bidirectionalS> GraphB;

-void test_isomorphism()
-{
-    typedef adjacency_list< vecS, vecS, bidirectionalS > GraphA;
-    typedef adjacency_list< vecS, vecS, bidirectionalS > GraphB;
+  char a_names[] = "abcdefgh";
+  char b_names[] = "12345678";

-    char a_names[] = "abcdefgh";
-    char b_names[] = "12345678";
+  GraphA Ga(8);
+  add_edge(a, d, Ga);
+  add_edge(a, h, Ga);
+  add_edge(b, c, Ga);
+  add_edge(b, e, Ga);
+  add_edge(c, f, Ga);
+  add_edge(d, a, Ga);
+  add_edge(d, h, Ga);
+  add_edge(e, b, Ga);
+  add_edge(f, b, Ga);
+  add_edge(f, e, Ga);
+  add_edge(g, d, Ga);
+  add_edge(g, f, Ga);
+  add_edge(h, c, Ga);
+  add_edge(h, g, Ga);

-    GraphA Ga(8);
-    add_edge(a, d, Ga);
-    add_edge(a, h, Ga);
-    add_edge(b, c, Ga);
-    add_edge(b, e, Ga);
-    add_edge(c, f, Ga);
-    add_edge(d, a, Ga);
-    add_edge(d, h, Ga);
-    add_edge(e, b, Ga);
-    add_edge(f, b, Ga);
-    add_edge(f, e, Ga);
-    add_edge(g, d, Ga);
-    add_edge(g, f, Ga);
-    add_edge(h, c, Ga);
-    add_edge(h, g, Ga);
+  GraphB Gb(8);
+  add_edge(_1, _6, Gb);
+  add_edge(_2, _1, Gb);
+  add_edge(_2, _5, Gb);
+  add_edge(_3, _2, Gb);
+  add_edge(_3, _4, Gb);
+  add_edge(_4, _2, Gb);
+  add_edge(_4, _3, Gb);
+  add_edge(_5, _4, Gb);
+  add_edge(_5, _6, Gb);
+  add_edge(_6, _7, Gb);
+  add_edge(_6, _8, Gb);
+  add_edge(_7, _8, Gb);
+  add_edge(_8, _1, Gb);
+  add_edge(_8, _7, Gb);
+  

-    GraphB Gb(8);
-    add_edge(_1, _6, Gb);
-    add_edge(_2, _1, Gb);
-    add_edge(_2, _5, Gb);
-    add_edge(_3, _2, Gb);
-    add_edge(_3, _4, Gb);
-    add_edge(_4, _2, Gb);
-    add_edge(_4, _3, Gb);
-    add_edge(_5, _4, Gb);
-    add_edge(_5, _6, Gb);
-    add_edge(_6, _7, Gb);
-    add_edge(_6, _8, Gb);
-    add_edge(_7, _8, Gb);
-    add_edge(_8, _1, Gb);
-    add_edge(_8, _7, Gb);
+  std::vector<std::size_t> in_degree_A(num_vertices(Ga));
+  boost::detail::compute_in_degree(Ga, &in_degree_A[0]);

-    std::vector< std::size_t > in_degree_A(num_vertices(Ga));
-    boost::detail::compute_in_degree(Ga, &in_degree_A[0]);
+  std::vector<std::size_t> in_degree_B(num_vertices(Gb));
+  boost::detail::compute_in_degree(Gb, &in_degree_B[0]);

-    std::vector< std::size_t > in_degree_B(num_vertices(Gb));
-    boost::detail::compute_in_degree(Gb, &in_degree_B[0]);
+  degree_vertex_invariant<std::size_t*, GraphA> 
+    invariantA(&in_degree_A[0], Ga);
+  degree_vertex_invariant<std::size_t*, GraphB> 
+    invariantB(&in_degree_B[0], Gb);

-    degree_vertex_invariant< std::size_t*, GraphA > invariantA(
-        &in_degree_A[0], Ga);
-    degree_vertex_invariant< std::size_t*, GraphB > invariantB(
-        &in_degree_B[0], Gb);
+  std::vector<graph_traits<GraphB>::vertex_descriptor> f(num_vertices(Ga));

-    std::vector< graph_traits< GraphB >::vertex_descriptor > f(
-        num_vertices(Ga));
+  bool ret = isomorphism(Ga, Gb, &f[0], invariantA, invariantB, 
+                         (invariantB.max)(),
+                         get(vertex_index, Ga), get(vertex_index, Gb));
+  assert(ret == true);

-    bool ret = isomorphism(Ga, Gb, &f[0], invariantA, invariantB,
-        (invariantB.max)(), get(vertex_index, Ga), get(vertex_index, Gb));
-    assert(ret == true);
-
-    for (std::size_t i = 0; i < num_vertices(Ga); ++i)
-        std::cout << "f(" << a_names[i] << ")=" << b_names[f[i]] << std::endl;
-
-    BOOST_TEST(verify_isomorphism(Ga, Gb, &f[0]));
+  for (std::size_t i = 0; i < num_vertices(Ga); ++i)
+    std::cout << "f(" << a_names[i] << ")=" << b_names[f[i]] << std::endl;
+  
+  BOOST_TEST(verify_isomorphism(Ga, Gb, &f[0]));
 }

-int test_main(int, char*[])
+int test_main(int, char* [])
 {
-    test_isomorphism();
-    return boost::report_errors();
+  test_isomorphism();
+  return boost::report_errors();
 }
@@ -1,11 +1,11 @@
 <HTML>
 <!--
     Copyright (c) 2004, 2005 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
               Jeremiah Willcock
               Andrew Lumsdaine
@@ -24,10 +24,10 @@ function address(host, user) {
 </script>
 </head>

-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <tt>erdos_renyi_iterator</tt>

@@ -57,7 +57,7 @@ public:
  erdos_renyi_iterator operator++(int);
  bool operator==(const erdos_renyi_iterator&amp; other) const;
  bool operator!=(const erdos_renyi_iterator&amp; other) const;
-};
+}; 
 </PRE>

 <p> This class template implements a generator for Erd&ouml;s-Renyi
@@ -144,9 +144,9 @@ int main()
 <TR valign=top>
 <TD nowrap>Copyright &copy; 2005</TD><TD>
 <A HREF="http://www.boost.org/people/doug_gregor.html">Doug Gregor</A>, Indiana University (<script language="Javascript">address("cs.indiana.edu", "dgregor")</script>)<br>
-  <A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
+  <A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
 Indiana University (<script language="Javascript">address("osl.iu.edu", "lums")</script>)
 </TD></TR></TABLE>

 </BODY>
-</HTML>
+</HTML> 
@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek 2002
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: Exceptions</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -1,17 +1,17 @@
 <HTML>
 <!--
     Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-
+    
     Distributed under 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)
  -->
 <Head>
 <Title>Boost Graph Library: FAQ</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
-        ALINK="#ff0000">
-<IMG SRC="../../../boost.png"
-     ALT="C++ Boost" width="277" height="86">
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
+        ALINK="#ff0000"> 
+<IMG SRC="../../../boost.png" 
+     ALT="C++ Boost" width="277" height="86"> 

 <BR Clear>

@@ -76,8 +76,8 @@ convenient.  Granted, this is not a huge difference, but since there
 weren't other strong reasons, it was enough for us to choose free
 functions.
 </p>
-
-<p>
+ 
+<p> 
 Our religious reason for choosing free functions is to send the message
 that BGL is a generic library, and not a traditional object-oriented
 library. OO was hip in the 80s and 90s, but its time we moved beyond!
@@ -115,7 +115,7 @@ library. OO was hip in the 80s and 90s, but its time we moved beyond!
  // initialize the vertex_index property values
  graph_traits&lt;graph_t&gt;::vertex_iterator vi, vend;
  graph_traits&lt;graph_t&gt;::vertices_size_type cnt = 0;
-  for(boost::tie(vi,vend) = vertices(G); vi != vend; ++vi)
+  for(tie(vi,vend) = vertices(G); vi != vend; ++vi)
    put(index, *vi, cnt++);
 </pre>
 </li>
@@ -124,13 +124,13 @@ library. OO was hip in the 80s and 90s, but its time we moved beyond!
 not being found, such as:
 <pre>
 ../../../boost/concept_check.hpp:209: no match for
-`boost::detail::error_property_not_found &amp; ==
- boost::detail::error_property_not_found &amp;'
+`boost::detail::error_property_not_found & == 
+ boost::detail::error_property_not_found &'
 </pre>
 or a message such as:
 <pre>
 ../../..\boost/graph/depth_first_search.hpp(78) : error C2664: 'white'
-: cannot convert parameter 1 from
+: cannot convert parameter 1 from 
 'struct boost::detail::error_property_not_found'
 to 'enum boost::default_color_type'
 </pre>
@@ -2,7 +2,7 @@
 Landscape
 Center
 Inches
-Letter
+Letter  
 100.00
 Single
 -2
@@ -2,7 +2,7 @@
 Landscape
 Center
 Inches
-Letter
+Letter  
 100.00
 Single
 -2
@@ -2,7 +2,7 @@
 Landscape
 Center
 Inches
-Letter
+Letter  
 100.00
 Single
 -2
@@ -2,7 +2,7 @@
 Landscape
 Center
 Inches
-Letter
+Letter  
 100.00
 Single
 -2
@@ -2,7 +2,7 @@
 Portrait
 Center
 Inches
-Letter
+Letter  
 100.00
 Single
 -2
@@ -2,7 +2,7 @@
 Landscape
 Center
 Inches
-Letter
+Letter  
 100.00
 Single
 -2
--- a/Show More
+++ b/Show More