--- /dev/null
+ <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+ <html xmlns="http://www.w3.org/1999/xhtml">
+<!--
+This file was generated by Devel::NYTProf version 4.06
+-->
+<head>
+ <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
+ <meta http-equiv="Content-Language" content="en-us" />
+ <title>Profile of Graph.pm</title>
+<link rel="stylesheet" type="text/css" href="style.css" />
+ <script type="text/javascript" src="js/jquery-min.js"></script>
+
+ <script type="text/javascript" src="js/jquery-tablesorter-min.js"></script>
+ <link rel="stylesheet" type="text/css" href="js/style-tablesorter.css" />
+ <script type="text/javascript">
+ // when a column is first clicked on to sort it, use descending order
+ // XXX doesn't seem to work (and not just because the tablesorter formatSortingOrder() is broken)
+ $.tablesorter.defaults.sortInitialOrder = "desc";
+ // add parser through the tablesorter addParser method
+ $.tablesorter.addParser({
+ id: 'fmt_time', // name of this parser
+ is: function(s) {
+ return false; // return false so this parser is not auto detected
+ },
+ format: function(orig) { // format data for normalization
+ // console.log(orig);
+ val = orig.replace(/ns/,'');
+ if (val != orig) { return val / (1000*1000*1000); }
+ val = orig.replace(/µs/,''); /* XXX use µ ? */
+ if (val != orig) { return val / (1000*1000); }
+ var val = orig.replace(/ms/,'');
+ if (val != orig) { return val / (1000); }
+ var val = orig.replace(/s/,'');
+ if (val != orig) { return val; }
+ if (orig == '0') { return orig; }
+ console.log('no match for fmt_time of '.concat(orig));
+ return orig;
+ },
+ type: 'numeric' // set type, either numeric or text
+ });
+ </script>
+</head>
+
+<body >
+<div class="header" style="position: relative; overflow-x: hidden; overflow-y: hidden; z-index: 0; ">
+<div class="header_back">
+ <a href="index.html">← Index</a>
+ </div>
+<div class="headerForeground" style="float: left">
+ <span class="siteTitle">NYTProf Performance Profile</span>
+ <span class="siteSubtitle">  <span>« <span class="mode_btn mode_btn_selected">block view</span> • <span class="mode_btn"><a href="Graph-pm-695-line.html">line view</a></span> • <span class="mode_btn"><a href="Graph-pm-695-sub.html">sub view</a></span> »</span><br />
+ For script/nytprof.pl
+ </span>
+</div>
+<div class="headerForeground" style="float: right; text-align: right">
+ <span class="siteTitle"> </span>
+ <span class="siteSubtitle">Run on Thu May 31 16:29:39 2012<br />Reported on Thu May 31 16:36:13 2012</span>
+</div>
+<div style="position: absolute; left: 0px; top: 0%; width: 100%; height: 101%; z-index: -1; background-color: rgb(17, 136, 255); "></div>
+<div style="position: absolute; left: 0px; top: 2%; width: 100%; height: 99%; z-index: -1; background-color: rgb(16, 134, 253); "></div>
+<div style="position: absolute; left: 0px; top: 4%; width: 100%; height: 97%; z-index: -1; background-color: rgb(16, 133, 252); "></div>
+<div style="position: absolute; left: 0px; top: 6%; width: 100%; height: 95%; z-index: -1; background-color: rgb(15, 131, 250); "></div>
+<div style="position: absolute; left: 0px; top: 8%; width: 100%; height: 93%; z-index: -1; background-color: rgb(15, 130, 249); "></div>
+<div style="position: absolute; left: 0px; top: 10%; width: 100%; height: 91%; z-index: -1; background-color: rgb(15, 129, 248); "></div>
+<div style="position: absolute; left: 0px; top: 12%; width: 100%; height: 89%; z-index: -1; background-color: rgb(14, 127, 246); "></div>
+<div style="position: absolute; left: 0px; top: 14%; width: 100%; height: 87%; z-index: -1; background-color: rgb(14, 126, 245); "></div>
+<div style="position: absolute; left: 0px; top: 16%; width: 100%; height: 85%; z-index: -1; background-color: rgb(14, 125, 244); "></div>
+<div style="position: absolute; left: 0px; top: 18%; width: 100%; height: 83%; z-index: -1; background-color: rgb(13, 123, 242); "></div>
+<div style="position: absolute; left: 0px; top: 20%; width: 100%; height: 81%; z-index: -1; background-color: rgb(13, 122, 241); "></div>
+<div style="position: absolute; left: 0px; top: 22%; width: 100%; height: 79%; z-index: -1; background-color: rgb(13, 121, 240); "></div>
+<div style="position: absolute; left: 0px; top: 24%; width: 100%; height: 77%; z-index: -1; background-color: rgb(12, 119, 238); "></div>
+<div style="position: absolute; left: 0px; top: 26%; width: 100%; height: 75%; z-index: -1; background-color: rgb(12, 118, 237); "></div>
+<div style="position: absolute; left: 0px; top: 28%; width: 100%; height: 73%; z-index: -1; background-color: rgb(12, 116, 235); "></div>
+<div style="position: absolute; left: 0px; top: 30%; width: 100%; height: 71%; z-index: -1; background-color: rgb(11, 115, 234); "></div>
+<div style="position: absolute; left: 0px; top: 32%; width: 100%; height: 69%; z-index: -1; background-color: rgb(11, 114, 233); "></div>
+<div style="position: absolute; left: 0px; top: 34%; width: 100%; height: 67%; z-index: -1; background-color: rgb(11, 112, 231); "></div>
+<div style="position: absolute; left: 0px; top: 36%; width: 100%; height: 65%; z-index: -1; background-color: rgb(10, 111, 230); "></div>
+<div style="position: absolute; left: 0px; top: 38%; width: 100%; height: 63%; z-index: -1; background-color: rgb(10, 110, 229); "></div>
+<div style="position: absolute; left: 0px; top: 40%; width: 100%; height: 61%; z-index: -1; background-color: rgb(10, 108, 227); "></div>
+<div style="position: absolute; left: 0px; top: 42%; width: 100%; height: 59%; z-index: -1; background-color: rgb(9, 107, 226); "></div>
+<div style="position: absolute; left: 0px; top: 44%; width: 100%; height: 57%; z-index: -1; background-color: rgb(9, 106, 225); "></div>
+<div style="position: absolute; left: 0px; top: 46%; width: 100%; height: 55%; z-index: -1; background-color: rgb(9, 104, 223); "></div>
+<div style="position: absolute; left: 0px; top: 48%; width: 100%; height: 53%; z-index: -1; background-color: rgb(8, 103, 222); "></div>
+<div style="position: absolute; left: 0px; top: 50%; width: 100%; height: 51%; z-index: -1; background-color: rgb(8, 102, 221); "></div>
+<div style="position: absolute; left: 0px; top: 52%; width: 100%; height: 49%; z-index: -1; background-color: rgb(8, 100, 219); "></div>
+<div style="position: absolute; left: 0px; top: 54%; width: 100%; height: 47%; z-index: -1; background-color: rgb(7, 99, 218); "></div>
+<div style="position: absolute; left: 0px; top: 56%; width: 100%; height: 45%; z-index: -1; background-color: rgb(7, 97, 216); "></div>
+<div style="position: absolute; left: 0px; top: 58%; width: 100%; height: 43%; z-index: -1; background-color: rgb(7, 96, 215); "></div>
+<div style="position: absolute; left: 0px; top: 60%; width: 100%; height: 41%; z-index: -1; background-color: rgb(6, 95, 214); "></div>
+<div style="position: absolute; left: 0px; top: 62%; width: 100%; height: 39%; z-index: -1; background-color: rgb(6, 93, 212); "></div>
+<div style="position: absolute; left: 0px; top: 64%; width: 100%; height: 37%; z-index: -1; background-color: rgb(6, 92, 211); "></div>
+<div style="position: absolute; left: 0px; top: 66%; width: 100%; height: 35%; z-index: -1; background-color: rgb(5, 91, 210); "></div>
+<div style="position: absolute; left: 0px; top: 68%; width: 100%; height: 33%; z-index: -1; background-color: rgb(5, 89, 208); "></div>
+<div style="position: absolute; left: 0px; top: 70%; width: 100%; height: 31%; z-index: -1; background-color: rgb(5, 88, 207); "></div>
+<div style="position: absolute; left: 0px; top: 72%; width: 100%; height: 29%; z-index: -1; background-color: rgb(4, 87, 206); "></div>
+<div style="position: absolute; left: 0px; top: 74%; width: 100%; height: 27%; z-index: -1; background-color: rgb(4, 85, 204); "></div>
+<div style="position: absolute; left: 0px; top: 76%; width: 100%; height: 25%; z-index: -1; background-color: rgb(4, 84, 203); "></div>
+<div style="position: absolute; left: 0px; top: 78%; width: 100%; height: 23%; z-index: -1; background-color: rgb(3, 82, 201); "></div>
+<div style="position: absolute; left: 0px; top: 80%; width: 100%; height: 21%; z-index: -1; background-color: rgb(3, 81, 200); "></div>
+<div style="position: absolute; left: 0px; top: 82%; width: 100%; height: 19%; z-index: -1; background-color: rgb(3, 80, 199); "></div>
+<div style="position: absolute; left: 0px; top: 84%; width: 100%; height: 17%; z-index: -1; background-color: rgb(2, 78, 197); "></div>
+<div style="position: absolute; left: 0px; top: 86%; width: 100%; height: 15%; z-index: -1; background-color: rgb(2, 77, 196); "></div>
+<div style="position: absolute; left: 0px; top: 88%; width: 100%; height: 13%; z-index: -1; background-color: rgb(2, 76, 195); "></div>
+<div style="position: absolute; left: 0px; top: 90%; width: 100%; height: 11%; z-index: -1; background-color: rgb(1, 74, 193); "></div>
+<div style="position: absolute; left: 0px; top: 92%; width: 100%; height: 9%; z-index: -1; background-color: rgb(1, 73, 192); "></div>
+<div style="position: absolute; left: 0px; top: 94%; width: 100%; height: 7%; z-index: -1; background-color: rgb(1, 72, 191); "></div>
+<div style="position: absolute; left: 0px; top: 96%; width: 100%; height: 5%; z-index: -1; background-color: rgb(0, 70, 189); "></div>
+<div style="position: absolute; left: 0px; top: 98%; width: 100%; height: 3%; z-index: -1; background-color: rgb(0, 69, 188); "></div>
+<div style="position: absolute; left: 0px; top: 100%; width: 100%; height: 1%; z-index: -1; background-color: rgb(0, 68, 187); "></div>
+</div>
+
+<div class="body_content"><br />
+<table class="file_summary"><tr><td class="h">Filename</td><td align="left"><a href="file:///Users/edenc/perl5/lib/perl5/Graph.pm">/Users/edenc/perl5/lib/perl5/Graph.pm</a></td></tr>
+<tr><td class="h">Statements</td><td align="left">Executed 6603265 statements in 7.73s</td></tr></table>
+
+ <table id="subs_table" border="1" cellpadding="0" class="tablesorter">
+ <caption>Subroutines</caption>
+ <thead>
+ <tr>
+ <th>Calls</th>
+ <th><span title="Number of Places sub is called from">P</span></th>
+ <th><span title="Number of Files sub is called from">F</span></th>
+ <th>Exclusive<br />Time</th>
+ <th>Inclusive<br />Time</th>
+ <th>Subroutine</th>
+ </tr>
+ </thead>
+ <tbody>
+<tr><td class="c1">107</td><td class="c1">2</td><td class="c3">1</td><td class="c0"><span title="2.2%">1.14s</span></td><td class="c0"><span title="3.4%">1.81s</span></td><td class="sub_name"><span style="display: none;">Graph::::edges05</span>Graph::<a href="Graph-pm-695-block.html#554">edges05</a></span></td></tr>
+<tr><td class="c0">110001</td><td class="c0">8</td><td class="c0">4</td><td class="c0"><span title="1.8%">932ms</span></td><td class="c0"><span title="1.8%">933ms</span></td><td class="sub_name"><span style="display: none;">Graph::::has_edge</span>Graph::<a href="Graph-pm-695-block.html#530">has_edge</a></span></td></tr>
+<tr><td class="c0">55803</td><td class="c0">11</td><td class="c0">4</td><td class="c0"><span title="1.2%">630ms</span></td><td class="c0"><span title="5.8%">3.07s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_edge</span>Graph::<a href="Graph-pm-695-block.html#488">add_edge</a></span></td></tr>
+<tr><td class="c0">56826</td><td class="c0">5</td><td class="c0">4</td><td class="c0"><span title="1.1%">592ms</span></td><td class="c0"><span title="2.3%">1.21s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_vertex</span>Graph::<a href="Graph-pm-695-block.html#370">add_vertex</a></span></td></tr>
+<tr><td class="c2">102</td><td class="c1">2</td><td class="c1">2</td><td class="c0"><span title="1.0%">537ms</span></td><td class="c0"><span title="9.0%">4.72s</span></td><td class="sub_name"><span style="display: none;">Graph::::stringify</span>Graph::<a href="Graph-pm-695-block.html#90">stringify</a></span></td></tr>
+<tr><td class="c0">55803</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="1.0%">535ms</span></td><td class="c0"><span title="3.2%">1.67s</span></td><td class="sub_name"><span style="display: none;">Graph::::_add_edge</span>Graph::<a href="Graph-pm-695-block.html#463">_add_edge</a></span></td></tr>
+<tr><td class="c0">106675</td><td class="c0">5</td><td class="c0">4</td><td class="c0"><span title="0.8%">401ms</span></td><td class="c0"><span title="3.0%">1.59s</span></td><td class="sub_name"><span style="display: none;">Graph::::successors</span>Graph::<a href="Graph-pm-695-block.html#860">successors</a></span></td></tr>
+<tr><td class="c0">108940</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.7%">388ms</span></td><td class="c0"><span title="3.4%">1.78s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_isolated_vertex</span>Graph::<a href="Graph-pm-695-block.html#1124">is_isolated_vertex</a></span></td></tr>
+<tr><td class="c0">110096</td><td class="c0">4</td><td class="c0">3</td><td class="c0"><span title="0.7%">373ms</span></td><td class="c0"><span title="2.7%">1.41s</span></td><td class="sub_name"><span style="display: none;">Graph::::predecessors</span>Graph::<a href="Graph-pm-695-block.html#868">predecessors</a></span></td></tr>
+<tr><td class="c1">107</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.6%">325ms</span></td><td class="c0"><span title="0.6%">326ms</span></td><td class="sub_name"><span style="display: none;">Graph::::_edges_at</span>Graph::<a href="Graph-pm-695-block.html#754">_edges_at</a></span></td></tr>
+<tr><td class="c0">97458</td><td class="c0">4</td><td class="c1">2</td><td class="c0"><span title="0.6%">304ms</span></td><td class="c0"><span title="0.7%">382ms</span></td><td class="sub_name"><span style="display: none;">Graph::::multiedged</span>Graph::<a href="Graph-pm-695-block.html#338">multiedged</a></span></td></tr>
+<tr><td class="c0">41450</td><td class="c0">5</td><td class="c3">1</td><td class="c0"><span title="0.6%">301ms</span></td><td class="c0"><span title="0.6%">301ms</span></td><td class="sub_name"><span style="display: none;">Graph::::_vertex_ids</span>Graph::<a href="Graph-pm-695-block.html#510">_vertex_ids</a></span></td></tr>
+<tr><td class="c2">102</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.5%">271ms</span></td><td class="c0"><span title="4.2%">2.23s</span></td><td class="sub_name"><span style="display: none;">Graph::::isolated_vertices</span>Graph::<a href="Graph-pm-695-block.html#1187">isolated_vertices</a></span></td></tr>
+<tr><td class="c0">12613</td><td class="c1">2</td><td class="c3">1</td><td class="c0"><span title="0.5%">264ms</span></td><td class="c0"><span title="1.0%">541ms</span></td><td class="sub_name"><span style="display: none;">Graph::::_edges</span>Graph::<a href="Graph-pm-695-block.html#782">_edges</a></span></td></tr>
+<tr><td class="c0">15571</td><td class="c1">2</td><td class="c3">1</td><td class="c0"><span title="0.4%">214ms</span></td><td class="c0"><span title="1.7%">916ms</span></td><td class="sub_name"><span style="display: none;">Graph::::get_edge_attributes</span>Graph::<a href="Graph-pm-695-block.html#1531">get_edge_attributes</a></span></td></tr>
+<tr><td class="c0">112746</td><td class="c0">3</td><td class="c3">1</td><td class="c0"><span title="0.4%">187ms</span></td><td class="c0"><span title="0.4%">187ms</span></td><td class="sub_name"><span style="display: none;">Graph::::has_union_find</span>Graph::<a href="Graph-pm-695-block.html#141">has_union_find</a></span></td></tr>
+<tr><td class="c0">440</td><td class="c0">3</td><td class="c3">1</td><td class="c0"><span title="0.3%">168ms</span></td><td class="c0"><span title="0.3%">168ms</span></td><td class="sub_name"><span style="display: none;">Graph::::CORE:sort</span>Graph::<a href="Graph-pm-695-block.html#Graph__CORE_sort">CORE:sort</a> (opcode)</span></td></tr>
+<tr><td class="c0">56877</td><td class="c1">2</td><td class="c3">1</td><td class="c0"><span title="0.3%">163ms</span></td><td class="c0"><span title="0.4%">192ms</span></td><td class="sub_name"><span style="display: none;">Graph::::multivertexed</span>Graph::<a href="Graph-pm-695-block.html#329">multivertexed</a></span></td></tr>
+<tr><td class="c0">13804</td><td class="c1">2</td><td class="c3">1</td><td class="c0"><span title="0.3%">161ms</span></td><td class="c0"><span title="0.5%">245ms</span></td><td class="sub_name"><span style="display: none;">Graph::::_edges_id_path</span>Graph::<a href="Graph-pm-695-block.html#837">_edges_id_path</a></span></td></tr>
+<tr><td class="c0">13355</td><td class="c1">2</td><td class="c1">2</td><td class="c0"><span title="0.3%">161ms</span></td><td class="c0"><span title="1.5%">790ms</span></td><td class="sub_name"><span style="display: none;">Graph::::has_edge_attribute</span>Graph::<a href="Graph-pm-695-block.html#1514">has_edge_attribute</a></span></td></tr>
+<tr><td class="c3">51</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.3%">159ms</span></td><td class="c0"><span title="20.2%">10.7s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_a_cycle</span>Graph::<a href="Graph-pm-695-block.html#1261">has_a_cycle</a></span></td></tr>
+<tr><td class="c0">53593</td><td class="c0">3</td><td class="c3">1</td><td class="c0"><span title="0.3%">141ms</span></td><td class="c0"><span title="0.3%">141ms</span></td><td class="sub_name"><span style="display: none;">Graph::::_next_random</span>Graph::<a href="Graph-pm-695-block.html#2323">_next_random</a></span></td></tr>
+<tr><td class="c0">12664</td><td class="c1">2</td><td class="c1">2</td><td class="c0"><span title="0.3%">140ms</span></td><td class="c0"><span title="1.2%">626ms</span></td><td class="sub_name"><span style="display: none;">Graph::::set_edge_attribute</span>Graph::<a href="Graph-pm-695-block.html#1462">set_edge_attribute</a></span></td></tr>
+<tr><td class="c1">153</td><td class="c1">2</td><td class="c3">1</td><td class="c0"><span title="0.3%">139ms</span></td><td class="c0"><span title="0.5%">271ms</span></td><td class="sub_name"><span style="display: none;">Graph::::vertices05</span>Graph::<a href="Graph-pm-695-block.html#409">vertices05</a></span></td></tr>
+<tr><td class="c0">12605</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.2%">116ms</span></td><td class="c0"><span title="1.8%">927ms</span></td><td class="sub_name"><span style="display: none;">Graph::::edges_from</span>Graph::<a href="Graph-pm-695-block.html#850">edges_from</a></span></td></tr>
+<tr><td class="c0">41599</td><td class="c0">4</td><td class="c3">1</td><td class="c0"><span title="0.2%">115ms</span></td><td class="c0"><span title="0.6%">294ms</span></td><td class="sub_name"><span style="display: none;">Graph::::expect_non_multiedged</span>Graph::<a href="Graph-pm-695-block.html#2113">expect_non_multiedged</a></span></td></tr>
+<tr><td class="c0">12766</td><td class="c0">3</td><td class="c3">1</td><td class="c0"><span title="0.1%">53.4ms</span></td><td class="c0"><span title="0.1%">69.8ms</span></td><td class="sub_name"><span style="display: none;">Graph::::omniedged</span>Graph::<a href="Graph-pm-695-block.html#340">omniedged</a></span></td></tr>
+<tr><td class="c0">12607</td><td class="c1">2</td><td class="c3">1</td><td class="c0"><span title="0.1%">30.7ms</span></td><td class="c0"><span title="0.1%">30.7ms</span></td><td class="sub_name"><span style="display: none;">Graph::::_edges_from</span>Graph::<a href="Graph-pm-695-block.html#827">_edges_from</a></span></td></tr>
+<tr><td class="c0">15627</td><td class="c0">3</td><td class="c3">1</td><td class="c0"><span title="0.1%">30.3ms</span></td><td class="c0"><span title="0.1%">30.3ms</span></td><td class="sub_name"><span style="display: none;">Graph::::is_compat02</span>Graph::<a href="Graph-pm-695-block.html#134">is_compat02</a></span></td></tr>
+<tr><td class="c3">51</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.0%">24.3ms</span></td><td class="c0"><span title="0.2%">119ms</span></td><td class="sub_name"><span style="display: none;">Graph::::vertices</span>Graph::<a href="Graph-pm-695-block.html#420">vertices</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c1"><span title="0.0%">7.70ms</span></td><td class="c3"><span title="0.0%">8.56ms</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@28</span>Graph::<a href="Graph-pm-695-block.html#28">BEGIN@28</a></span></td></tr>
+<tr><td class="c1">107</td><td class="c1">2</td><td class="c3">1</td><td class="c3"><span title="0.0%">3.57ms</span></td><td class="c0"><span title="0.6%">337ms</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_vertex</span>Graph::<a href="Graph-pm-695-block.html#989">delete_vertex</a></span></td></tr>
+<tr><td class="c3">54</td><td class="c0">4</td><td class="c0">3</td><td class="c3"><span title="0.0%">3.33ms</span></td><td class="c3"><span title="0.0%">8.90ms</span></td><td class="sub_name"><span style="display: none;">Graph::::new</span>Graph::<a href="Graph-pm-695-block.html#170">new</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">2.88ms</span></td><td class="c0"><span title="0.1%">42.9ms</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@42</span>Graph::<a href="Graph-pm-695-block.html#42">BEGIN@42</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">2.77ms</span></td><td class="c3"><span title="0.0%">3.15ms</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@13</span>Graph::<a href="Graph-pm-695-block.html#13">BEGIN@13</a></span></td></tr>
+<tr><td class="c0">162</td><td class="c0">3</td><td class="c3">1</td><td class="c3"><span title="0.0%">2.77ms</span></td><td class="c3"><span title="0.0%">2.77ms</span></td><td class="sub_name"><span style="display: none;">Graph::::_opt</span>Graph::<a href="Graph-pm-695-block.html#120">_opt</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">1.80ms</span></td><td class="c3"><span title="0.0%">1.99ms</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@38</span>Graph::<a href="Graph-pm-695-block.html#38">BEGIN@38</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">1.63ms</span></td><td class="c3"><span title="0.0%">3.57ms</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@29</span>Graph::<a href="Graph-pm-695-block.html#29">BEGIN@29</a></span></td></tr>
+<tr><td class="c3">51</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">950µs</span></td><td class="c0"><span title="4.6%">2.40s</span></td><td class="sub_name"><span style="display: none;">Graph::::eq</span>Graph::<a href="Graph-pm-695-block.html#107">eq</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">897µs</span></td><td class="c3"><span title="0.0%">1.10ms</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@86</span>Graph::<a href="Graph-pm-695-block.html#86">BEGIN@86</a></span></td></tr>
+<tr><td class="c3">54</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">766µs</span></td><td class="c3"><span title="0.0%">766µs</span></td><td class="sub_name"><span style="display: none;">Graph::::_get_options</span>Graph::<a href="Graph-pm-695-block.html#2128">_get_options</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">595µs</span></td><td class="c3"><span title="0.0%">613µs</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@31</span>Graph::<a href="Graph-pm-695-block.html#31">BEGIN@31</a></span></td></tr>
+<tr><td class="c1">117</td><td class="c1">2</td><td class="c3">1</td><td class="c3"><span title="0.0%">562µs</span></td><td class="c3"><span title="0.0%">797µs</span></td><td class="sub_name"><span style="display: none;">Graph::::expect_non_unionfind</span>Graph::<a href="Graph-pm-695-block.html#2123">expect_non_unionfind</a></span></td></tr>
+<tr><td class="c3">51</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">541µs</span></td><td class="c3"><span title="0.0%">678µs</span></td><td class="sub_name"><span style="display: none;">Graph::::directed</span>Graph::<a href="Graph-pm-695-block.html#345">directed</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">514µs</span></td><td class="c3"><span title="0.0%">910µs</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@35</span>Graph::<a href="Graph-pm-695-block.html#35">BEGIN@35</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">419µs</span></td><td class="c3"><span title="0.0%">3.86ms</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@32</span>Graph::<a href="Graph-pm-695-block.html#32">BEGIN@32</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">409µs</span></td><td class="c3"><span title="0.0%">3.17ms</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@34</span>Graph::<a href="Graph-pm-695-block.html#34">BEGIN@34</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">358µs</span></td><td class="c3"><span title="0.0%">516µs</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@36</span>Graph::<a href="Graph-pm-695-block.html#36">BEGIN@36</a></span></td></tr>
+<tr><td class="c1">108</td><td class="c1">2</td><td class="c3">1</td><td class="c3"><span title="0.0%">302µs</span></td><td class="c3"><span title="0.0%">302µs</span></td><td class="sub_name"><span style="display: none;">Graph::::_opt_get</span>Graph::<a href="Graph-pm-695-block.html#151">_opt_get</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">294µs</span></td><td class="c3"><span title="0.0%">4.39ms</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@33</span>Graph::<a href="Graph-pm-695-block.html#33">BEGIN@33</a></span></td></tr>
+<tr><td class="c3">51</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">284µs</span></td><td class="c3"><span title="0.0%">312µs</span></td><td class="sub_name"><span style="display: none;">Graph::::countvertexed</span>Graph::<a href="Graph-pm-695-block.html#328">countvertexed</a></span></td></tr>
+<tr><td class="c3">56</td><td class="c1">2</td><td class="c1">2</td><td class="c3"><span title="0.0%">265µs</span></td><td class="c3"><span title="0.0%">296µs</span></td><td class="sub_name"><span style="display: none;">Graph::::countedged</span>Graph::<a href="Graph-pm-695-block.html#337">countedged</a></span></td></tr>
+<tr><td class="c3">54</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">213µs</span></td><td class="c3"><span title="0.0%">213µs</span></td><td class="sub_name"><span style="display: none;">Graph::::_opt_unknown</span>Graph::<a href="Graph-pm-695-block.html#159">_opt_unknown</a></span></td></tr>
+<tr><td class="c3">10</td><td class="c1">2</td><td class="c3">1</td><td class="c3"><span title="0.0%">185µs</span></td><td class="c3"><span title="0.0%">676µs</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_edge</span>Graph::<a href="Graph-pm-695-block.html#977">delete_edge</a></span></td></tr>
+<tr><td class="c3">9</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">153µs</span></td><td class="c3"><span title="0.0%">672µs</span></td><td class="sub_name"><span style="display: none;">Graph::::get_edge_attribute</span>Graph::<a href="Graph-pm-695-block.html#1563">get_edge_attribute</a></span></td></tr>
+<tr><td class="c3">5</td><td class="c0">3</td><td class="c1">2</td><td class="c3"><span title="0.0%">78µs</span></td><td class="c1"><span title="0.0%">21.4ms</span></td><td class="sub_name"><span style="display: none;">Graph::::edges</span>Graph::<a href="Graph-pm-695-block.html#591">edges</a></span></td></tr>
+<tr><td class="c3">2</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">62µs</span></td><td class="c3"><span title="0.0%">681µs</span></td><td class="sub_name"><span style="display: none;">Graph::::neighbours</span>Graph::<a href="Graph-pm-695-block.html#936">neighbours</a></span></td></tr>
+<tr><td class="c3">4</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">49µs</span></td><td class="c3"><span title="0.0%">5.41ms</span></td><td class="sub_name"><span style="display: none;">Graph::::edges_to</span>Graph::<a href="Graph-pm-695-block.html#855">edges_to</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">32µs</span></td><td class="c3"><span title="0.0%">32µs</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@2155</span>Graph::<a href="Graph-pm-695-block.html#2155">BEGIN@2155</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">25µs</span></td><td class="c3"><span title="0.0%">25µs</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@55</span>Graph::<a href="Graph-pm-695-block.html#55">BEGIN@55</a></span></td></tr>
+<tr><td class="c3">6</td><td class="c1">2</td><td class="c3">1</td><td class="c3"><span title="0.0%">24µs</span></td><td class="c3"><span title="0.0%">24µs</span></td><td class="sub_name"><span style="display: none;">Graph::::_edges_to</span>Graph::<a href="Graph-pm-695-block.html#832">_edges_to</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">17µs</span></td><td class="c3"><span title="0.0%">59µs</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@1733</span>Graph::<a href="Graph-pm-695-block.html#1733">BEGIN@1733</a></span></td></tr>
+<tr><td class="c3">2</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">16µs</span></td><td class="c3"><span title="0.0%">171µs</span></td><td class="sub_name"><span style="display: none;">Graph::::add_edges</span>Graph::<a href="Graph-pm-695-block.html#1674">add_edges</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">15µs</span></td><td class="c3"><span title="0.0%">59µs</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@39</span>Graph::<a href="Graph-pm-695-block.html#39">BEGIN@39</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">13µs</span></td><td class="c3"><span title="0.0%">15µs</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@3</span>Graph::<a href="Graph-pm-695-block.html#3">BEGIN@3</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">12µs</span></td><td class="c3"><span title="0.0%">53µs</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@116</span>Graph::<a href="Graph-pm-695-block.html#116">BEGIN@116</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">12µs</span></td><td class="c3"><span title="0.0%">45µs</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@40</span>Graph::<a href="Graph-pm-695-block.html#40">BEGIN@40</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">9µs</span></td><td class="c3"><span title="0.0%">22µs</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@178</span>Graph::<a href="Graph-pm-695-block.html#178">BEGIN@178</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">9µs</span></td><td class="c3"><span title="0.0%">22µs</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@30</span>Graph::<a href="Graph-pm-695-block.html#30">BEGIN@30</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">9µs</span></td><td class="c3"><span title="0.0%">28µs</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@15</span>Graph::<a href="Graph-pm-695-block.html#15">BEGIN@15</a></span></td></tr>
+<tr><td class="c3">1</td><td class="c3">1</td><td class="c3">1</td><td class="c3"><span title="0.0%">3µs</span></td><td class="c3"><span title="0.0%">3µs</span></td><td class="sub_name"><span style="display: none;">Graph::::BEGIN@5</span>Graph::<a href="Graph-pm-695-block.html#5">BEGIN@5</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::APSP_Floyd_Warshall</span>Graph::<a href="Graph-pm-695-block.html#3576">APSP_Floyd_Warshall</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::Infinity</span>Graph::<a href="Graph-pm-695-block.html#63">Infinity</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::MST_Kruskal</span>Graph::<a href="Graph-pm-695-block.html#2291">MST_Kruskal</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::MST_Prim</span>Graph::<a href="Graph-pm-695-block.html#2391">MST_Prim</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::SPT_Bellman_Ford</span>Graph::<a href="Graph-pm-695-block.html#3507">SPT_Bellman_Ford</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::SPT_Bellman_Ford_clear_cache</span>Graph::<a href="Graph-pm-695-block.html#2692">SPT_Bellman_Ford_clear_cache</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::SPT_Dijkstra</span>Graph::<a href="Graph-pm-695-block.html#3402">SPT_Dijkstra</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::SPT_Dijkstra_clear_cache</span>Graph::<a href="Graph-pm-695-block.html#2686">SPT_Dijkstra_clear_cache</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::SP_Bellman_Ford</span>Graph::<a href="Graph-pm-695-block.html#3545">SP_Bellman_Ford</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::SP_Dijkstra</span>Graph::<a href="Graph-pm-695-block.html#3428">SP_Dijkstra</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::TransitiveClosure_Floyd_Warshall</span>Graph::<a href="Graph-pm-695-block.html#3567">TransitiveClosure_Floyd_Warshall</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_MST_add</span>Graph::<a href="Graph-pm-695-block.html#2314">_MST_add</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_MST_attr</span>Graph::<a href="Graph-pm-695-block.html#2271">_MST_attr</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_MST_edges</span>Graph::<a href="Graph-pm-695-block.html#2282">_MST_edges</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_SPT_Bellman_Ford</span>Graph::<a href="Graph-pm-695-block.html#3469">_SPT_Bellman_Ford</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_SPT_Bellman_Ford_compute</span>Graph::<a href="Graph-pm-695-block.html#3504">_SPT_Bellman_Ford_compute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_SPT_Dijkstra_compute</span>Graph::<a href="Graph-pm-695-block.html#3399">_SPT_Dijkstra_compute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_SPT_add</span>Graph::<a href="Graph-pm-695-block.html#3378">_SPT_add</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:1726]</span>Graph::<a href="Graph-pm-695-block.html#1726">__ANON__[:1726]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:2211]</span>Graph::<a href="Graph-pm-695-block.html#2211">__ANON__[:2211]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:2269]</span>Graph::<a href="Graph-pm-695-block.html#2269">__ANON__[:2269]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:2732]</span>Graph::<a href="Graph-pm-695-block.html#2730">__ANON__[:2732]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:2736]</span>Graph::<a href="Graph-pm-695-block.html#2733">__ANON__[:2736]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:2745]</span>Graph::<a href="Graph-pm-695-block.html#2740">__ANON__[:2745]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:2808]</span>Graph::<a href="Graph-pm-695-block.html#2808">__ANON__[:2808]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:2895]</span>Graph::<a href="Graph-pm-695-block.html#2883">__ANON__[:2895]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:2899]</span>Graph::<a href="Graph-pm-695-block.html#2896">__ANON__[:2899]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:2985]</span>Graph::<a href="Graph-pm-695-block.html#2968">__ANON__[:2985]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:2989]</span>Graph::<a href="Graph-pm-695-block.html#2986">__ANON__[:2989]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:3021]</span>Graph::<a href="Graph-pm-695-block.html#3009">__ANON__[:3021]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:3025]</span>Graph::<a href="Graph-pm-695-block.html#3022">__ANON__[:3025]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:3038]</span>Graph::<a href="Graph-pm-695-block.html#3038">__ANON__[:3038]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:3166]</span>Graph::<a href="Graph-pm-695-block.html#3166">__ANON__[:3166]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:3668]</span>Graph::<a href="Graph-pm-695-block.html#3655">__ANON__[:3668]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__ANON__[:3830]</span>Graph::<a href="Graph-pm-695-block.html#3814">__ANON__[:3830]</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__SPT_Bellman_Ford</span>Graph::<a href="Graph-pm-695-block.html#3446">__SPT_Bellman_Ford</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__carp_confess</span>Graph::<a href="Graph-pm-695-block.html#10">__carp_confess</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__factorial</span>Graph::<a href="Graph-pm-695-block.html#3880">__factorial</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__fisher_yates_shuffle</span>Graph::<a href="Graph-pm-695-block.html#2144">__fisher_yates_shuffle</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::__stringified</span>Graph::<a href="Graph-pm-695-block.html#335">__stringified</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_all_predecessors</span>Graph::<a href="Graph-pm-695-block.html#906">_all_predecessors</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_all_successors</span>Graph::<a href="Graph-pm-695-block.html#876">_all_successors</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_attr02_012</span>Graph::<a href="Graph-pm-695-block.html#2452">_attr02_012</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_attr02_123</span>Graph::<a href="Graph-pm-695-block.html#2466">_attr02_123</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_attr02_234</span>Graph::<a href="Graph-pm-695-block.html#2480">_attr02_234</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_biconnectivity_compute</span>Graph::<a href="Graph-pm-695-block.html#3096">_biconnectivity_compute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_can_deep_copy_Storable</span>Graph::<a href="Graph-pm-695-block.html#24">_can_deep_copy_Storable</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_check_cache</span>Graph::<a href="Graph-pm-695-block.html#2645">_check_cache</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_clear_cache</span>Graph::<a href="Graph-pm-695-block.html#2661">_clear_cache</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_connected_components</span>Graph::<a href="Graph-pm-695-block.html#2752">_connected_components</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_connected_components_compute</span>Graph::<a href="Graph-pm-695-block.html#2701">_connected_components_compute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_deep_copy_DataDumper</span>Graph::<a href="Graph-pm-695-block.html#1730">_deep_copy_DataDumper</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_deep_copy_Storable</span>Graph::<a href="Graph-pm-695-block.html#1722">_deep_copy_Storable</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_defattr</span>Graph::<a href="Graph-pm-695-block.html#1834">_defattr</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_dump</span>Graph::<a href="Graph-pm-695-block.html#4065">_dump</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_expected</span>Graph::<a href="Graph-pm-695-block.html#2068">_expected</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_factorial</span>Graph::<a href="Graph-pm-695-block.html#3889">_factorial</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_get_edge_attribute</span>Graph::<a href="Graph-pm-695-block.html#1547">_get_edge_attribute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_get_union_find</span>Graph::<a href="Graph-pm-695-block.html#146">_get_union_find</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_heap_walk</span>Graph::<a href="Graph-pm-695-block.html#2361">_heap_walk</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_in_degree</span>Graph::<a href="Graph-pm-695-block.html#1039">_in_degree</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_make_bcc</span>Graph::<a href="Graph-pm-695-block.html#3085">_make_bcc</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_minmax_path</span>Graph::<a href="Graph-pm-695-block.html#3649">_minmax_path</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_next_alphabetic</span>Graph::<a href="Graph-pm-695-block.html#2321">_next_alphabetic</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_next_numeric</span>Graph::<a href="Graph-pm-695-block.html#2322">_next_numeric</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_out_degree</span>Graph::<a href="Graph-pm-695-block.html#1052">_out_degree</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_root_opt</span>Graph::<a href="Graph-pm-695-block.html#2325">_root_opt</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_set_edge_attribute</span>Graph::<a href="Graph-pm-695-block.html#1443">_set_edge_attribute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_strongly_connected_components</span>Graph::<a href="Graph-pm-695-block.html#2905">_strongly_connected_components</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_strongly_connected_components_compute</span>Graph::<a href="Graph-pm-695-block.html#2875">_strongly_connected_components_compute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_total_degree</span>Graph::<a href="Graph-pm-695-block.html#1065">_total_degree</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_transitive_closure_matrix_compute</span>Graph::<a href="Graph-pm-695-block.html#3585">_transitive_closure_matrix_compute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_union_find_add_edge</span>Graph::<a href="Graph-pm-695-block.html#483">_union_find_add_edge</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::_union_find_add_vertex</span>Graph::<a href="Graph-pm-695-block.html#364">_union_find_add_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_cycle</span>Graph::<a href="Graph-pm-695-block.html#1245">add_cycle</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_edge_by_id</span>Graph::<a href="Graph-pm-695-block.html#668">add_edge_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_edge_get_id</span>Graph::<a href="Graph-pm-695-block.html#679">add_edge_get_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_path</span>Graph::<a href="Graph-pm-695-block.html#1211">add_path</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_vertex_by_id</span>Graph::<a href="Graph-pm-695-block.html#625">add_vertex_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_vertex_get_id</span>Graph::<a href="Graph-pm-695-block.html#634">add_vertex_get_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_vertices</span>Graph::<a href="Graph-pm-695-block.html#1668">add_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_weighted_edge</span>Graph::<a href="Graph-pm-695-block.html#1929">add_weighted_edge</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_weighted_edge_by_id</span>Graph::<a href="Graph-pm-695-block.html#2009">add_weighted_edge_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_weighted_edges</span>Graph::<a href="Graph-pm-695-block.html#1943">add_weighted_edges</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_weighted_edges_by_id</span>Graph::<a href="Graph-pm-695-block.html#1961">add_weighted_edges_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_weighted_path</span>Graph::<a href="Graph-pm-695-block.html#1972">add_weighted_path</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_weighted_path_by_id</span>Graph::<a href="Graph-pm-695-block.html#2023">add_weighted_path_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_weighted_vertex</span>Graph::<a href="Graph-pm-695-block.html#1838">add_weighted_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_weighted_vertex_by_id</span>Graph::<a href="Graph-pm-695-block.html#1881">add_weighted_vertex_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_weighted_vertices</span>Graph::<a href="Graph-pm-695-block.html#1846">add_weighted_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::add_weighted_vertices_by_id</span>Graph::<a href="Graph-pm-695-block.html#1889">add_weighted_vertices_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::all_neighbours</span>Graph::<a href="Graph-pm-695-block.html#949">all_neighbours</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::all_predecessors</span>Graph::<a href="Graph-pm-695-block.html#930">all_predecessors</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::all_reachable</span>Graph::<a href="Graph-pm-695-block.html#972">all_reachable</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::all_successors</span>Graph::<a href="Graph-pm-695-block.html#900">all_successors</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::articulation_points</span>Graph::<a href="Graph-pm-695-block.html#3282">articulation_points</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::average_degree</span>Graph::<a href="Graph-pm-695-block.html#2423">average_degree</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::average_path_length</span>Graph::<a href="Graph-pm-695-block.html#3809">average_path_length</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::betweenness</span>Graph::<a href="Graph-pm-695-block.html#4001">betweenness</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::biconnected_component_by_index</span>Graph::<a href="Graph-pm-695-block.html#3296">biconnected_component_by_index</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::biconnected_component_by_vertex</span>Graph::<a href="Graph-pm-695-block.html#3303">biconnected_component_by_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::biconnected_components</span>Graph::<a href="Graph-pm-695-block.html#3290">biconnected_components</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::biconnected_graph</span>Graph::<a href="Graph-pm-695-block.html#3334">biconnected_graph</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::biconnectivity</span>Graph::<a href="Graph-pm-695-block.html#3256">biconnectivity</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::biconnectivity_clear_cache</span>Graph::<a href="Graph-pm-695-block.html#2681">biconnectivity_clear_cache</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::bridges</span>Graph::<a href="Graph-pm-695-block.html#3368">bridges</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::center_vertices</span>Graph::<a href="Graph-pm-695-block.html#3790">center_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::clustering_coefficient</span>Graph::<a href="Graph-pm-695-block.html#3969">clustering_coefficient</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::complement_graph</span>Graph::<a href="Graph-pm-695-block.html#1796">complement_graph</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::complete_graph</span>Graph::<a href="Graph-pm-695-block.html#1776">complete_graph</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::connected_component_by_index</span>Graph::<a href="Graph-pm-695-block.html#2766">connected_component_by_index</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::connected_component_by_vertex</span>Graph::<a href="Graph-pm-695-block.html#2759">connected_component_by_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::connected_components</span>Graph::<a href="Graph-pm-695-block.html#2773">connected_components</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::connected_graph</span>Graph::<a href="Graph-pm-695-block.html#2810">connected_graph</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::connectivity_clear_cache</span>Graph::<a href="Graph-pm-695-block.html#2671">connectivity_clear_cache</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::copy</span>Graph::<a href="Graph-pm-695-block.html#1697">copy</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::could_be_isomorphic</span>Graph::<a href="Graph-pm-695-block.html#3899">could_be_isomorphic</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::deep_copy</span>Graph::<a href="Graph-pm-695-block.html#1739">deep_copy</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::degree</span>Graph::<a href="Graph-pm-695-block.html#1073">degree</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_attribute</span>Graph::<a href="Graph-pm-695-block.html#2556">delete_attribute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_attributes</span>Graph::<a href="Graph-pm-695-block.html#2566">delete_attributes</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_cycle</span>Graph::<a href="Graph-pm-695-block.html#1250">delete_cycle</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_edge_attribute</span>Graph::<a href="Graph-pm-695-block.html#1628">delete_edge_attribute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_edge_attribute_by_id</span>Graph::<a href="Graph-pm-695-block.html#1636">delete_edge_attribute_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_edge_attributes</span>Graph::<a href="Graph-pm-695-block.html#1613">delete_edge_attributes</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_edge_attributes_by_id</span>Graph::<a href="Graph-pm-695-block.html#1620">delete_edge_attributes_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_edge_by_id</span>Graph::<a href="Graph-pm-695-block.html#698">delete_edge_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_edge_weight</span>Graph::<a href="Graph-pm-695-block.html#2003">delete_edge_weight</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_edge_weight_by_id</span>Graph::<a href="Graph-pm-695-block.html#2055">delete_edge_weight_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_edges</span>Graph::<a href="Graph-pm-695-block.html#1025">delete_edges</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_path</span>Graph::<a href="Graph-pm-695-block.html#1222">delete_path</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_vertex_attribute</span>Graph::<a href="Graph-pm-695-block.html#1425">delete_vertex_attribute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_vertex_attribute_by_id</span>Graph::<a href="Graph-pm-695-block.html#1433">delete_vertex_attribute_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_vertex_attributes</span>Graph::<a href="Graph-pm-695-block.html#1411">delete_vertex_attributes</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_vertex_attributes_by_id</span>Graph::<a href="Graph-pm-695-block.html#1418">delete_vertex_attributes_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_vertex_by_id</span>Graph::<a href="Graph-pm-695-block.html#649">delete_vertex_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_vertex_weight</span>Graph::<a href="Graph-pm-695-block.html#1875">delete_vertex_weight</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_vertex_weight_by_id</span>Graph::<a href="Graph-pm-695-block.html#1919">delete_vertex_weight_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::delete_vertices</span>Graph::<a href="Graph-pm-695-block.html#1015">delete_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::density</span>Graph::<a href="Graph-pm-695-block.html#2441">density</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::density_limits</span>Graph::<a href="Graph-pm-695-block.html#2430">density_limits</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::diameter</span>Graph::<a href="Graph-pm-695-block.html#3672">diameter</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::directed_copy</span>Graph::<a href="Graph-pm-695-block.html#2615">directed_copy</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::edges02</span>Graph::<a href="Graph-pm-695-block.html#565">edges02</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::edges_at</span>Graph::<a href="Graph-pm-695-block.html#845">edges_at</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::expect_acyclic</span>Graph::<a href="Graph-pm-695-block.html#2090">expect_acyclic</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::expect_dag</span>Graph::<a href="Graph-pm-695-block.html#2095">expect_dag</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::expect_directed</span>Graph::<a href="Graph-pm-695-block.html#2085">expect_directed</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::expect_multiedged</span>Graph::<a href="Graph-pm-695-block.html#2118">expect_multiedged</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::expect_multivertexed</span>Graph::<a href="Graph-pm-695-block.html#2103">expect_multivertexed</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::expect_non_multivertexed</span>Graph::<a href="Graph-pm-695-block.html#2108">expect_non_multivertexed</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::expect_undirected</span>Graph::<a href="Graph-pm-695-block.html#2080">expect_undirected</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::exterior_vertices</span>Graph::<a href="Graph-pm-695-block.html#1197">exterior_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::find_a_cycle</span>Graph::<a href="Graph-pm-695-block.html#1272">find_a_cycle</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::for_shortest_paths</span>Graph::<a href="Graph-pm-695-block.html#3633">for_shortest_paths</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_attribute</span>Graph::<a href="Graph-pm-695-block.html#2515">get_attribute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_attributes</span>Graph::<a href="Graph-pm-695-block.html#2525">get_attributes</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_edge_attribute_by_id</span>Graph::<a href="Graph-pm-695-block.html#1574">get_edge_attribute_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_edge_attribute_names</span>Graph::<a href="Graph-pm-695-block.html#1583">get_edge_attribute_names</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_edge_attribute_names_by_id</span>Graph::<a href="Graph-pm-695-block.html#1590">get_edge_attribute_names_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_edge_attribute_values</span>Graph::<a href="Graph-pm-695-block.html#1598">get_edge_attribute_values</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_edge_attribute_values_by_id</span>Graph::<a href="Graph-pm-695-block.html#1605">get_edge_attribute_values_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_edge_attributes_by_id</span>Graph::<a href="Graph-pm-695-block.html#1539">get_edge_attributes_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_edge_count</span>Graph::<a href="Graph-pm-695-block.html#1008">get_edge_count</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_edge_weight</span>Graph::<a href="Graph-pm-695-block.html#1984">get_edge_weight</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_edge_weight_by_id</span>Graph::<a href="Graph-pm-695-block.html#2036">get_edge_weight_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_multiedge_ids</span>Graph::<a href="Graph-pm-695-block.html#711">get_multiedge_ids</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_multivertex_ids</span>Graph::<a href="Graph-pm-695-block.html#662">get_multivertex_ids</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_vertex_attribute</span>Graph::<a href="Graph-pm-695-block.html#1367">get_vertex_attribute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_vertex_attribute_by_id</span>Graph::<a href="Graph-pm-695-block.html#1375">get_vertex_attribute_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_vertex_attribute_names</span>Graph::<a href="Graph-pm-695-block.html#1383">get_vertex_attribute_names</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_vertex_attribute_names_by_id</span>Graph::<a href="Graph-pm-695-block.html#1390">get_vertex_attribute_names_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_vertex_attribute_values</span>Graph::<a href="Graph-pm-695-block.html#1397">get_vertex_attribute_values</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_vertex_attribute_values_by_id</span>Graph::<a href="Graph-pm-695-block.html#1404">get_vertex_attribute_values_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_vertex_attributes</span>Graph::<a href="Graph-pm-695-block.html#1352">get_vertex_attributes</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_vertex_attributes_by_id</span>Graph::<a href="Graph-pm-695-block.html#1360">get_vertex_attributes_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_vertex_count</span>Graph::<a href="Graph-pm-695-block.html#1003">get_vertex_count</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_vertex_weight</span>Graph::<a href="Graph-pm-695-block.html#1856">get_vertex_weight</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::get_vertex_weight_by_id</span>Graph::<a href="Graph-pm-695-block.html#1900">get_vertex_weight_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_attribute</span>Graph::<a href="Graph-pm-695-block.html#2535">has_attribute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_attributes</span>Graph::<a href="Graph-pm-695-block.html#2546">has_attributes</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_cycle</span>Graph::<a href="Graph-pm-695-block.html#1256">has_cycle</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_edge_attribute_by_id</span>Graph::<a href="Graph-pm-695-block.html#1522">has_edge_attribute_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_edge_attributes</span>Graph::<a href="Graph-pm-695-block.html#1499">has_edge_attributes</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_edge_attributes_by_id</span>Graph::<a href="Graph-pm-695-block.html#1506">has_edge_attributes_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_edge_by_id</span>Graph::<a href="Graph-pm-695-block.html#689">has_edge_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_edge_weight</span>Graph::<a href="Graph-pm-695-block.html#1990">has_edge_weight</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_edge_weight_by_id</span>Graph::<a href="Graph-pm-695-block.html#2042">has_edge_weight_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_edges</span>Graph::<a href="Graph-pm-695-block.html#616">has_edges</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_path</span>Graph::<a href="Graph-pm-695-block.html#1234">has_path</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_vertex</span>Graph::<a href="Graph-pm-695-block.html#402">has_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_vertex_attribute</span>Graph::<a href="Graph-pm-695-block.html#1336">has_vertex_attribute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_vertex_attribute_by_id</span>Graph::<a href="Graph-pm-695-block.html#1344">has_vertex_attribute_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_vertex_attributes</span>Graph::<a href="Graph-pm-695-block.html#1322">has_vertex_attributes</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_vertex_attributes_by_id</span>Graph::<a href="Graph-pm-695-block.html#1329">has_vertex_attributes_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_vertex_by_id</span>Graph::<a href="Graph-pm-695-block.html#643">has_vertex_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_vertex_weight</span>Graph::<a href="Graph-pm-695-block.html#1862">has_vertex_weight</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_vertex_weight_by_id</span>Graph::<a href="Graph-pm-695-block.html#1906">has_vertex_weight_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::has_vertices</span>Graph::<a href="Graph-pm-695-block.html#458">has_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::hyperedged</span>Graph::<a href="Graph-pm-695-block.html#339">hyperedged</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::hypervertexed</span>Graph::<a href="Graph-pm-695-block.html#330">hypervertexed</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::in_degree</span>Graph::<a href="Graph-pm-695-block.html#1047">in_degree</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::in_edges</span>Graph::<a href="Graph-pm-695-block.html#1661">in_edges</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::interior_vertices</span>Graph::<a href="Graph-pm-695-block.html#1192">interior_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_acyclic</span>Graph::<a href="Graph-pm-695-block.html#2407">is_acyclic</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_biconnected</span>Graph::<a href="Graph-pm-695-block.html#3264">is_biconnected</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_connected</span>Graph::<a href="Graph-pm-695-block.html#2830">is_connected</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_dag</span>Graph::<a href="Graph-pm-695-block.html#2412">is_dag</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_edge_connected</span>Graph::<a href="Graph-pm-695-block.html#3270">is_edge_connected</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_edge_separable</span>Graph::<a href="Graph-pm-695-block.html#3276">is_edge_separable</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_exterior_vertex</span>Graph::<a href="Graph-pm-695-block.html#1142">is_exterior_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_interior_vertex</span>Graph::<a href="Graph-pm-695-block.html#1130">is_interior_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_multi_graph</span>Graph::<a href="Graph-pm-695-block.html#3838">is_multi_graph</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_predecessorful_vertex</span>Graph::<a href="Graph-pm-695-block.html#1118">is_predecessorful_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_predecessorless_vertex</span>Graph::<a href="Graph-pm-695-block.html#1106">is_predecessorless_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_pseudo_graph</span>Graph::<a href="Graph-pm-695-block.html#3861">is_pseudo_graph</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_reachable</span>Graph::<a href="Graph-pm-695-block.html#3627">is_reachable</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_self_loop_vertex</span>Graph::<a href="Graph-pm-695-block.html#1148">is_self_loop_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_simple_graph</span>Graph::<a href="Graph-pm-695-block.html#3852">is_simple_graph</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_sink_vertex</span>Graph::<a href="Graph-pm-695-block.html#1088">is_sink_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_source_vertex</span>Graph::<a href="Graph-pm-695-block.html#1094">is_source_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_strongly_connected</span>Graph::<a href="Graph-pm-695-block.html#2959">is_strongly_connected</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_successorful_vertex</span>Graph::<a href="Graph-pm-695-block.html#1112">is_successorful_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_successorless_vertex</span>Graph::<a href="Graph-pm-695-block.html#1100">is_successorless_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_transitive</span>Graph::<a href="Graph-pm-695-block.html#1823">is_transitive</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::is_weakly_connected</span>Graph::<a href="Graph-pm-695-block.html#2837">is_weakly_connected</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::longest_path</span>Graph::<a href="Graph-pm-695-block.html#3680">longest_path</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::ne</span>Graph::<a href="Graph-pm-695-block.html#111">ne</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::omnivertexed</span>Graph::<a href="Graph-pm-695-block.html#331">omnivertexed</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::out_degree</span>Graph::<a href="Graph-pm-695-block.html#1060">out_degree</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::out_edges</span>Graph::<a href="Graph-pm-695-block.html#1654">out_edges</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::path_length</span>Graph::<a href="Graph-pm-695-block.html#3609">path_length</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::path_predecessor</span>Graph::<a href="Graph-pm-695-block.html#3615">path_predecessor</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::path_vertices</span>Graph::<a href="Graph-pm-695-block.html#3621">path_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::predecessorful_vertices</span>Graph::<a href="Graph-pm-695-block.html#1182">predecessorful_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::predecessorless_vertices</span>Graph::<a href="Graph-pm-695-block.html#1172">predecessorless_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::radius</span>Graph::<a href="Graph-pm-695-block.html#3779">radius</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::random_edge</span>Graph::<a href="Graph-pm-695-block.html#2247">random_edge</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::random_graph</span>Graph::<a href="Graph-pm-695-block.html#2168">random_graph</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::random_predecessor</span>Graph::<a href="Graph-pm-695-block.html#2259">random_predecessor</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::random_successor</span>Graph::<a href="Graph-pm-695-block.html#2253">random_successor</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::random_vertex</span>Graph::<a href="Graph-pm-695-block.html#2241">random_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::refvertexed</span>Graph::<a href="Graph-pm-695-block.html#333">refvertexed</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::refvertexed_stringified</span>Graph::<a href="Graph-pm-695-block.html#334">refvertexed_stringified</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::same_biconnected_components</span>Graph::<a href="Graph-pm-695-block.html#3310">same_biconnected_components</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::same_connected_components</span>Graph::<a href="Graph-pm-695-block.html#2780">same_connected_components</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::same_strongly_connected_components</span>Graph::<a href="Graph-pm-695-block.html#2940">same_strongly_connected_components</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::same_weakly_connected_components</span>Graph::<a href="Graph-pm-695-block.html#2863">same_weakly_connected_components</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::self_loop_vertices</span>Graph::<a href="Graph-pm-695-block.html#1202">self_loop_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::set_attribute</span>Graph::<a href="Graph-pm-695-block.html#2494">set_attribute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::set_attributes</span>Graph::<a href="Graph-pm-695-block.html#2504">set_attributes</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::set_edge_attribute_by_id</span>Graph::<a href="Graph-pm-695-block.html#1472">set_edge_attribute_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::set_edge_attributes</span>Graph::<a href="Graph-pm-695-block.html#1482">set_edge_attributes</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::set_edge_attributes_by_id</span>Graph::<a href="Graph-pm-695-block.html#1490">set_edge_attributes_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::set_edge_weight</span>Graph::<a href="Graph-pm-695-block.html#1996">set_edge_weight</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::set_edge_weight_by_id</span>Graph::<a href="Graph-pm-695-block.html#2048">set_edge_weight_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::set_vertex_attribute</span>Graph::<a href="Graph-pm-695-block.html#1288">set_vertex_attribute</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::set_vertex_attribute_by_id</span>Graph::<a href="Graph-pm-695-block.html#1297">set_vertex_attribute_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::set_vertex_attributes</span>Graph::<a href="Graph-pm-695-block.html#1306">set_vertex_attributes</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::set_vertex_attributes_by_id</span>Graph::<a href="Graph-pm-695-block.html#1314">set_vertex_attributes_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::set_vertex_weight</span>Graph::<a href="Graph-pm-695-block.html#1868">set_vertex_weight</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::set_vertex_weight_by_id</span>Graph::<a href="Graph-pm-695-block.html#1912">set_vertex_weight_by_id</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::shortest_path</span>Graph::<a href="Graph-pm-695-block.html#3738">shortest_path</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::sink_vertices</span>Graph::<a href="Graph-pm-695-block.html#1157">sink_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::source_vertices</span>Graph::<a href="Graph-pm-695-block.html#1162">source_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::strong_connectivity_clear_cache</span>Graph::<a href="Graph-pm-695-block.html#2676">strong_connectivity_clear_cache</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::strongly_connected_component_by_index</span>Graph::<a href="Graph-pm-695-block.html#2932">strongly_connected_component_by_index</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::strongly_connected_component_by_vertex</span>Graph::<a href="Graph-pm-695-block.html#2919">strongly_connected_component_by_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::strongly_connected_components</span>Graph::<a href="Graph-pm-695-block.html#2913">strongly_connected_components</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::strongly_connected_graph</span>Graph::<a href="Graph-pm-695-block.html#2997">strongly_connected_graph</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::subgraph_by_radius</span>Graph::<a href="Graph-pm-695-block.html#3942">subgraph_by_radius</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::successorful_vertices</span>Graph::<a href="Graph-pm-695-block.html#1177">successorful_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::successorless_vertices</span>Graph::<a href="Graph-pm-695-block.html#1167">successorless_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::topological_sort</span>Graph::<a href="Graph-pm-695-block.html#2580">topological_sort</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::transitive_closure_matrix</span>Graph::<a href="Graph-pm-695-block.html#3588">transitive_closure_matrix</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::transpose_edge</span>Graph::<a href="Graph-pm-695-block.html#1749">transpose_edge</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::transpose_graph</span>Graph::<a href="Graph-pm-695-block.html#1763">transpose_graph</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::undirected_copy</span>Graph::<a href="Graph-pm-695-block.html#2598">undirected_copy</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::uniqedged</span>Graph::<a href="Graph-pm-695-block.html#341">uniqedged</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::unique_edges</span>Graph::<a href="Graph-pm-695-block.html#586">unique_edges</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::unique_vertices</span>Graph::<a href="Graph-pm-695-block.html#448">unique_vertices</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::uniqvertexed</span>Graph::<a href="Graph-pm-695-block.html#332">uniqvertexed</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::vertex</span>Graph::<a href="Graph-pm-695-block.html#1649">vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::vertex_eccentricity</span>Graph::<a href="Graph-pm-695-block.html#3720">vertex_eccentricity</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::vertices_at</span>Graph::<a href="Graph-pm-695-block.html#723">vertices_at</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::weakly_connected_component_by_index</span>Graph::<a href="Graph-pm-695-block.html#2857">weakly_connected_component_by_index</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::weakly_connected_component_by_vertex</span>Graph::<a href="Graph-pm-695-block.html#2851">weakly_connected_component_by_vertex</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::weakly_connected_components</span>Graph::<a href="Graph-pm-695-block.html#2845">weakly_connected_components</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::::weakly_connected_graph</span>Graph::<a href="Graph-pm-695-block.html#2869">weakly_connected_graph</a></span></td></tr>
+</tbody></table>
+ Call graph for these subroutines as a
+ <a href="http://en.wikipedia.org/wiki/Graphviz">Graphviz</a>
+ <a href="Users-edenc-perl5-lib-perl5-Graph-pm.dot">dot language file</a>.
+
+ <table border="1" cellpadding="0">
+ <thead>
+ <tr><th>Line</th>
+ <th><span title="Number of statements executed">State<br />ments</span></th>
+ <th><span title="Time spend executing statements on the line,
+ excluding time spent executing statements in any called subroutines">Time<br />on line</span></th>
+ <th><span title="Number of subroutines calls">Calls</span></th>
+ <th><span title="Time spent in subroutines called (inclusive)">Time<br />in subs</span></th>
+ <th class="left_indent_header">Code</th>
+ </tr>
+
+ </thead>
+ <tbody>
+ <tr><td class="h"><a name="1"></a>1</td><td></td><td></td><td></td><td></td><td class="s">package Graph;</td></tr>
+<tr><td class="h"><a name="2"></a>2</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3"></a>3</td><td class="c3">2</td><td class="c3"><span title="Avg 33µs">66µs</span></td><td class="c3">2</td><td class="c3">18µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 15µs (13+3) within Graph::BEGIN@3 which was called:
+# once (13µs+3µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#3">line 3</a></div></div>use strict;<div class="calls"><div class="calls_out"># spent 15µs making 1 call to <a href="Graph-pm-695-block.html#3">Graph::BEGIN@3</a>
+# spent 3µs making 1 call to <a href="strict-pm-3-block.html#34">strict::import</a></div></div></td></tr>
+<tr><td class="h"><a name="4"></a>4</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="5"></a>5</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 3µs within Graph::BEGIN@5 which was called:
+# once (3µs+0s) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#11">line 11</a></div></div>BEGIN {</td></tr>
+<tr><td class="h"><a name="6"></a>6</td><td class="c3">1</td><td class="c3"><span title="Avg 4µs">4µs</span></td><td></td><td></td><td class="s"> if (0) { # SET THIS TO ZERO FOR TESTING AND RELEASES!</td></tr>
+<tr><td class="h"><a name="7"></a>7</td><td></td><td></td><td></td><td></td><td class="s"> $SIG{__DIE__ } = \&__carp_confess;</td></tr>
+<tr><td class="h"><a name="8"></a>8</td><td></td><td></td><td></td><td></td><td class="s"> $SIG{__WARN__} = \&__carp_confess;</td></tr>
+<tr><td class="h"><a name="9"></a>9</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="10"></a>10</td><td></td><td></td><td></td><td></td><td class="s"> sub __carp_confess { require Carp; Carp::confess(@_) }</td></tr>
+<tr><td class="h"><a name="11"></a>11</td><td class="c3">1</td><td class="c3"><span title="Avg 21µs">21µs</span></td><td class="c3">1</td><td class="c3">3µs</td><td class="s">}<div class="calls"><div class="calls_out"># spent 3µs making 1 call to <a href="Graph-pm-695-block.html#5">Graph::BEGIN@5</a></div></div></td></tr>
+<tr><td class="h"><a name="12"></a>12</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="13"></a>13</td><td class="c3">2</td><td class="c3"><span title="Avg 52µs">104µs</span></td><td class="c3">2</td><td class="c1">3.47ms</td><td class="s"><div class="calls"><div class="calls_in"># spent 3.15ms (2.77+383µs) within Graph::BEGIN@13 which was called:
+# once (2.77ms+383µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#13">line 13</a></div></div>use Graph::AdjacencyMap qw(:flags :fields);<div class="calls"><div class="calls_out"># spent 3.15ms making 1 call to <a href="Graph-pm-695-block.html#13">Graph::BEGIN@13</a>
+# spent 318µs making 1 call to <a href="Exporter-pm-8-block.html#28">Exporter::import</a></div></div></td></tr>
+<tr><td class="h"><a name="14"></a>14</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="15"></a>15</td><td class="c3">2</td><td class="c3"><span title="Avg 30µs">61µs</span></td><td class="c3">2</td><td class="c3">46µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 28µs (9+19) within Graph::BEGIN@15 which was called:
+# once (9µs+19µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#15">line 15</a></div></div>use vars qw($VERSION);<div class="calls"><div class="calls_out"># spent 28µs making 1 call to <a href="Graph-pm-695-block.html#15">Graph::BEGIN@15</a>
+# spent 19µs making 1 call to <a href="vars-pm-6-block.html#10">vars::import</a></div></div></td></tr>
+<tr><td class="h"><a name="16"></a>16</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="17"></a>17</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">$VERSION = '0.94';</td></tr>
+<tr><td class="h"><a name="18"></a>18</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="19"></a>19</td><td class="c3">1</td><td class="c3"><span title="Avg 46µs">46µs</span></td><td></td><td></td><td class="s">require 5.006; # Weak references are absolutely required.</td></tr>
+<tr><td class="h"><a name="20"></a>20</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="21"></a>21</td><td class="c3">1</td><td class="c3"><span title="Avg 32µs">32µs</span></td><td></td><td></td><td class="s">my $can_deep_copy_Storable =<div class="calls"><div class="calls_out"># spent 132µs executing statements in <a href="(eval 474)[Graph-pm-21]-731-line.html">string eval</a></div></div></td></tr>
+<tr><td class="h"><a name="22"></a>22</td><td></td><td></td><td></td><td></td><td class="s"> eval 'require Storable; require B::Deparse; $Storable::VERSION >= 2.05 && $B::Deparse::VERSION >= 0.61' && !$@;</td></tr>
+<tr><td class="h"><a name="23"></a>23</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="24"></a>24</td><td></td><td></td><td></td><td></td><td class="s">sub _can_deep_copy_Storable () {</td></tr>
+<tr><td class="h"><a name="25"></a>25</td><td></td><td></td><td></td><td></td><td class="s"> return $can_deep_copy_Storable;</td></tr>
+<tr><td class="h"><a name="26"></a>26</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="27"></a>27</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="28"></a>28</td><td class="c3">2</td><td class="c2"><span title="Avg 64µs">128µs</span></td><td class="c3">2</td><td class="c0">8.59ms</td><td class="s"><div class="calls"><div class="calls_in"># spent 8.56ms (7.70+863µs) within Graph::BEGIN@28 which was called:
+# once (7.70ms+863µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#28">line 28</a></div></div>use Graph::AdjacencyMap::Heavy;<div class="calls"><div class="calls_out"># spent 8.56ms making 1 call to <a href="Graph-pm-695-block.html#28">Graph::BEGIN@28</a>
+# spent 28µs making 1 call to <a href="Exporter-pm-8-block.html#28">Exporter::import</a></div></div></td></tr>
+<tr><td class="h"><a name="29"></a>29</td><td class="c3">2</td><td class="c2"><span title="Avg 61µs">122µs</span></td><td class="c3">2</td><td class="c1">3.59ms</td><td class="s"><div class="calls"><div class="calls_in"># spent 3.57ms (1.63+1.94) within Graph::BEGIN@29 which was called:
+# once (1.63ms+1.94ms) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#29">line 29</a></div></div>use Graph::AdjacencyMap::Light;<div class="calls"><div class="calls_out"># spent 3.57ms making 1 call to <a href="Graph-pm-695-block.html#29">Graph::BEGIN@29</a>
+# spent 20µs making 1 call to <a href="Exporter-pm-8-block.html#28">Exporter::import</a></div></div></td></tr>
+<tr><td class="h"><a name="30"></a>30</td><td class="c3">2</td><td class="c3"><span title="Avg 12µs">23µs</span></td><td class="c3">2</td><td class="c3">35µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 22µs (9+13) within Graph::BEGIN@30 which was called:
+# once (9µs+13µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#30">line 30</a></div></div>use Graph::AdjacencyMap::Vertex;<div class="calls"><div class="calls_out"># spent 22µs making 1 call to <a href="Graph-pm-695-block.html#30">Graph::BEGIN@30</a>
+# spent 13µs making 1 call to <a href="Exporter-pm-8-block.html#28">Exporter::import</a></div></div></td></tr>
+<tr><td class="h"><a name="31"></a>31</td><td class="c3">2</td><td class="c3"><span title="Avg 53µs">105µs</span></td><td class="c3">1</td><td class="c3">613µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 613µs (595+18) within Graph::BEGIN@31 which was called:
+# once (595µs+18µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#31">line 31</a></div></div>use Graph::UnionFind;<div class="calls"><div class="calls_out"># spent 613µs making 1 call to <a href="Graph-pm-695-block.html#31">Graph::BEGIN@31</a></div></div></td></tr>
+<tr><td class="h"><a name="32"></a>32</td><td class="c3">2</td><td class="c3"><span title="Avg 55µs">110µs</span></td><td class="c3">1</td><td class="c0">3.86ms</td><td class="s"><div class="calls"><div class="calls_in"># spent 3.86ms (419µs+3.44) within Graph::BEGIN@32 which was called:
+# once (419µs+3.44ms) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#32">line 32</a></div></div>use Graph::TransitiveClosure;<div class="calls"><div class="calls_out"># spent 3.86ms making 1 call to <a href="Graph-pm-695-block.html#32">Graph::BEGIN@32</a></div></div></td></tr>
+<tr><td class="h"><a name="33"></a>33</td><td class="c3">2</td><td class="c2"><span title="Avg 71µs">142µs</span></td><td class="c3">1</td><td class="c0">4.39ms</td><td class="s"><div class="calls"><div class="calls_in"># spent 4.39ms (294µs+4.10) within Graph::BEGIN@33 which was called:
+# once (294µs+4.10ms) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#33">line 33</a></div></div>use Graph::Traversal::DFS;<div class="calls"><div class="calls_out"># spent 4.39ms making 1 call to <a href="Graph-pm-695-block.html#33">Graph::BEGIN@33</a></div></div></td></tr>
+<tr><td class="h"><a name="34"></a>34</td><td class="c3">2</td><td class="c1"><span title="Avg 83µs">167µs</span></td><td class="c3">2</td><td class="c1">3.20ms</td><td class="s"><div class="calls"><div class="calls_in"># spent 3.17ms (409µs+2.76) within Graph::BEGIN@34 which was called:
+# once (409µs+2.76ms) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#34">line 34</a></div></div>use Graph::MSTHeapElem;<div class="calls"><div class="calls_out"># spent 3.17ms making 1 call to <a href="Graph-pm-695-block.html#34">Graph::BEGIN@34</a>
+# spent 25µs making 1 call to <a href="Exporter-pm-8-block.html#28">Exporter::import</a></div></div></td></tr>
+<tr><td class="h"><a name="35"></a>35</td><td class="c3">2</td><td class="c1"><span title="Avg 101µs">201µs</span></td><td class="c3">2</td><td class="c3">952µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 910µs (514+396) within Graph::BEGIN@35 which was called:
+# once (514µs+396µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#35">line 35</a></div></div>use Graph::SPTHeapElem;<div class="calls"><div class="calls_out"># spent 910µs making 1 call to <a href="Graph-pm-695-block.html#35">Graph::BEGIN@35</a>
+# spent 43µs making 1 call to <a href="Exporter-pm-8-block.html#28">Exporter::import</a></div></div></td></tr>
+<tr><td class="h"><a name="36"></a>36</td><td class="c3">2</td><td class="c1"><span title="Avg 96µs">192µs</span></td><td class="c3">1</td><td class="c3">516µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 516µs (358+158) within Graph::BEGIN@36 which was called:
+# once (358µs+158µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#36">line 36</a></div></div>use Graph::Undirected;<div class="calls"><div class="calls_out"># spent 516µs making 1 call to <a href="Graph-pm-695-block.html#36">Graph::BEGIN@36</a></div></div></td></tr>
+<tr><td class="h"><a name="37"></a>37</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="38"></a>38</td><td class="c3">2</td><td class="c1"><span title="Avg 84µs">168µs</span></td><td class="c3">2</td><td class="c2">2.01ms</td><td class="s"><div class="calls"><div class="calls_in"># spent 1.99ms (1.80+184µs) within Graph::BEGIN@38 which was called:
+# once (1.80ms+184µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#38">line 38</a></div></div>use Heap071::Fibonacci;<div class="calls"><div class="calls_out"># spent 1.99ms making 1 call to <a href="Graph-pm-695-block.html#38">Graph::BEGIN@38</a>
+# spent 25µs making 1 call to <a href="Exporter-pm-8-block.html#28">Exporter::import</a></div></div></td></tr>
+<tr><td class="h"><a name="39"></a>39</td><td class="c3">2</td><td class="c3"><span title="Avg 21µs">41µs</span></td><td class="c3">2</td><td class="c3">102µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 59µs (15+44) within Graph::BEGIN@39 which was called:
+# once (15µs+44µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#39">line 39</a></div></div>use List::Util qw(shuffle first);<div class="calls"><div class="calls_out"># spent 59µs making 1 call to <a href="Graph-pm-695-block.html#39">Graph::BEGIN@39</a>
+# spent 44µs making 1 call to <a href="Exporter-pm-8-block.html#28">Exporter::import</a></div></div></td></tr>
+<tr><td class="h"><a name="40"></a>40</td><td class="c3">2</td><td class="c3"><span title="Avg 18µs">36µs</span></td><td class="c3">2</td><td class="c3">79µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 45µs (12+33) within Graph::BEGIN@40 which was called:
+# once (12µs+33µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#40">line 40</a></div></div>use Scalar::Util qw(weaken);<div class="calls"><div class="calls_out"># spent 45µs making 1 call to <a href="Graph-pm-695-block.html#40">Graph::BEGIN@40</a>
+# spent 33µs making 1 call to <a href="Exporter-pm-8-block.html#28">Exporter::import</a></div></div></td></tr>
+<tr><td class="h"><a name="41"></a>41</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="42"></a>42</td><td class="c3">2</td><td class="c0"><span title="Avg 147µs">293µs</span></td><td class="c3">1</td><td class="c0">42.9ms</td><td class="s"><div class="calls"><div class="calls_in"># spent 42.9ms (2.88+40.0) within Graph::BEGIN@42 which was called:
+# once (2.88ms+40.0ms) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#42">line 42</a></div></div>use Safe; # For deep_copy().<div class="calls"><div class="calls_out"># spent 42.9ms making 1 call to <a href="Graph-pm-695-block.html#42">Graph::BEGIN@42</a></div></div></td></tr>
+<tr><td class="h"><a name="43"></a>43</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="44"></a>44</td><td></td><td></td><td></td><td></td><td class="s">sub _F () { 0 } # Flags.</td></tr>
+<tr><td class="h"><a name="45"></a>45</td><td></td><td></td><td></td><td></td><td class="s">sub _G () { 1 } # Generation.</td></tr>
+<tr><td class="h"><a name="46"></a>46</td><td></td><td></td><td></td><td></td><td class="s">sub _V () { 2 } # Vertices.</td></tr>
+<tr><td class="h"><a name="47"></a>47</td><td></td><td></td><td></td><td></td><td class="s">sub _E () { 3 } # Edges.</td></tr>
+<tr><td class="h"><a name="48"></a>48</td><td></td><td></td><td></td><td></td><td class="s">sub _A () { 4 } # Attributes.</td></tr>
+<tr><td class="h"><a name="49"></a>49</td><td></td><td></td><td></td><td></td><td class="s">sub _U () { 5 } # Union-Find.</td></tr>
+<tr><td class="h"><a name="50"></a>50</td><td></td><td></td><td></td><td></td><td class="s">sub _S () { 6 } # Successors.</td></tr>
+<tr><td class="h"><a name="51"></a>51</td><td></td><td></td><td></td><td></td><td class="s">sub _P () { 7 } # Predecessors.</td></tr>
+<tr><td class="h"><a name="52"></a>52</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="53"></a>53</td><td class="c3">1</td><td class="c3"><span title="Avg 400ns">400ns</span></td><td></td><td></td><td class="s">my $Inf;</td></tr>
+<tr><td class="h"><a name="54"></a>54</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="55"></a>55</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 25µs within Graph::BEGIN@55 which was called:
+# once (25µs+0s) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#61">line 61</a></div></div>BEGIN {</td></tr>
+<tr><td class="h"><a name="56"></a>56</td><td class="c3">2</td><td class="c3"><span title="Avg 11µs">22µs</span></td><td></td><td></td><td class="s"> local $SIG{FPE}; </td></tr>
+<tr><td class="h"><a name="57"></a>57</td><td></td><td></td><td></td><td></td><td class="s"> eval { $Inf = exp(999) } ||</td></tr>
+<tr><td class="h"><a name="58"></a>58</td><td></td><td></td><td></td><td></td><td class="s"> eval { $Inf = 9**9**9 } ||</td></tr>
+<tr><td class="h"><a name="59"></a>59</td><td class="c3">1</td><td class="c3"><span title="Avg 600ns">600ns</span></td><td></td><td></td><td class="s"> eval { $Inf = 1e+999 } ||</td></tr>
+<tr><td class="h"><a name="60"></a>60</td><td></td><td></td><td></td><td></td><td class="s"> { $Inf = 1e+99 }; # Close enough for most practical purposes.</td></tr>
+<tr><td class="h"><a name="61"></a>61</td><td class="c3">1</td><td class="c3"><span title="Avg 56µs">56µs</span></td><td class="c3">1</td><td class="c3">25µs</td><td class="s">}<div class="calls"><div class="calls_out"># spent 25µs making 1 call to <a href="Graph-pm-695-block.html#55">Graph::BEGIN@55</a></div></div></td></tr>
+<tr><td class="h"><a name="62"></a>62</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="63"></a>63</td><td></td><td></td><td></td><td></td><td class="s">sub Infinity () { $Inf }</td></tr>
+<tr><td class="h"><a name="64"></a>64</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="65"></a>65</td><td></td><td></td><td></td><td></td><td class="s"># Graphs are blessed array references.</td></tr>
+<tr><td class="h"><a name="66"></a>66</td><td></td><td></td><td></td><td></td><td class="s"># - The first element contains the flags.</td></tr>
+<tr><td class="h"><a name="67"></a>67</td><td></td><td></td><td></td><td></td><td class="s"># - The second element is the vertices.</td></tr>
+<tr><td class="h"><a name="68"></a>68</td><td></td><td></td><td></td><td></td><td class="s"># - The third element is the edges.</td></tr>
+<tr><td class="h"><a name="69"></a>69</td><td></td><td></td><td></td><td></td><td class="s"># - The fourth element is the attributes of the whole graph.</td></tr>
+<tr><td class="h"><a name="70"></a>70</td><td></td><td></td><td></td><td></td><td class="s"># The defined flags for Graph are:</td></tr>
+<tr><td class="h"><a name="71"></a>71</td><td></td><td></td><td></td><td></td><td class="s"># - _COMPAT02 for user API compatibility with the Graph 0.20xxx series.</td></tr>
+<tr><td class="h"><a name="72"></a>72</td><td></td><td></td><td></td><td></td><td class="s"># The vertices are contained in either a "simplemap"</td></tr>
+<tr><td class="h"><a name="73"></a>73</td><td></td><td></td><td></td><td></td><td class="s"># (if no hypervertices) or in a "map".</td></tr>
+<tr><td class="h"><a name="74"></a>74</td><td></td><td></td><td></td><td></td><td class="s"># The edges are always in a "map".</td></tr>
+<tr><td class="h"><a name="75"></a>75</td><td></td><td></td><td></td><td></td><td class="s"># The defined flags for maps are:</td></tr>
+<tr><td class="h"><a name="76"></a>76</td><td></td><td></td><td></td><td></td><td class="s"># - _COUNT for countedness: more than one instance</td></tr>
+<tr><td class="h"><a name="77"></a>77</td><td></td><td></td><td></td><td></td><td class="s"># - _HYPER for hyperness: a different number of "coordinates" than usual;</td></tr>
+<tr><td class="h"><a name="78"></a>78</td><td></td><td></td><td></td><td></td><td class="s"># expects one for vertices and two for edges</td></tr>
+<tr><td class="h"><a name="79"></a>79</td><td></td><td></td><td></td><td></td><td class="s"># - _UNORD for unordered coordinates (a set): if _UNORD is not set</td></tr>
+<tr><td class="h"><a name="80"></a>80</td><td></td><td></td><td></td><td></td><td class="s"># the coordinates are assumed to be meaningfully ordered</td></tr>
+<tr><td class="h"><a name="81"></a>81</td><td></td><td></td><td></td><td></td><td class="s"># - _UNIQ for unique coordinates: if set duplicates are removed,</td></tr>
+<tr><td class="h"><a name="82"></a>82</td><td></td><td></td><td></td><td></td><td class="s"># if not, duplicates are assumed to meaningful</td></tr>
+<tr><td class="h"><a name="83"></a>83</td><td></td><td></td><td></td><td></td><td class="s"># - _UNORDUNIQ: just a union of _UNORD and UNIQ</td></tr>
+<tr><td class="h"><a name="84"></a>84</td><td></td><td></td><td></td><td></td><td class="s"># Vertices are assumed to be _UNORDUNIQ; edges assume none of these flags.</td></tr>
+<tr><td class="h"><a name="85"></a>85</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="86"></a>86</td><td class="c3">2</td><td class="c0"><span title="Avg 171µs">342µs</span></td><td class="c3">2</td><td class="c3">1.21ms</td><td class="s"><div class="calls"><div class="calls_in"># spent 1.10ms (897µs+198µs) within Graph::BEGIN@86 which was called:
+# once (897µs+198µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#86">line 86</a></div></div>use Graph::Attribute array => _A, map => 'graph';<div class="calls"><div class="calls_out"># spent 1.10ms making 1 call to <a href="Graph-pm-695-block.html#86">Graph::BEGIN@86</a>
+# spent 116µs making 1 call to <a href="Graph-Attribute-pm-730-block.html#8">Graph::Attribute::import</a></div></div></td></tr>
+<tr><td class="h"><a name="87"></a>87</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="88"></a>88</td><td></td><td></td><td></td><td></td><td class="s">sub _COMPAT02 () { 0x00000001 }</td></tr>
+<tr><td class="h"><a name="89"></a>89</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="90"></a>90</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 4.72s (537ms+4.19) within Graph::stringify which was called 102 times, avg 46.3ms/call:
+# 51 times (274ms+2.12s) by Graph::eq at <a href="Graph-pm-695-block.html#108">line 108</a>, avg 47.0ms/call
+# 51 times (263ms+2.06s) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#862">line 862 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 45.6ms/call</div></div>sub stringify {</td></tr>
+<tr><td class="h"><a name="91"></a>91</td><td class="c0">714</td><td class="c0"><span title="Avg 574µs">410ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="92"></a>92</td><td></td><td></td><td class="c2">102</td><td class="c3">801µs</td><td class="s"> my $u = $g->is_undirected;<div class="calls"><div class="calls_out"> # spent 801µs making 102 calls to <a href="Graph-pm-695-block.html#340">Graph::omniedged</a>, avg 8µs/call</div></div></td></tr>
+<tr><td class="h"><a name="93"></a>93</td><td></td><td></td><td></td><td></td><td class="s"> my $e = $u ? '=' : '-';</td></tr>
+<tr><td class="h"><a name="94"></a>94</td><td></td><td></td><td></td><td></td><td class="s"> my @e =</td></tr>
+<tr><td class="h"><a name="95"></a>95</td><td></td><td></td><td></td><td></td><td class="s"> map {</td></tr>
+<tr><td class="h"><a name="96"></a>96</td><td class="c0">232212</td><td class="c0"><span title="Avg 1µs">260ms</span></td><td class="c2">102</td><td class="c0">1.79s</td><td class="s"> my @v =<div class="calls"><div class="calls_out"> # spent 1.79s making 102 calls to <a href="Graph-pm-695-block.html#554">Graph::edges05</a>, avg 17.5ms/call</div></div></td></tr>
+<tr><td class="h"><a name="97"></a>97</td><td></td><td></td><td></td><td></td><td class="s"> map {</td></tr>
+<tr><td class="h"><a name="98"></a>98</td><td></td><td></td><td></td><td></td><td class="s"> ref($_) eq 'ARRAY' ? "[" . join(" ", @$_) . "]" : "$_"</td></tr>
+<tr><td class="h"><a name="99"></a>99</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="100"></a>100</td><td></td><td></td><td></td><td></td><td class="s"> @$_;</td></tr>
+<tr><td class="h"><a name="101"></a>101</td><td></td><td></td><td></td><td></td><td class="s"> join($e, $u ? sort { "$a" cmp "$b" } @v : @v) } $g->edges05;</td></tr>
+<tr><td class="h"><a name="102"></a>102</td><td></td><td></td><td class="c2">102</td><td class="c0">168ms</td><td class="s"> my @s = sort { "$a" cmp "$b" } @e;<div class="calls"><div class="calls_out"> # spent 168ms making 102 calls to <a href="Graph-pm-695-block.html#Graph__CORE_sort">Graph::CORE:sort</a>, avg 1.64ms/call</div></div></td></tr>
+<tr><td class="h"><a name="103"></a>103</td><td></td><td></td><td class="c0">204</td><td class="c0">2.23s</td><td class="s"> push @s, sort { "$a" cmp "$b" } $g->isolated_vertices;<div class="calls"><div class="calls_out"> # spent 2.23s making 102 calls to <a href="Graph-pm-695-block.html#1187">Graph::isolated_vertices</a>, avg 21.9ms/call
+ # spent 184µs making 102 calls to <a href="Graph-pm-695-block.html#Graph__CORE_sort">Graph::CORE:sort</a>, avg 2µs/call</div></div></td></tr>
+<tr><td class="h"><a name="104"></a>104</td><td></td><td></td><td></td><td></td><td class="s"> join(",", @s);</td></tr>
+<tr><td class="h"><a name="105"></a>105</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="106"></a>106</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="107"></a>107</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 2.40s (950µs+2.40) within Graph::eq which was called 51 times, avg 47.0ms/call:
+# 51 times (950µs+2.40s) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#894">line 894 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 47.0ms/call</div></div>sub eq {</td></tr>
+<tr><td class="h"><a name="108"></a>108</td><td class="c0">51</td><td class="c0"><span title="Avg 16µs">812µs</span></td><td class="c3">51</td><td class="c0">2.40s</td><td class="s"> "$_[0]" eq "$_[1]"<div class="calls"><div class="calls_out"> # spent 2.40s making 51 calls to <a href="Graph-pm-695-block.html#90">Graph::stringify</a>, avg 47.0ms/call</div></div></td></tr>
+<tr><td class="h"><a name="109"></a>109</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="110"></a>110</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="111"></a>111</td><td></td><td></td><td></td><td></td><td class="s">sub ne {</td></tr>
+<tr><td class="h"><a name="112"></a>112</td><td></td><td></td><td></td><td></td><td class="s"> "$_[0]" ne "$_[1]"</td></tr>
+<tr><td class="h"><a name="113"></a>113</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="114"></a>114</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="115"></a>115</td><td></td><td></td><td></td><td></td><td class="s">use overload</td></tr>
+<tr><td class="h"><a name="116"></a>116</td><td class="c3">2</td><td class="c3"><span title="Avg 4µs">8µs</span></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 53µs (12+41) within Graph::BEGIN@116 which was called:
+# once (12µs+41µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#118">line 118</a></div></div> '""' => \&stringify,</td></tr>
+<tr><td class="h"><a name="117"></a>117</td><td></td><td></td><td></td><td></td><td class="s"> 'eq' => \&eq,</td></tr>
+<tr><td class="h"><a name="118"></a>118</td><td class="c3">1</td><td class="c0"><span title="Avg 364µs">364µs</span></td><td class="c3">2</td><td class="c3">94µs</td><td class="s"> 'ne' => \&ne;<div class="calls"><div class="calls_out"> # spent 53µs making 1 call to <a href="Graph-pm-695-block.html#116">Graph::BEGIN@116</a>
+ # spent 41µs making 1 call to <a href="overload-pm-29-block.html#30">overload::import</a></div></div></td></tr>
+<tr><td class="h"><a name="119"></a>119</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="120"></a>120</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 2.77ms within Graph::_opt which was called 162 times, avg 17µs/call:
+# 54 times (1.52ms+0s) by Graph::new at <a href="Graph-pm-695-block.html#205">line 205</a>, avg 28µs/call
+# 54 times (859µs+0s) by Graph::new at <a href="Graph-pm-695-block.html#216">line 216</a>, avg 16µs/call
+# 54 times (389µs+0s) by Graph::new at <a href="Graph-pm-695-block.html#224">line 224</a>, avg 7µs/call</div></div>sub _opt {</td></tr>
+<tr><td class="h"><a name="121"></a>121</td><td class="c0">324</td><td class="c0"><span title="Avg 6µs">1.85ms</span></td><td></td><td></td><td class="s"> my ($opt, $flags, %flags) = @_;</td></tr>
+<tr><td class="h"><a name="122"></a>122</td><td class="c0">1620</td><td class="c0"><span title="Avg 325ns">526µs</span></td><td></td><td></td><td class="s"> while (my ($flag, $FLAG) = each %flags) {</td></tr>
+<tr><td class="h"><a name="123"></a>123</td><td class="c0">108</td><td class="c3"><span title="Avg 689ns">74µs</span></td><td></td><td></td><td class="s"> if (exists $opt->{$flag}) {</td></tr>
+<tr><td class="h"><a name="124"></a>124</td><td></td><td></td><td></td><td></td><td class="s"> $$flags |= $FLAG if $opt->{$flag};</td></tr>
+<tr><td class="h"><a name="125"></a>125</td><td></td><td></td><td></td><td></td><td class="s"> delete $opt->{$flag};</td></tr>
+<tr><td class="h"><a name="126"></a>126</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="127"></a>127</td><td></td><td></td><td></td><td></td><td class="s"> if (exists $opt->{my $non = "non$flag"}) {</td></tr>
+<tr><td class="h"><a name="128"></a>128</td><td></td><td></td><td></td><td></td><td class="s"> $$flags &= ~$FLAG if $opt->{$non};</td></tr>
+<tr><td class="h"><a name="129"></a>129</td><td></td><td></td><td></td><td></td><td class="s"> delete $opt->{$non};</td></tr>
+<tr><td class="h"><a name="130"></a>130</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="131"></a>131</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="132"></a>132</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="133"></a>133</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="134"></a>134</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 30.3ms within Graph::is_compat02 which was called 15627 times, avg 2µs/call:
+# 15571 times (30.0ms+0s) by Graph::get_edge_attributes at <a href="Graph-pm-695-block.html#1536">line 1536</a>, avg 2µs/call
+# 51 times (286µs+0s) by Graph::vertices at <a href="Graph-pm-695-block.html#423">line 423</a>, avg 6µs/call
+# 5 times (13µs+0s) by Graph::edges at <a href="Graph-pm-695-block.html#593">line 593</a>, avg 3µs/call</div></div>sub is_compat02 {</td></tr>
+<tr><td class="h"><a name="135"></a>135</td><td class="c0">31254</td><td class="c0"><span title="Avg 1µs">40.2ms</span></td><td></td><td></td><td class="s"> my ($g) = @_;</td></tr>
+<tr><td class="h"><a name="136"></a>136</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _F ] & _COMPAT02;</td></tr>
+<tr><td class="h"><a name="137"></a>137</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="138"></a>138</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="139"></a>139</td><td class="c3">1</td><td class="c3"><span title="Avg 6µs">6µs</span></td><td></td><td></td><td class="s">*compat02 = \&is_compat02;</td></tr>
+<tr><td class="h"><a name="140"></a>140</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="141"></a>141</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 187ms within Graph::has_union_find which was called 112746 times, avg 2µs/call:
+# 56826 times (94.9ms+0s) by Graph::add_vertex at <a href="Graph-pm-695-block.html#398">line 398</a>, avg 2µs/call
+# 55803 times (91.8ms+0s) by Graph::add_edge at <a href="Graph-pm-695-block.html#506">line 506</a>, avg 2µs/call
+# 117 times (235µs+0s) by Graph::expect_non_unionfind at <a href="Graph-pm-695-block.html#2125">line 2125</a>, avg 2µs/call</div></div>sub has_union_find {</td></tr>
+<tr><td class="h"><a name="142"></a>142</td><td class="c0">225492</td><td class="c0"><span title="Avg 1µs">254ms</span></td><td></td><td></td><td class="s"> my ($g) = @_;</td></tr>
+<tr><td class="h"><a name="143"></a>143</td><td></td><td></td><td></td><td></td><td class="s"> ($g->[ _F ] & _UNIONFIND) && defined $g->[ _U ];</td></tr>
+<tr><td class="h"><a name="144"></a>144</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="145"></a>145</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="146"></a>146</td><td></td><td></td><td></td><td></td><td class="s">sub _get_union_find {</td></tr>
+<tr><td class="h"><a name="147"></a>147</td><td></td><td></td><td></td><td></td><td class="s"> my ($g) = @_;</td></tr>
+<tr><td class="h"><a name="148"></a>148</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _U ];</td></tr>
+<tr><td class="h"><a name="149"></a>149</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="150"></a>150</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="151"></a>151</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 302µs within Graph::_opt_get which was called 108 times, avg 3µs/call:
+# 54 times (213µs+0s) by Graph::new at <a href="Graph-pm-695-block.html#190">line 190</a>, avg 4µs/call
+# 54 times (88µs+0s) by Graph::new at <a href="Graph-pm-695-block.html#191">line 191</a>, avg 2µs/call</div></div>sub _opt_get {</td></tr>
+<tr><td class="h"><a name="152"></a>152</td><td class="c0">216</td><td class="c0"><span title="Avg 2µs">358µs</span></td><td></td><td></td><td class="s"> my ($opt, $key, $var) = @_;</td></tr>
+<tr><td class="h"><a name="153"></a>153</td><td class="c3">2</td><td class="c3"><span title="Avg 600ns">1µs</span></td><td></td><td></td><td class="s"> if (exists $opt->{$key}) {</td></tr>
+<tr><td class="h"><a name="154"></a>154</td><td></td><td></td><td></td><td></td><td class="s"> $$var = $opt->{$key};</td></tr>
+<tr><td class="h"><a name="155"></a>155</td><td></td><td></td><td></td><td></td><td class="s"> delete $opt->{$key};</td></tr>
+<tr><td class="h"><a name="156"></a>156</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="157"></a>157</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="158"></a>158</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="159"></a>159</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 213µs within Graph::_opt_unknown which was called 54 times, avg 4µs/call:
+# 54 times (213µs+0s) by Graph::new at <a href="Graph-pm-695-block.html#256">line 256</a>, avg 4µs/call</div></div>sub _opt_unknown {</td></tr>
+<tr><td class="h"><a name="160"></a>160</td><td class="c0">108</td><td class="c1"><span title="Avg 2µs">217µs</span></td><td></td><td></td><td class="s"> my ($opt) = @_;</td></tr>
+<tr><td class="h"><a name="161"></a>161</td><td></td><td></td><td></td><td></td><td class="s"> if (my @opt = keys %$opt) {</td></tr>
+<tr><td class="h"><a name="162"></a>162</td><td></td><td></td><td></td><td></td><td class="s"> my $f = (caller(1))[3];</td></tr>
+<tr><td class="h"><a name="163"></a>163</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="164"></a>164</td><td></td><td></td><td></td><td></td><td class="s"> Carp::confess(sprintf</td></tr>
+<tr><td class="h"><a name="165"></a>165</td><td></td><td></td><td></td><td></td><td class="s"> "$f: Unknown option%s: @{[map { qq['$_'] } sort @opt]}",</td></tr>
+<tr><td class="h"><a name="166"></a>166</td><td></td><td></td><td></td><td></td><td class="s"> @opt > 1 ? 's' : '');</td></tr>
+<tr><td class="h"><a name="167"></a>167</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="168"></a>168</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="169"></a>169</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="170"></a>170</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 8.90ms (3.33+5.57) within Graph::new which was called 54 times, avg 165µs/call:
+# 51 times (3.17ms+5.34ms) by Graph::Traversal::reset at <a href="Graph-Traversal-pm-713-block.html#19">line 19 of Graph/Traversal.pm</a>, avg 167µs/call
+# once (102µs+98µs) by Text::Tradition::Collation::__ANON__[lib/Text/Tradition/Collation.pm:20] at <a href="lib-Text-Tradition-Collation-pm-686-block.html#20">line 20 of lib/Text/Tradition/Collation.pm</a>
+# once (31µs+65µs) by Text::Tradition::Collation::RelationshipStore::__ANON__[lib/Text/Tradition/Collation/RelationshipStore.pm:99] at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#99">line 99 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>
+# once (30µs+65µs) by Text::Tradition::Collation::RelationshipStore::__ANON__[lib/Text/Tradition/Collation/RelationshipStore.pm:80] at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#80">line 80 of lib/Text/Tradition/Collation/RelationshipStore.pm</a></div></div>sub new {</td></tr>
+<tr><td class="h"><a name="171"></a>171</td><td class="c0">1944</td><td class="c0"><span title="Avg 1µs">2.67ms</span></td><td></td><td></td><td class="s"> my $class = shift;</td></tr>
+<tr><td class="h"><a name="172"></a>172</td><td></td><td></td><td></td><td></td><td class="s"> my $gflags = 0;</td></tr>
+<tr><td class="h"><a name="173"></a>173</td><td></td><td></td><td></td><td></td><td class="s"> my $vflags;</td></tr>
+<tr><td class="h"><a name="174"></a>174</td><td></td><td></td><td></td><td></td><td class="s"> my $eflags;</td></tr>
+<tr><td class="h"><a name="175"></a>175</td><td></td><td></td><td class="c3">54</td><td class="c3">766µs</td><td class="s"> my %opt = _get_options( \@_ );<div class="calls"><div class="calls_out"> # spent 766µs making 54 calls to <a href="Graph-pm-695-block.html#2128">Graph::_get_options</a>, avg 14µs/call</div></div></td></tr>
+<tr><td class="h"><a name="176"></a>176</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="177"></a>177</td><td></td><td></td><td></td><td></td><td class="s"> if (ref $class && $class->isa('Graph')) {</td></tr>
+<tr><td class="h"><a name="178"></a>178</td><td class="c3">2</td><td class="c0"><span title="Avg 4.07ms">8.13ms</span></td><td class="c3">2</td><td class="c3">34µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 22µs (9+13) within Graph::BEGIN@178 which was called:
+# once (9µs+13µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#178">line 178</a></div></div> no strict 'refs';<div class="calls"><div class="calls_out"> # spent 22µs making 1 call to <a href="Graph-pm-695-block.html#178">Graph::BEGIN@178</a>
+ # spent 13µs making 1 call to <a href="strict-pm-3-block.html#39">strict::unimport</a></div></div></td></tr>
+<tr><td class="h"><a name="179"></a>179</td><td></td><td></td><td></td><td></td><td class="s"> for my $c (qw(undirected refvertexed compat02</td></tr>
+<tr><td class="h"><a name="180"></a>180</td><td></td><td></td><td></td><td></td><td class="s"> hypervertexed countvertexed multivertexed</td></tr>
+<tr><td class="h"><a name="181"></a>181</td><td></td><td></td><td></td><td></td><td class="s"> hyperedged countedged multiedged omniedged</td></tr>
+<tr><td class="h"><a name="182"></a>182</td><td></td><td></td><td></td><td></td><td class="s"> __stringified)) {</td></tr>
+<tr><td class="h"><a name="183"></a>183</td><td></td><td></td><td></td><td></td><td class="s"># $opt{$c}++ if $class->$c; # 5.00504-incompatible</td></tr>
+<tr><td class="h"><a name="184"></a>184</td><td></td><td></td><td></td><td></td><td class="s"> if (&{"Graph::$c"}($class)) { $opt{$c}++ }</td></tr>
+<tr><td class="h"><a name="185"></a>185</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="186"></a>186</td><td></td><td></td><td></td><td></td><td class="s"># $opt{unionfind}++ if $class->has_union_find; # 5.00504-incompatible</td></tr>
+<tr><td class="h"><a name="187"></a>187</td><td></td><td></td><td></td><td></td><td class="s"> if (&{"Graph::has_union_find"}($class)) { $opt{unionfind}++ }</td></tr>
+<tr><td class="h"><a name="188"></a>188</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="189"></a>189</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="190"></a>190</td><td></td><td></td><td class="c3">54</td><td class="c3">213µs</td><td class="s"> _opt_get(\%opt, undirected => \$opt{omniedged});<div class="calls"><div class="calls_out"> # spent 213µs making 54 calls to <a href="Graph-pm-695-block.html#151">Graph::_opt_get</a>, avg 4µs/call</div></div></td></tr>
+<tr><td class="h"><a name="191"></a>191</td><td></td><td></td><td class="c3">54</td><td class="c3">88µs</td><td class="s"> _opt_get(\%opt, omnidirected => \$opt{omniedged});<div class="calls"><div class="calls_out"> # spent 88µs making 54 calls to <a href="Graph-pm-695-block.html#151">Graph::_opt_get</a>, avg 2µs/call</div></div></td></tr>
+<tr><td class="h"><a name="192"></a>192</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="193"></a>193</td><td class="c0">102</td><td class="c2"><span title="Avg 1µs">127µs</span></td><td></td><td></td><td class="s"> if (exists $opt{directed}) {</td></tr>
+<tr><td class="h"><a name="194"></a>194</td><td></td><td></td><td></td><td></td><td class="s"> $opt{omniedged} = !$opt{directed};</td></tr>
+<tr><td class="h"><a name="195"></a>195</td><td></td><td></td><td></td><td></td><td class="s"> delete $opt{directed};</td></tr>
+<tr><td class="h"><a name="196"></a>196</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="197"></a>197</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="198"></a>198</td><td></td><td></td><td></td><td></td><td class="s"> my $vnonomni =</td></tr>
+<tr><td class="h"><a name="199"></a>199</td><td></td><td></td><td></td><td></td><td class="s"> $opt{nonomnivertexed} ||</td></tr>
+<tr><td class="h"><a name="200"></a>200</td><td></td><td></td><td></td><td></td><td class="s"> (exists $opt{omnivertexed} && !$opt{omnivertexed});</td></tr>
+<tr><td class="h"><a name="201"></a>201</td><td></td><td></td><td></td><td></td><td class="s"> my $vnonuniq =</td></tr>
+<tr><td class="h"><a name="202"></a>202</td><td></td><td></td><td></td><td></td><td class="s"> $opt{nonuniqvertexed} ||</td></tr>
+<tr><td class="h"><a name="203"></a>203</td><td></td><td></td><td></td><td></td><td class="s"> (exists $opt{uniqvertexed} && !$opt{uniqvertexed});</td></tr>
+<tr><td class="h"><a name="204"></a>204</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="205"></a>205</td><td></td><td></td><td class="c3">54</td><td class="c3">1.52ms</td><td class="s"> _opt(\%opt, \$vflags,<div class="calls"><div class="calls_out"> # spent 1.52ms making 54 calls to <a href="Graph-pm-695-block.html#120">Graph::_opt</a>, avg 28µs/call</div></div></td></tr>
+<tr><td class="h"><a name="206"></a>206</td><td></td><td></td><td></td><td></td><td class="s"> countvertexed => _COUNT,</td></tr>
+<tr><td class="h"><a name="207"></a>207</td><td></td><td></td><td></td><td></td><td class="s"> multivertexed => _MULTI,</td></tr>
+<tr><td class="h"><a name="208"></a>208</td><td></td><td></td><td></td><td></td><td class="s"> hypervertexed => _HYPER,</td></tr>
+<tr><td class="h"><a name="209"></a>209</td><td></td><td></td><td></td><td></td><td class="s"> omnivertexed => _UNORD,</td></tr>
+<tr><td class="h"><a name="210"></a>210</td><td></td><td></td><td></td><td></td><td class="s"> uniqvertexed => _UNIQ,</td></tr>
+<tr><td class="h"><a name="211"></a>211</td><td></td><td></td><td></td><td></td><td class="s"> refvertexed => _REF,</td></tr>
+<tr><td class="h"><a name="212"></a>212</td><td></td><td></td><td></td><td></td><td class="s"> refvertexed_stringified => _REFSTR ,</td></tr>
+<tr><td class="h"><a name="213"></a>213</td><td></td><td></td><td></td><td></td><td class="s"> __stringified => _STR,</td></tr>
+<tr><td class="h"><a name="214"></a>214</td><td></td><td></td><td></td><td></td><td class="s"> );</td></tr>
+<tr><td class="h"><a name="215"></a>215</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="216"></a>216</td><td></td><td></td><td class="c3">54</td><td class="c3">859µs</td><td class="s"> _opt(\%opt, \$eflags,<div class="calls"><div class="calls_out"> # spent 859µs making 54 calls to <a href="Graph-pm-695-block.html#120">Graph::_opt</a>, avg 16µs/call</div></div></td></tr>
+<tr><td class="h"><a name="217"></a>217</td><td></td><td></td><td></td><td></td><td class="s"> countedged => _COUNT,</td></tr>
+<tr><td class="h"><a name="218"></a>218</td><td></td><td></td><td></td><td></td><td class="s"> multiedged => _MULTI,</td></tr>
+<tr><td class="h"><a name="219"></a>219</td><td></td><td></td><td></td><td></td><td class="s"> hyperedged => _HYPER,</td></tr>
+<tr><td class="h"><a name="220"></a>220</td><td></td><td></td><td></td><td></td><td class="s"> omniedged => _UNORD,</td></tr>
+<tr><td class="h"><a name="221"></a>221</td><td></td><td></td><td></td><td></td><td class="s"> uniqedged => _UNIQ,</td></tr>
+<tr><td class="h"><a name="222"></a>222</td><td></td><td></td><td></td><td></td><td class="s"> );</td></tr>
+<tr><td class="h"><a name="223"></a>223</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="224"></a>224</td><td></td><td></td><td class="c3">54</td><td class="c3">389µs</td><td class="s"> _opt(\%opt, \$gflags,<div class="calls"><div class="calls_out"> # spent 389µs making 54 calls to <a href="Graph-pm-695-block.html#120">Graph::_opt</a>, avg 7µs/call</div></div></td></tr>
+<tr><td class="h"><a name="225"></a>225</td><td></td><td></td><td></td><td></td><td class="s"> compat02 => _COMPAT02,</td></tr>
+<tr><td class="h"><a name="226"></a>226</td><td></td><td></td><td></td><td></td><td class="s"> unionfind => _UNIONFIND,</td></tr>
+<tr><td class="h"><a name="227"></a>227</td><td></td><td></td><td></td><td></td><td class="s"> );</td></tr>
+<tr><td class="h"><a name="228"></a>228</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="229"></a>229</td><td></td><td></td><td></td><td></td><td class="s"> if (exists $opt{vertices_unsorted}) { # Graph 0.20103 compat.</td></tr>
+<tr><td class="h"><a name="230"></a>230</td><td></td><td></td><td></td><td></td><td class="s"> my $unsorted = $opt{vertices_unsorted};</td></tr>
+<tr><td class="h"><a name="231"></a>231</td><td></td><td></td><td></td><td></td><td class="s"> delete $opt{vertices_unsorted};</td></tr>
+<tr><td class="h"><a name="232"></a>232</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="233"></a>233</td><td></td><td></td><td></td><td></td><td class="s"> Carp::confess("Graph: vertices_unsorted must be true")</td></tr>
+<tr><td class="h"><a name="234"></a>234</td><td></td><td></td><td></td><td></td><td class="s"> unless $unsorted;</td></tr>
+<tr><td class="h"><a name="235"></a>235</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="236"></a>236</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="237"></a>237</td><td></td><td></td><td></td><td></td><td class="s"> my @V;</td></tr>
+<tr><td class="h"><a name="238"></a>238</td><td></td><td></td><td></td><td></td><td class="s"> if ($opt{vertices}) {</td></tr>
+<tr><td class="h"><a name="239"></a>239</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="240"></a>240</td><td></td><td></td><td></td><td></td><td class="s"> Carp::confess("Graph: vertices should be an array ref")</td></tr>
+<tr><td class="h"><a name="241"></a>241</td><td></td><td></td><td></td><td></td><td class="s"> unless ref $opt{vertices} eq 'ARRAY';</td></tr>
+<tr><td class="h"><a name="242"></a>242</td><td></td><td></td><td></td><td></td><td class="s"> @V = @{ $opt{vertices} };</td></tr>
+<tr><td class="h"><a name="243"></a>243</td><td></td><td></td><td></td><td></td><td class="s"> delete $opt{vertices};</td></tr>
+<tr><td class="h"><a name="244"></a>244</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="245"></a>245</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="246"></a>246</td><td></td><td></td><td></td><td></td><td class="s"> my @E;</td></tr>
+<tr><td class="h"><a name="247"></a>247</td><td></td><td></td><td></td><td></td><td class="s"> if ($opt{edges}) {</td></tr>
+<tr><td class="h"><a name="248"></a>248</td><td></td><td></td><td></td><td></td><td class="s"> unless (ref $opt{edges} eq 'ARRAY') {</td></tr>
+<tr><td class="h"><a name="249"></a>249</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="250"></a>250</td><td></td><td></td><td></td><td></td><td class="s"> Carp::confess("Graph: edges should be an array ref of array refs");</td></tr>
+<tr><td class="h"><a name="251"></a>251</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="252"></a>252</td><td></td><td></td><td></td><td></td><td class="s"> @E = @{ $opt{edges} };</td></tr>
+<tr><td class="h"><a name="253"></a>253</td><td></td><td></td><td></td><td></td><td class="s"> delete $opt{edges};</td></tr>
+<tr><td class="h"><a name="254"></a>254</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="255"></a>255</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="256"></a>256</td><td></td><td></td><td class="c3">54</td><td class="c3">213µs</td><td class="s"> _opt_unknown(\%opt);<div class="calls"><div class="calls_out"> # spent 213µs making 54 calls to <a href="Graph-pm-695-block.html#159">Graph::_opt_unknown</a>, avg 4µs/call</div></div></td></tr>
+<tr><td class="h"><a name="257"></a>257</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="258"></a>258</td><td></td><td></td><td></td><td></td><td class="s"> my $uflags;</td></tr>
+<tr><td class="h"><a name="259"></a>259</td><td class="c0">108</td><td class="c3"><span title="Avg 327ns">35µs</span></td><td></td><td></td><td class="s"> if (defined $vflags) {</td></tr>
+<tr><td class="h"><a name="260"></a>260</td><td></td><td></td><td></td><td></td><td class="s"> $uflags = $vflags;</td></tr>
+<tr><td class="h"><a name="261"></a>261</td><td></td><td></td><td></td><td></td><td class="s"> $uflags |= _UNORD unless $vnonomni;</td></tr>
+<tr><td class="h"><a name="262"></a>262</td><td></td><td></td><td></td><td></td><td class="s"> $uflags |= _UNIQ unless $vnonuniq;</td></tr>
+<tr><td class="h"><a name="263"></a>263</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="264"></a>264</td><td></td><td></td><td></td><td></td><td class="s"> $uflags = _UNORDUNIQ;</td></tr>
+<tr><td class="h"><a name="265"></a>265</td><td></td><td></td><td></td><td></td><td class="s"> $vflags = 0;</td></tr>
+<tr><td class="h"><a name="266"></a>266</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="267"></a>267</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="268"></a>268</td><td></td><td></td><td></td><td></td><td class="s"> if (!($vflags & _HYPER) && ($vflags & _UNORDUNIQ)) {</td></tr>
+<tr><td class="h"><a name="269"></a>269</td><td></td><td></td><td></td><td></td><td class="s"> my @but;</td></tr>
+<tr><td class="h"><a name="270"></a>270</td><td></td><td></td><td></td><td></td><td class="s"> push @but, 'unordered' if ($vflags & _UNORD);</td></tr>
+<tr><td class="h"><a name="271"></a>271</td><td></td><td></td><td></td><td></td><td class="s"> push @but, 'unique' if ($vflags & _UNIQ);</td></tr>
+<tr><td class="h"><a name="272"></a>272</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="273"></a>273</td><td></td><td></td><td></td><td></td><td class="s"> Carp::confess(sprintf "Graph: not hypervertexed but %s",</td></tr>
+<tr><td class="h"><a name="274"></a>274</td><td></td><td></td><td></td><td></td><td class="s"> join(' and ', @but));</td></tr>
+<tr><td class="h"><a name="275"></a>275</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="276"></a>276</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="277"></a>277</td><td></td><td></td><td></td><td></td><td class="s"> unless (defined $eflags) {</td></tr>
+<tr><td class="h"><a name="278"></a>278</td><td></td><td></td><td></td><td></td><td class="s"> $eflags = ($gflags & _COMPAT02) ? _COUNT : 0;</td></tr>
+<tr><td class="h"><a name="279"></a>279</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="280"></a>280</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="281"></a>281</td><td></td><td></td><td></td><td></td><td class="s"> if (!($vflags & _HYPER) && ($vflags & _UNIQ)) {</td></tr>
+<tr><td class="h"><a name="282"></a>282</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="283"></a>283</td><td></td><td></td><td></td><td></td><td class="s"> Carp::confess("Graph: not hypervertexed but uniqvertexed");</td></tr>
+<tr><td class="h"><a name="284"></a>284</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="285"></a>285</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="286"></a>286</td><td></td><td></td><td></td><td></td><td class="s"> if (($vflags & _COUNT) && ($vflags & _MULTI)) {</td></tr>
+<tr><td class="h"><a name="287"></a>287</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="288"></a>288</td><td></td><td></td><td></td><td></td><td class="s"> Carp::confess("Graph: both countvertexed and multivertexed");</td></tr>
+<tr><td class="h"><a name="289"></a>289</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="290"></a>290</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="291"></a>291</td><td></td><td></td><td></td><td></td><td class="s"> if (($eflags & _COUNT) && ($eflags & _MULTI)) {</td></tr>
+<tr><td class="h"><a name="292"></a>292</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="293"></a>293</td><td></td><td></td><td></td><td></td><td class="s"> Carp::confess("Graph: both countedged and multiedged");</td></tr>
+<tr><td class="h"><a name="294"></a>294</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="295"></a>295</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="296"></a>296</td><td></td><td></td><td></td><td></td><td class="s"> my $g = bless [ ], ref $class || $class;</td></tr>
+<tr><td class="h"><a name="297"></a>297</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="298"></a>298</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _F ] = $gflags;</td></tr>
+<tr><td class="h"><a name="299"></a>299</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _G ] = 0;</td></tr>
+<tr><td class="h"><a name="300"></a>300</td><td></td><td></td><td class="c3">54</td><td class="c3">999µs</td><td class="s"> $g->[ _V ] = ($vflags & (_HYPER | _MULTI)) ?<div class="calls"><div class="calls_out"> # spent 999µs making 54 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#21">Graph::AdjacencyMap::Light::_new</a>, avg 18µs/call</div></div></td></tr>
+<tr><td class="h"><a name="301"></a>301</td><td></td><td></td><td></td><td></td><td class="s"> Graph::AdjacencyMap::Heavy->_new($uflags, 1) :</td></tr>
+<tr><td class="h"><a name="302"></a>302</td><td></td><td></td><td></td><td></td><td class="s"> (($vflags & ~_UNORD) ?</td></tr>
+<tr><td class="h"><a name="303"></a>303</td><td></td><td></td><td></td><td></td><td class="s"> Graph::AdjacencyMap::Vertex->_new($uflags, 1) :</td></tr>
+<tr><td class="h"><a name="304"></a>304</td><td></td><td></td><td></td><td></td><td class="s"> Graph::AdjacencyMap::Light->_new($g, $uflags, 1));</td></tr>
+<tr><td class="h"><a name="305"></a>305</td><td></td><td></td><td class="c3">54</td><td class="c3">526µs</td><td class="s"> $g->[ _E ] = (($vflags & _HYPER) || ($eflags & ~_UNORD)) ?<div class="calls"><div class="calls_out"> # spent 526µs making 54 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#21">Graph::AdjacencyMap::Light::_new</a>, avg 10µs/call</div></div></td></tr>
+<tr><td class="h"><a name="306"></a>306</td><td></td><td></td><td></td><td></td><td class="s"> Graph::AdjacencyMap::Heavy->_new($eflags, 2) :</td></tr>
+<tr><td class="h"><a name="307"></a>307</td><td></td><td></td><td></td><td></td><td class="s"> Graph::AdjacencyMap::Light->_new($g, $eflags, 2);</td></tr>
+<tr><td class="h"><a name="308"></a>308</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="309"></a>309</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_vertices(@V) if @V;</td></tr>
+<tr><td class="h"><a name="310"></a>310</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="311"></a>311</td><td></td><td></td><td></td><td></td><td class="s"> if (@E) {</td></tr>
+<tr><td class="h"><a name="312"></a>312</td><td></td><td></td><td></td><td></td><td class="s"> for my $e (@E) {</td></tr>
+<tr><td class="h"><a name="313"></a>313</td><td></td><td></td><td></td><td></td><td class="s"> unless (ref $e eq 'ARRAY') {</td></tr>
+<tr><td class="h"><a name="314"></a>314</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="315"></a>315</td><td></td><td></td><td></td><td></td><td class="s"> Carp::confess("Graph: edges should be array refs");</td></tr>
+<tr><td class="h"><a name="316"></a>316</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="317"></a>317</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge(@$e);</td></tr>
+<tr><td class="h"><a name="318"></a>318</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="319"></a>319</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="320"></a>320</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="321"></a>321</td><td></td><td></td><td></td><td></td><td class="s"> if (($gflags & _UNIONFIND)) {</td></tr>
+<tr><td class="h"><a name="322"></a>322</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _U ] = Graph::UnionFind->new;</td></tr>
+<tr><td class="h"><a name="323"></a>323</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="324"></a>324</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="325"></a>325</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="326"></a>326</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="327"></a>327</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="328"></a>328</td><td class="c0">51</td><td class="c0"><span title="Avg 7µs">334µs</span></td><td class="c3">51</td><td class="c3">28µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 312µs (284+28) within Graph::countvertexed which was called 51 times, avg 6µs/call:
+# 51 times (284µs+28µs) by Graph::vertices at <a href="Graph-pm-695-block.html#426">line 426</a>, avg 6µs/call</div></div>sub countvertexed { $_[0]->[ _V ]->_is_COUNT }<div class="calls"><div class="calls_out"># spent 28µs making 51 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#Graph__AdjacencyMap__Light___is_COUNT">Graph::AdjacencyMap::Light::_is_COUNT</a>, avg 549ns/call</div></div></td></tr>
+<tr><td class="h"><a name="329"></a>329</td><td class="c0">56877</td><td class="c0"><span title="Avg 4µs">220ms</span></td><td class="c0">56877</td><td class="c0">29.6ms</td><td class="s"><div class="calls"><div class="calls_in"># spent 192ms (163+29.6) within Graph::multivertexed which was called 56877 times, avg 3µs/call:
+# 56826 times (162ms+29.5ms) by Graph::add_vertex at <a href="Graph-pm-695-block.html#372">line 372</a>, avg 3µs/call
+# 51 times (313µs+46µs) by Graph::vertices at <a href="Graph-pm-695-block.html#426">line 426</a>, avg 7µs/call</div></div>sub multivertexed { $_[0]->[ _V ]->_is_MULTI }<div class="calls"><div class="calls_out"># spent 29.6ms making 56877 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#Graph__AdjacencyMap__Light___is_MULTI">Graph::AdjacencyMap::Light::_is_MULTI</a>, avg 520ns/call</div></div></td></tr>
+<tr><td class="h"><a name="330"></a>330</td><td></td><td></td><td></td><td></td><td class="s">sub hypervertexed { $_[0]->[ _V ]->_is_HYPER }</td></tr>
+<tr><td class="h"><a name="331"></a>331</td><td></td><td></td><td></td><td></td><td class="s">sub omnivertexed { $_[0]->[ _V ]->_is_UNORD }</td></tr>
+<tr><td class="h"><a name="332"></a>332</td><td></td><td></td><td></td><td></td><td class="s">sub uniqvertexed { $_[0]->[ _V ]->_is_UNIQ }</td></tr>
+<tr><td class="h"><a name="333"></a>333</td><td></td><td></td><td></td><td></td><td class="s">sub refvertexed { $_[0]->[ _V ]->_is_REF }</td></tr>
+<tr><td class="h"><a name="334"></a>334</td><td></td><td></td><td></td><td></td><td class="s">sub refvertexed_stringified { $_[0]->[ _V ]->_is_REFSTR }</td></tr>
+<tr><td class="h"><a name="335"></a>335</td><td></td><td></td><td></td><td></td><td class="s">sub __stringified { $_[0]->[ _V ]->_is_STR }</td></tr>
+<tr><td class="h"><a name="336"></a>336</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="337"></a>337</td><td class="c0">56</td><td class="c0"><span title="Avg 5µs">306µs</span></td><td class="c3">56</td><td class="c3">31µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 296µs (265+31) within Graph::countedged which was called 56 times, avg 5µs/call:
+# 51 times (232µs+27µs) by Graph::Traversal::configure at <a href="Graph-Traversal-pm-713-block.html#77">line 77 of Graph/Traversal.pm</a>, avg 5µs/call
+# 5 times (33µs+4µs) by Graph::edges at <a href="Graph-pm-695-block.html#596">line 596</a>, avg 7µs/call</div></div>sub countedged { $_[0]->[ _E ]->_is_COUNT }<div class="calls"><div class="calls_out"># spent 29µs making 55 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#Graph__AdjacencyMap__Light___is_COUNT">Graph::AdjacencyMap::Light::_is_COUNT</a>, avg 524ns/call
+# spent 2µs making 1 call to <a href="Graph-AdjacencyMap-pm-696-block.html#361">Graph::AdjacencyMap::_is_COUNT</a></div></div></td></tr>
+<tr><td class="h"><a name="338"></a>338</td><td class="c0">97458</td><td class="c0"><span title="Avg 4µs">341ms</span></td><td class="c0">97458</td><td class="c0">77.6ms</td><td class="s"><div class="calls"><div class="calls_in"># spent 382ms (304+77.6) within Graph::multiedged which was called 97458 times, avg 4µs/call:
+# 55803 times (172ms+30.9ms) by Graph::add_edge at <a href="Graph-pm-695-block.html#490">line 490</a>, avg 4µs/call
+# 41599 times (132ms+46.7ms) by Graph::expect_non_multiedged at <a href="Graph-pm-695-block.html#2115">line 2115</a>, avg 4µs/call
+# 51 times (264µs+38µs) by Graph::Traversal::configure at <a href="Graph-Traversal-pm-713-block.html#77">line 77 of Graph/Traversal.pm</a>, avg 6µs/call
+# 5 times (19µs+5µs) by Graph::edges at <a href="Graph-pm-695-block.html#596">line 596</a>, avg 5µs/call</div></div>sub multiedged { $_[0]->[ _E ]->_is_MULTI }<div class="calls"><div class="calls_out"># spent 48.1ms making 42844 calls to <a href="Graph-AdjacencyMap-pm-696-block.html#362">Graph::AdjacencyMap::_is_MULTI</a>, avg 1µs/call
+# spent 29.6ms making 54614 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#Graph__AdjacencyMap__Light___is_MULTI">Graph::AdjacencyMap::Light::_is_MULTI</a>, avg 542ns/call</div></div></td></tr>
+<tr><td class="h"><a name="339"></a>339</td><td></td><td></td><td></td><td></td><td class="s">sub hyperedged { $_[0]->[ _E ]->_is_HYPER }</td></tr>
+<tr><td class="h"><a name="340"></a>340</td><td class="c0">12766</td><td class="c0"><span title="Avg 3µs">44.6ms</span></td><td class="c0">12766</td><td class="c0">16.3ms</td><td class="s"><div class="calls"><div class="calls_in"># spent 69.8ms (53.4+16.3) within Graph::omniedged which was called 12766 times, avg 5µs/call:
+# 12613 times (52.6ms+16.0ms) by Graph::_edges at <a href="Graph-pm-695-block.html#816">line 816</a>, avg 5µs/call
+# 102 times (565µs+236µs) by Graph::stringify at <a href="Graph-pm-695-block.html#92">line 92</a>, avg 8µs/call
+# 51 times (315µs+116µs) by Graph::has_a_cycle at <a href="Graph-pm-695-block.html#1264">line 1264</a>, avg 8µs/call</div></div>sub omniedged { $_[0]->[ _E ]->_is_UNORD }<div class="calls"><div class="calls_out"># spent 16.3ms making 12766 calls to <a href="Graph-AdjacencyMap-pm-696-block.html#364">Graph::AdjacencyMap::_is_UNORD</a>, avg 1µs/call</div></div></td></tr>
+<tr><td class="h"><a name="341"></a>341</td><td></td><td></td><td></td><td></td><td class="s">sub uniqedged { $_[0]->[ _E ]->_is_UNIQ }</td></tr>
+<tr><td class="h"><a name="342"></a>342</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="343"></a>343</td><td class="c3">1</td><td class="c3"><span title="Avg 2µs">2µs</span></td><td></td><td></td><td class="s">*undirected = \&omniedged;</td></tr>
+<tr><td class="h"><a name="344"></a>344</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*omnidirected = \&omniedged;</td></tr>
+<tr><td class="h"><a name="345"></a>345</td><td class="c0">51</td><td class="c0"><span title="Avg 7µs">345µs</span></td><td class="c3">51</td><td class="c3">137µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 678µs (541+137) within Graph::directed which was called 51 times, avg 13µs/call:
+# 51 times (541µs+137µs) by Graph::Traversal::reset at <a href="Graph-Traversal-pm-713-block.html#19">line 19 of Graph/Traversal.pm</a>, avg 13µs/call</div></div>sub directed { ! $_[0]->[ _E ]->_is_UNORD }<div class="calls"><div class="calls_out"># spent 137µs making 51 calls to <a href="Graph-AdjacencyMap-pm-696-block.html#364">Graph::AdjacencyMap::_is_UNORD</a>, avg 3µs/call</div></div></td></tr>
+<tr><td class="h"><a name="346"></a>346</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="347"></a>347</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*is_directed = \&directed;</td></tr>
+<tr><td class="h"><a name="348"></a>348</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*is_undirected = \&undirected;</td></tr>
+<tr><td class="h"><a name="349"></a>349</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="350"></a>350</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*is_countvertexed = \&countvertexed;</td></tr>
+<tr><td class="h"><a name="351"></a>351</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*is_multivertexed = \&multivertexed;</td></tr>
+<tr><td class="h"><a name="352"></a>352</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*is_hypervertexed = \&hypervertexed;</td></tr>
+<tr><td class="h"><a name="353"></a>353</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*is_omnidirected = \&omnidirected;</td></tr>
+<tr><td class="h"><a name="354"></a>354</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*is_uniqvertexed = \&uniqvertexed;</td></tr>
+<tr><td class="h"><a name="355"></a>355</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*is_refvertexed = \&refvertexed;</td></tr>
+<tr><td class="h"><a name="356"></a>356</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*is_refvertexed_stringified = \&refvertexed_stringified;</td></tr>
+<tr><td class="h"><a name="357"></a>357</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="358"></a>358</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*is_countedged = \&countedged;</td></tr>
+<tr><td class="h"><a name="359"></a>359</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*is_multiedged = \&multiedged;</td></tr>
+<tr><td class="h"><a name="360"></a>360</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*is_hyperedged = \&hyperedged;</td></tr>
+<tr><td class="h"><a name="361"></a>361</td><td class="c3">1</td><td class="c3"><span title="Avg 900ns">900ns</span></td><td></td><td></td><td class="s">*is_omniedged = \&omniedged;</td></tr>
+<tr><td class="h"><a name="362"></a>362</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*is_uniqedged = \&uniqedged;</td></tr>
+<tr><td class="h"><a name="363"></a>363</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="364"></a>364</td><td></td><td></td><td></td><td></td><td class="s">sub _union_find_add_vertex {</td></tr>
+<tr><td class="h"><a name="365"></a>365</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $v) = @_;</td></tr>
+<tr><td class="h"><a name="366"></a>366</td><td></td><td></td><td></td><td></td><td class="s"> my $UF = $g->[ _U ];</td></tr>
+<tr><td class="h"><a name="367"></a>367</td><td></td><td></td><td></td><td></td><td class="s"> $UF->add( $g->[ _V ]->_get_path_id( $v ) );</td></tr>
+<tr><td class="h"><a name="368"></a>368</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="369"></a>369</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="370"></a>370</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 1.21s (592ms+613ms) within Graph::add_vertex which was called 56826 times, avg 21µs/call:
+# 53490 times (560ms+578ms) by Graph::_add_edge at <a href="Graph-pm-695-block.html#469">line 469</a>, avg 21µs/call
+# 1095 times (10.8ms+11.9ms) by Text::Tradition::Collation::add_reading at <a href="lib-Text-Tradition-Collation-pm-686-block.html#298">line 298 of lib/Text/Tradition/Collation.pm</a>, avg 21µs/call
+# 1095 times (10.7ms+11.0ms) by Text::Tradition::Collation::RelationshipStore::add_reading at <a href="Moose-Meta-Method-Delegation-pm-169-block.html#110">line 110 of Moose/Meta/Method/Delegation.pm</a>, avg 20µs/call
+# 1095 times (10.4ms+10.9ms) by Class::MOP::Class:::around at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#126">line 126 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 19µs/call
+# 51 times (895µs+1.07ms) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#885">line 885 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 38µs/call</div></div>sub add_vertex {</td></tr>
+<tr><td class="h"><a name="371"></a>371</td><td class="c0">511434</td><td class="c0"><span title="Avg 748ns">382ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="372"></a>372</td><td></td><td></td><td class="c0">56826</td><td class="c0">192ms</td><td class="s"> if ($g->is_multivertexed) {<div class="calls"><div class="calls_out"> # spent 192ms making 56826 calls to <a href="Graph-pm-695-block.html#329">Graph::multivertexed</a>, avg 3µs/call</div></div></td></tr>
+<tr><td class="h"><a name="373"></a>373</td><td></td><td></td><td></td><td></td><td class="s"> return $g->add_vertex_by_id(@_, _GEN_ID);</td></tr>
+<tr><td class="h"><a name="374"></a>374</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="375"></a>375</td><td></td><td></td><td></td><td></td><td class="s"> my @r;</td></tr>
+<tr><td class="h"><a name="376"></a>376</td><td></td><td></td><td></td><td></td><td class="s"> if (@_ > 1) {</td></tr>
+<tr><td class="h"><a name="377"></a>377</td><td></td><td></td><td></td><td></td><td class="s"> unless ($g->is_countvertexed || $g->is_hypervertexed) {</td></tr>
+<tr><td class="h"><a name="378"></a>378</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="379"></a>379</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("Graph::add_vertex: use add_vertices for more than one vertex or use hypervertexed");</td></tr>
+<tr><td class="h"><a name="380"></a>380</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="381"></a>381</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ( @_ ) {</td></tr>
+<tr><td class="h"><a name="382"></a>382</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $v) {</td></tr>
+<tr><td class="h"><a name="383"></a>383</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->set_path( $v ) unless $g->has_vertex( $v );</td></tr>
+<tr><td class="h"><a name="384"></a>384</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="385"></a>385</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="386"></a>386</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("Graph::add_vertex: undef vertex");</td></tr>
+<tr><td class="h"><a name="387"></a>387</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="388"></a>388</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="389"></a>389</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="390"></a>390</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ( @_ ) {</td></tr>
+<tr><td class="h"><a name="391"></a>391</td><td class="c0">56826</td><td class="c0"><span title="Avg 776ns">44.1ms</span></td><td></td><td></td><td class="s"> unless (defined $v) {</td></tr>
+<tr><td class="h"><a name="392"></a>392</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="393"></a>393</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("Graph::add_vertex: undef vertex");</td></tr>
+<tr><td class="h"><a name="394"></a>394</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="395"></a>395</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="396"></a>396</td><td></td><td></td><td class="c0">56826</td><td class="c0">326ms</td><td class="s"> $g->[ _V ]->set_path( @_ );<div class="calls"><div class="calls_out"> # spent 326ms making 56826 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#35">Graph::AdjacencyMap::Light::set_path</a>, avg 6µs/call</div></div></td></tr>
+<tr><td class="h"><a name="397"></a>397</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _G ]++;</td></tr>
+<tr><td class="h"><a name="398"></a>398</td><td></td><td></td><td class="c0">56826</td><td class="c0">94.9ms</td><td class="s"> $g->_union_find_add_vertex( @_ ) if $g->has_union_find;<div class="calls"><div class="calls_out"> # spent 94.9ms making 56826 calls to <a href="Graph-pm-695-block.html#141">Graph::has_union_find</a>, avg 2µs/call</div></div></td></tr>
+<tr><td class="h"><a name="399"></a>399</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="400"></a>400</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="401"></a>401</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="402"></a>402</td><td></td><td></td><td></td><td></td><td class="s">sub has_vertex {</td></tr>
+<tr><td class="h"><a name="403"></a>403</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="404"></a>404</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="405"></a>405</td><td></td><td></td><td></td><td></td><td class="s"> return exists $V->[ _s ]->{ $_[0] } if ($V->[ _f ] & _LIGHT);</td></tr>
+<tr><td class="h"><a name="406"></a>406</td><td></td><td></td><td></td><td></td><td class="s"> $V->has_path( @_ );</td></tr>
+<tr><td class="h"><a name="407"></a>407</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="408"></a>408</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="409"></a>409</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 271ms (139+132) within Graph::vertices05 which was called 153 times, avg 1.77ms/call:
+# 102 times (90.1ms+87.2ms) by Graph::isolated_vertices at <a href="Graph-pm-695-block.html#1189">line 1189</a>, avg 1.74ms/call
+# 51 times (48.8ms+44.5ms) by Graph::vertices at <a href="Graph-pm-695-block.html#422">line 422</a>, avg 1.83ms/call</div></div>sub vertices05 {</td></tr>
+<tr><td class="h"><a name="410"></a>410</td><td class="c0">459</td><td class="c0"><span title="Avg 303µs">139ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="411"></a>411</td><td></td><td></td><td class="c1">153</td><td class="c0">131ms</td><td class="s"> my @v = $g->[ _V ]->paths( @_ );<div class="calls"><div class="calls_out"> # spent 131ms making 153 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#109">Graph::AdjacencyMap::Light::paths</a>, avg 859µs/call</div></div></td></tr>
+<tr><td class="h"><a name="412"></a>412</td><td></td><td></td><td class="c1">153</td><td class="c3">341µs</td><td class="s"> if (wantarray) {<div class="calls"><div class="calls_out"> # spent 341µs making 153 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#Graph__AdjacencyMap__Light___is_HYPER">Graph::AdjacencyMap::Light::_is_HYPER</a>, avg 2µs/call</div></div></td></tr>
+<tr><td class="h"><a name="413"></a>413</td><td></td><td></td><td></td><td></td><td class="s"> return $g->[ _V ]->_is_HYPER ?</td></tr>
+<tr><td class="h"><a name="414"></a>414</td><td></td><td></td><td></td><td></td><td class="s"> @v : map { ref $_ eq 'ARRAY' ? @$_ : $_ } @v;</td></tr>
+<tr><td class="h"><a name="415"></a>415</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="416"></a>416</td><td></td><td></td><td></td><td></td><td class="s"> return scalar @v;</td></tr>
+<tr><td class="h"><a name="417"></a>417</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="418"></a>418</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="419"></a>419</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="420"></a>420</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 119ms (24.3+94.3) within Graph::vertices which was called 51 times, avg 2.32ms/call:
+# 51 times (24.3ms+94.3ms) by Graph::Traversal::reset at <a href="Graph-Traversal-pm-713-block.html#12">line 12 of Graph/Traversal.pm</a>, avg 2.32ms/call</div></div>sub vertices {</td></tr>
+<tr><td class="h"><a name="421"></a>421</td><td class="c0">153</td><td class="c0"><span title="Avg 45µs">6.82ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="422"></a>422</td><td></td><td></td><td class="c3">51</td><td class="c0">93.3ms</td><td class="s"> my @v = $g->vertices05;<div class="calls"><div class="calls_out"> # spent 93.3ms making 51 calls to <a href="Graph-pm-695-block.html#409">Graph::vertices05</a>, avg 1.83ms/call</div></div></td></tr>
+<tr><td class="h"><a name="423"></a>423</td><td class="c0">51</td><td class="c0"><span title="Avg 6µs">295µs</span></td><td class="c3">51</td><td class="c3">286µs</td><td class="s"> if ($g->is_compat02) {<div class="calls"><div class="calls_out"> # spent 286µs making 51 calls to <a href="Graph-pm-695-block.html#134">Graph::is_compat02</a>, avg 6µs/call</div></div></td></tr>
+<tr><td class="h"><a name="424"></a>424</td><td></td><td></td><td></td><td></td><td class="s"> wantarray ? sort @v : scalar @v;</td></tr>
+<tr><td class="h"><a name="425"></a>425</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="426"></a>426</td><td class="c0">51</td><td class="c0"><span title="Avg 333µs">17.0ms</span></td><td class="c2">102</td><td class="c3">671µs</td><td class="s"> if ($g->is_multivertexed || $g->is_countvertexed) {<div class="calls"><div class="calls_out"> # spent 358µs making 51 calls to <a href="Graph-pm-695-block.html#329">Graph::multivertexed</a>, avg 7µs/call
+ # spent 312µs making 51 calls to <a href="Graph-pm-695-block.html#328">Graph::countvertexed</a>, avg 6µs/call</div></div></td></tr>
+<tr><td class="h"><a name="427"></a>427</td><td></td><td></td><td></td><td></td><td class="s"> if (wantarray) {</td></tr>
+<tr><td class="h"><a name="428"></a>428</td><td></td><td></td><td></td><td></td><td class="s"> my @V;</td></tr>
+<tr><td class="h"><a name="429"></a>429</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ( @v ) {</td></tr>
+<tr><td class="h"><a name="430"></a>430</td><td></td><td></td><td></td><td></td><td class="s"> push @V, ($v) x $g->get_vertex_count($v);</td></tr>
+<tr><td class="h"><a name="431"></a>431</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="432"></a>432</td><td></td><td></td><td></td><td></td><td class="s"> return @V;</td></tr>
+<tr><td class="h"><a name="433"></a>433</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="434"></a>434</td><td></td><td></td><td></td><td></td><td class="s"> my $V = 0;</td></tr>
+<tr><td class="h"><a name="435"></a>435</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ( @v ) {</td></tr>
+<tr><td class="h"><a name="436"></a>436</td><td></td><td></td><td></td><td></td><td class="s"> $V += $g->get_vertex_count($v);</td></tr>
+<tr><td class="h"><a name="437"></a>437</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="438"></a>438</td><td></td><td></td><td></td><td></td><td class="s"> return $V;</td></tr>
+<tr><td class="h"><a name="439"></a>439</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="440"></a>440</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="441"></a>441</td><td></td><td></td><td></td><td></td><td class="s"> return @v;</td></tr>
+<tr><td class="h"><a name="442"></a>442</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="443"></a>443</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="444"></a>444</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="445"></a>445</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="446"></a>446</td><td class="c3">1</td><td class="c3"><span title="Avg 7µs">7µs</span></td><td></td><td></td><td class="s">*vertices_unsorted = \&vertices_unsorted; # Graph 0.20103 compat.</td></tr>
+<tr><td class="h"><a name="447"></a>447</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="448"></a>448</td><td></td><td></td><td></td><td></td><td class="s">sub unique_vertices {</td></tr>
+<tr><td class="h"><a name="449"></a>449</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="450"></a>450</td><td></td><td></td><td></td><td></td><td class="s"> my @v = $g->vertices05;</td></tr>
+<tr><td class="h"><a name="451"></a>451</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->is_compat02) {</td></tr>
+<tr><td class="h"><a name="452"></a>452</td><td></td><td></td><td></td><td></td><td class="s"> wantarray ? sort @v : scalar @v;</td></tr>
+<tr><td class="h"><a name="453"></a>453</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="454"></a>454</td><td></td><td></td><td></td><td></td><td class="s"> return @v;</td></tr>
+<tr><td class="h"><a name="455"></a>455</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="456"></a>456</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="457"></a>457</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="458"></a>458</td><td></td><td></td><td></td><td></td><td class="s">sub has_vertices {</td></tr>
+<tr><td class="h"><a name="459"></a>459</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="460"></a>460</td><td></td><td></td><td></td><td></td><td class="s"> scalar $g->[ _V ]->has_paths( @_ );</td></tr>
+<tr><td class="h"><a name="461"></a>461</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="462"></a>462</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="463"></a>463</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 1.67s (535ms+1.14) within Graph::_add_edge which was called 55803 times, avg 30µs/call:
+# 55803 times (535ms+1.14s) by Graph::add_edge at <a href="Graph-pm-695-block.html#503">line 503</a>, avg 30µs/call</div></div>sub _add_edge {</td></tr>
+<tr><td class="h"><a name="464"></a>464</td><td class="c0">279015</td><td class="c0"><span title="Avg 633ns">177ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="465"></a>465</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="466"></a>466</td><td></td><td></td><td></td><td></td><td class="s"> my @e;</td></tr>
+<tr><td class="h"><a name="467"></a>467</td><td class="c0">55803</td><td class="c0"><span title="Avg 458ns">25.5ms</span></td><td></td><td></td><td class="s"> if (($V->[ _f ]) & _LIGHT) {</td></tr>
+<tr><td class="h"><a name="468"></a>468</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ( @_ ) {</td></tr>
+<tr><td class="h"><a name="469"></a>469</td><td class="c0">223212</td><td class="c0"><span title="Avg 1µs">258ms</span></td><td class="c0">53490</td><td class="c0">1.14s</td><td class="s"> $g->add_vertex( $v ) unless exists $V->[ _s ]->{ $v };<div class="calls"><div class="calls_out"> # spent 1.14s making 53490 calls to <a href="Graph-pm-695-block.html#370">Graph::add_vertex</a>, avg 21µs/call</div></div></td></tr>
+<tr><td class="h"><a name="470"></a>470</td><td></td><td></td><td></td><td></td><td class="s"> push @e, $V->[ _s ]->{ $v };</td></tr>
+<tr><td class="h"><a name="471"></a>471</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="472"></a>472</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="473"></a>473</td><td></td><td></td><td></td><td></td><td class="s"> my $h = $g->[ _V ]->_is_HYPER;</td></tr>
+<tr><td class="h"><a name="474"></a>474</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ( @_ ) {</td></tr>
+<tr><td class="h"><a name="475"></a>475</td><td></td><td></td><td></td><td></td><td class="s"> my @v = ref $v eq 'ARRAY' && $h ? @$v : $v;</td></tr>
+<tr><td class="h"><a name="476"></a>476</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_vertex( @v ) unless $V->has_path( @v );</td></tr>
+<tr><td class="h"><a name="477"></a>477</td><td></td><td></td><td></td><td></td><td class="s"> push @e, $V->_get_path_id( @v );</td></tr>
+<tr><td class="h"><a name="478"></a>478</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="479"></a>479</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="480"></a>480</td><td></td><td></td><td></td><td></td><td class="s"> return @e;</td></tr>
+<tr><td class="h"><a name="481"></a>481</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="482"></a>482</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="483"></a>483</td><td></td><td></td><td></td><td></td><td class="s">sub _union_find_add_edge {</td></tr>
+<tr><td class="h"><a name="484"></a>484</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $u, $v) = @_;</td></tr>
+<tr><td class="h"><a name="485"></a>485</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _U ]->union($u, $v);</td></tr>
+<tr><td class="h"><a name="486"></a>486</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="487"></a>487</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="488"></a>488</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 3.07s (630ms+2.44) within Graph::add_edge which was called 55803 times, avg 55µs/call:
+# 53130 times (598ms+2.35s) by Graph::Traversal::next at <a href="Graph-Traversal-pm-713-block.html#301">line 301 of Graph/Traversal.pm</a>, avg 55µs/call
+# 1190 times (14.7ms+56.8ms) by Text::Tradition::Collation::add_path at <a href="lib-Text-Tradition-Collation-pm-686-block.html#435">line 435 of lib/Text/Tradition/Collation.pm</a>, avg 60µs/call
+# 1190 times (13.7ms+27.3ms) by Text::Tradition::Collation::RelationshipStore::add_equivalence_edge at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#786">line 786 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 34µs/call
+# 59 times (1.06ms+4.29ms) by Text::Tradition::Collation::RelationshipStore::_set_relationship at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#165">line 165 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 91µs/call
+# 59 times (661µs+1.06ms) by Text::Tradition::Collation::RelationshipStore::_make_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#832">line 832 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 29µs/call
+# 57 times (791µs+1.31ms) by Text::Tradition::Collation::RelationshipStore::_make_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#829">line 829 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 37µs/call
+# 54 times (592µs+1.05ms) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#891">line 891 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 30µs/call
+# 52 times (786µs+1.43ms) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#887">line 887 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 43µs/call
+# 7 times (109µs+205µs) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#876">line 876 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 45µs/call
+# 3 times (49µs+92µs) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#868">line 868 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 47µs/call
+# 2 times (23µs+133µs) by Graph::add_edges at <a href="Graph-pm-695-block.html#1678">line 1678</a>, avg 78µs/call</div></div>sub add_edge {</td></tr>
+<tr><td class="h"><a name="489"></a>489</td><td class="c0">446424</td><td class="c0"><span title="Avg 963ns">430ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="490"></a>490</td><td></td><td></td><td class="c0">55803</td><td class="c0">203ms</td><td class="s"> if ($g->is_multiedged) {<div class="calls"><div class="calls_out"> # spent 203ms making 55803 calls to <a href="Graph-pm-695-block.html#338">Graph::multiedged</a>, avg 4µs/call</div></div></td></tr>
+<tr><td class="h"><a name="491"></a>491</td><td></td><td></td><td></td><td></td><td class="s"> unless (@_ == 2 || $g->is_hyperedged) {</td></tr>
+<tr><td class="h"><a name="492"></a>492</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="493"></a>493</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("Graph::add_edge: use add_edges for more than one edge");</td></tr>
+<tr><td class="h"><a name="494"></a>494</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="495"></a>495</td><td></td><td></td><td></td><td></td><td class="s"> return $g->add_edge_by_id(@_, _GEN_ID);</td></tr>
+<tr><td class="h"><a name="496"></a>496</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="497"></a>497</td><td></td><td></td><td></td><td></td><td class="s"> unless (@_ == 2) {</td></tr>
+<tr><td class="h"><a name="498"></a>498</td><td></td><td></td><td></td><td></td><td class="s"> unless ($g->is_hyperedged) {</td></tr>
+<tr><td class="h"><a name="499"></a>499</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="500"></a>500</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("Graph::add_edge: graph is not hyperedged");</td></tr>
+<tr><td class="h"><a name="501"></a>501</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="502"></a>502</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="503"></a>503</td><td></td><td></td><td class="c0">55803</td><td class="c0">1.67s</td><td class="s"> my @e = $g->_add_edge( @_ );<div class="calls"><div class="calls_out"> # spent 1.67s making 55803 calls to <a href="Graph-pm-695-block.html#463">Graph::_add_edge</a>, avg 30µs/call</div></div></td></tr>
+<tr><td class="h"><a name="504"></a>504</td><td></td><td></td><td class="c0">55803</td><td class="c0">477ms</td><td class="s"> $g->[ _E ]->set_path( @e );<div class="calls"><div class="calls_out"> # spent 434ms making 54554 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#35">Graph::AdjacencyMap::Light::set_path</a>, avg 8µs/call
+ # spent 43.2ms making 1249 calls to <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#60">Graph::AdjacencyMap::Heavy::set_path</a>, avg 35µs/call</div></div></td></tr>
+<tr><td class="h"><a name="505"></a>505</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _G ]++;</td></tr>
+<tr><td class="h"><a name="506"></a>506</td><td></td><td></td><td class="c0">55803</td><td class="c0">91.8ms</td><td class="s"> $g->_union_find_add_edge( @e ) if $g->has_union_find;<div class="calls"><div class="calls_out"> # spent 91.8ms making 55803 calls to <a href="Graph-pm-695-block.html#141">Graph::has_union_find</a>, avg 2µs/call</div></div></td></tr>
+<tr><td class="h"><a name="507"></a>507</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="508"></a>508</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="509"></a>509</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="510"></a>510</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 301ms within Graph::_vertex_ids which was called 41450 times, avg 7µs/call:
+# 15571 times (115ms+0s) by Graph::get_edge_attributes at <a href="Graph-pm-695-block.html#1535">line 1535</a>, avg 7µs/call
+# 13196 times (96.6ms+0s) by Graph::has_edge_attribute at <a href="Graph-pm-695-block.html#1519">line 1519</a>, avg 7µs/call
+# 12664 times (89.4ms+0s) by Graph::set_edge_attribute at <a href="Graph-pm-695-block.html#1469">line 1469</a>, avg 7µs/call
+# 10 times (90µs+0s) by Graph::delete_edge at <a href="Graph-pm-695-block.html#980">line 980</a>, avg 9µs/call
+# 9 times (62µs+0s) by Graph::get_edge_attribute at <a href="Graph-pm-695-block.html#1568">line 1568</a>, avg 7µs/call</div></div>sub _vertex_ids {</td></tr>
+<tr><td class="h"><a name="511"></a>511</td><td class="c0">207250</td><td class="c0"><span title="Avg 646ns">134ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="512"></a>512</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="513"></a>513</td><td></td><td></td><td></td><td></td><td class="s"> my @e;</td></tr>
+<tr><td class="h"><a name="514"></a>514</td><td class="c0">41450</td><td class="c0"><span title="Avg 547ns">22.7ms</span></td><td></td><td></td><td class="s"> if (($V->[ _f ] & _LIGHT)) {</td></tr>
+<tr><td class="h"><a name="515"></a>515</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ( @_ ) {</td></tr>
+<tr><td class="h"><a name="516"></a>516</td><td class="c0">165800</td><td class="c0"><span title="Avg 768ns">127ms</span></td><td></td><td></td><td class="s"> return () unless exists $V->[ _s ]->{ $v };</td></tr>
+<tr><td class="h"><a name="517"></a>517</td><td></td><td></td><td></td><td></td><td class="s"> push @e, $V->[ _s ]->{ $v };</td></tr>
+<tr><td class="h"><a name="518"></a>518</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="519"></a>519</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="520"></a>520</td><td></td><td></td><td></td><td></td><td class="s"> my $h = $g->[ _V ]->_is_HYPER;</td></tr>
+<tr><td class="h"><a name="521"></a>521</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ( @_ ) {</td></tr>
+<tr><td class="h"><a name="522"></a>522</td><td></td><td></td><td></td><td></td><td class="s"> my @v = ref $v eq 'ARRAY' && $h ? @$v : $v;</td></tr>
+<tr><td class="h"><a name="523"></a>523</td><td></td><td></td><td></td><td></td><td class="s"> return () unless $V->has_path( @v );</td></tr>
+<tr><td class="h"><a name="524"></a>524</td><td></td><td></td><td></td><td></td><td class="s"> push @e, $V->_get_path_id( @v );</td></tr>
+<tr><td class="h"><a name="525"></a>525</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="526"></a>526</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="527"></a>527</td><td></td><td></td><td></td><td></td><td class="s"> return @e;</td></tr>
+<tr><td class="h"><a name="528"></a>528</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="529"></a>529</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="530"></a>530</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 933ms (932+482µs) within Graph::has_edge which was called 110001 times, avg 8µs/call:
+# 55691 times (471ms+0s) by Graph::Traversal::_callbacks at <a href="Graph-Traversal-pm-713-block.html#247">line 247 of Graph/Traversal.pm</a>, avg 8µs/call
+# 15571 times (130ms+0s) by Graph::get_edge_attributes at <a href="Graph-pm-695-block.html#1534">line 1534</a>, avg 8µs/call
+# 13355 times (131ms+402µs) by Graph::has_edge_attribute at <a href="Graph-pm-695-block.html#1518">line 1518</a>, avg 10µs/call
+# 12664 times (97.0ms+72µs) by Graph::set_edge_attribute at <a href="Graph-pm-695-block.html#1468">line 1468</a>, avg 8µs/call
+# 12605 times (102ms+0s) by Text::Tradition::Collation::add_path at <a href="lib-Text-Tradition-Collation-pm-686-block.html#434">line 434 of lib/Text/Tradition/Collation.pm</a>, avg 8µs/call
+# 54 times (470µs+0s) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#873">line 873 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 9µs/call
+# 52 times (831µs+0s) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#865">line 865 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 16µs/call
+# 9 times (91µs+9µs) by Graph::get_edge_attribute at <a href="Graph-pm-695-block.html#1567">line 1567</a>, avg 11µs/call</div></div>sub has_edge {</td></tr>
+<tr><td class="h"><a name="531"></a>531</td><td class="c0">769851</td><td class="c0"><span title="Avg 267ns">205ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="532"></a>532</td><td></td><td></td><td></td><td></td><td class="s"> my $E = $g->[ _E ];</td></tr>
+<tr><td class="h"><a name="533"></a>533</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="534"></a>534</td><td></td><td></td><td></td><td></td><td class="s"> my @i;</td></tr>
+<tr><td class="h"><a name="535"></a>535</td><td class="c0">219924</td><td class="c0"><span title="Avg 1µs">295ms</span></td><td></td><td></td><td class="s"> if (($V->[ _f ] & _LIGHT) && @_ == 2) {</td></tr>
+<tr><td class="h"><a name="536"></a>536</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless</td></tr>
+<tr><td class="h"><a name="537"></a>537</td><td></td><td></td><td></td><td></td><td class="s"> exists $V->[ _s ]->{ $_[0] } &&</td></tr>
+<tr><td class="h"><a name="538"></a>538</td><td></td><td></td><td></td><td></td><td class="s"> exists $V->[ _s ]->{ $_[1] };</td></tr>
+<tr><td class="h"><a name="539"></a>539</td><td></td><td></td><td></td><td></td><td class="s"> @i = @{ $V->[ _s ] }{ @_[ 0, 1 ] };</td></tr>
+<tr><td class="h"><a name="540"></a>540</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="541"></a>541</td><td></td><td></td><td></td><td></td><td class="s"> @i = $g->_vertex_ids( @_ );</td></tr>
+<tr><td class="h"><a name="542"></a>542</td><td></td><td></td><td></td><td></td><td class="s"> return 0 if @i == 0 && @_;</td></tr>
+<tr><td class="h"><a name="543"></a>543</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="544"></a>544</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $E->[ _f ];</td></tr>
+<tr><td class="h"><a name="545"></a>545</td><td class="c0">219846</td><td class="c0"><span title="Avg 2µs">415ms</span></td><td></td><td></td><td class="s"> if ($E->[ _a ] == 2 && @i == 2 && !($f & (_HYPER|_REF|_UNIQ))) { # Fast path.</td></tr>
+<tr><td class="h"><a name="546"></a>546</td><td></td><td></td><td class="c0">236</td><td class="c3">482µs</td><td class="s"> @i = sort @i if ($f & _UNORD);<div class="calls"><div class="calls_out"> # spent 482µs making 236 calls to <a href="Graph-pm-695-block.html#Graph__CORE_sort">Graph::CORE:sort</a>, avg 2µs/call</div></div></td></tr>
+<tr><td class="h"><a name="547"></a>547</td><td></td><td></td><td></td><td></td><td class="s"> return exists $E->[ _s ]->{ $i[0] } &&</td></tr>
+<tr><td class="h"><a name="548"></a>548</td><td></td><td></td><td></td><td></td><td class="s"> exists $E->[ _s ]->{ $i[0] }->{ $i[1] } ? 1 : 0;</td></tr>
+<tr><td class="h"><a name="549"></a>549</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="550"></a>550</td><td></td><td></td><td></td><td></td><td class="s"> return defined $E->_get_path_id( @i ) ? 1 : 0;</td></tr>
+<tr><td class="h"><a name="551"></a>551</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="552"></a>552</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="553"></a>553</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="554"></a>554</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 1.81s (1.14+672ms) within Graph::edges05 which was called 107 times, avg 16.9ms/call:
+# 102 times (1.12s+664ms) by Graph::stringify at <a href="Graph-pm-695-block.html#96">line 96</a>, avg 17.5ms/call
+# 5 times (13.1ms+8.18ms) by Graph::edges at <a href="Graph-pm-695-block.html#611">line 611</a>, avg 4.26ms/call</div></div>sub edges05 {</td></tr>
+<tr><td class="h"><a name="555"></a>555</td><td class="c0">428</td><td class="c0"><span title="Avg 184µs">78.7ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="556"></a>556</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="557"></a>557</td><td></td><td></td><td class="c1">107</td><td class="c0">18.6ms</td><td class="s"> my @e = $g->[ _E ]->paths( @_ );<div class="calls"><div class="calls_out"> # spent 18.4ms making 106 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#109">Graph::AdjacencyMap::Light::paths</a>, avg 173µs/call
+ # spent 252µs making 1 call to <a href="Graph-AdjacencyMap-Heavy-pm-697-block.html#246">Graph::AdjacencyMap::Heavy::paths</a></div></div></td></tr>
+<tr><td class="h"><a name="558"></a>558</td><td></td><td></td><td></td><td></td><td class="s"> wantarray ?</td></tr>
+<tr><td class="h"><a name="559"></a>559</td><td class="c0">586496</td><td class="c0"><span title="Avg 1µs">733ms</span></td><td class="c0">234598</td><td class="c0">653ms</td><td class="s"> map { [ map { my @v = $V->_get_id_path($_);<div class="calls"><div class="calls_out"> # spent 653ms making 234598 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#124">Graph::AdjacencyMap::Light::_get_id_path</a>, avg 3µs/call</div></div></td></tr>
+<tr><td class="h"><a name="560"></a>560</td><td></td><td></td><td></td><td></td><td class="s"> @v == 1 ? $v[0] : [ @v ] }</td></tr>
+<tr><td class="h"><a name="561"></a>561</td><td></td><td></td><td></td><td></td><td class="s"> @$_ ] }</td></tr>
+<tr><td class="h"><a name="562"></a>562</td><td></td><td></td><td></td><td></td><td class="s"> @e : @e;</td></tr>
+<tr><td class="h"><a name="563"></a>563</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="564"></a>564</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="565"></a>565</td><td></td><td></td><td></td><td></td><td class="s">sub edges02 {</td></tr>
+<tr><td class="h"><a name="566"></a>566</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="567"></a>567</td><td></td><td></td><td></td><td></td><td class="s"> if (@_ && defined $_[0]) {</td></tr>
+<tr><td class="h"><a name="568"></a>568</td><td></td><td></td><td></td><td></td><td class="s"> unless (defined $_[1]) {</td></tr>
+<tr><td class="h"><a name="569"></a>569</td><td></td><td></td><td></td><td></td><td class="s"> my @e = $g->edges_at($_[0]);</td></tr>
+<tr><td class="h"><a name="570"></a>570</td><td></td><td></td><td></td><td></td><td class="s"> wantarray ?</td></tr>
+<tr><td class="h"><a name="571"></a>571</td><td></td><td></td><td></td><td></td><td class="s"> map { @$_ }</td></tr>
+<tr><td class="h"><a name="572"></a>572</td><td></td><td></td><td></td><td></td><td class="s"> sort { $a->[0] cmp $b->[0] || $a->[1] cmp $b->[1] } @e</td></tr>
+<tr><td class="h"><a name="573"></a>573</td><td></td><td></td><td></td><td></td><td class="s"> : @e;</td></tr>
+<tr><td class="h"><a name="574"></a>574</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="575"></a>575</td><td></td><td></td><td></td><td></td><td class="s"> die "edges02: unimplemented option";</td></tr>
+<tr><td class="h"><a name="576"></a>576</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="577"></a>577</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="578"></a>578</td><td></td><td></td><td></td><td></td><td class="s"> my @e = map { ($_) x $g->get_edge_count(@$_) } $g->edges05( @_ );</td></tr>
+<tr><td class="h"><a name="579"></a>579</td><td></td><td></td><td></td><td></td><td class="s"> wantarray ?</td></tr>
+<tr><td class="h"><a name="580"></a>580</td><td></td><td></td><td></td><td></td><td class="s"> map { @$_ }</td></tr>
+<tr><td class="h"><a name="581"></a>581</td><td></td><td></td><td></td><td></td><td class="s"> sort { $a->[0] cmp $b->[0] || $a->[1] cmp $b->[1] } @e</td></tr>
+<tr><td class="h"><a name="582"></a>582</td><td></td><td></td><td></td><td></td><td class="s"> : @e;</td></tr>
+<tr><td class="h"><a name="583"></a>583</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="584"></a>584</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="585"></a>585</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="586"></a>586</td><td></td><td></td><td></td><td></td><td class="s">sub unique_edges {</td></tr>
+<tr><td class="h"><a name="587"></a>587</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="588"></a>588</td><td></td><td></td><td></td><td></td><td class="s"> ($g->is_compat02) ? $g->edges02( @_ ) : $g->edges05( @_ );</td></tr>
+<tr><td class="h"><a name="589"></a>589</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="590"></a>590</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="591"></a>591</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 21.4ms (78µs+21.4) within Graph::edges which was called 5 times, avg 4.29ms/call:
+# 2 times (33µs+82µs) by Graph::AdjacencyMap::Light::__attr at <a href="Graph-AdjacencyMap-Light-pm-700-block.html#221">line 221 of Graph/AdjacencyMap/Light.pm</a>, avg 58µs/call
+# 2 times (16µs+61µs) by Graph::AdjacencyMap::Light::__attr at <a href="Graph-AdjacencyMap-Light-pm-700-block.html#225">line 225 of Graph/AdjacencyMap/Light.pm</a>, avg 38µs/call
+# once (29µs+21.2ms) by Text::Tradition::Collation::paths at <a href="Moose-Meta-Method-Delegation-pm-169-block.html#110">line 110 of Moose/Meta/Method/Delegation.pm</a></div></div>sub edges {</td></tr>
+<tr><td class="h"><a name="592"></a>592</td><td class="c0">10</td><td class="c3"><span title="Avg 1µs">11µs</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="593"></a>593</td><td class="c0">5</td><td class="c3"><span title="Avg 3µs">17µs</span></td><td class="c3">5</td><td class="c3">13µs</td><td class="s"> if ($g->is_compat02) {<div class="calls"><div class="calls_out"> # spent 13µs making 5 calls to <a href="Graph-pm-695-block.html#134">Graph::is_compat02</a>, avg 3µs/call</div></div></td></tr>
+<tr><td class="h"><a name="594"></a>594</td><td></td><td></td><td></td><td></td><td class="s"> return $g->edges02( @_ );</td></tr>
+<tr><td class="h"><a name="595"></a>595</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="596"></a>596</td><td class="c0">5</td><td class="c3"><span title="Avg 6µs">32µs</span></td><td class="c3">10</td><td class="c3">60µs</td><td class="s"> if ($g->is_multiedged || $g->is_countedged) {<div class="calls"><div class="calls_out"> # spent 36µs making 5 calls to <a href="Graph-pm-695-block.html#337">Graph::countedged</a>, avg 7µs/call
+ # spent 23µs making 5 calls to <a href="Graph-pm-695-block.html#338">Graph::multiedged</a>, avg 5µs/call</div></div></td></tr>
+<tr><td class="h"><a name="597"></a>597</td><td></td><td></td><td></td><td></td><td class="s"> if (wantarray) {</td></tr>
+<tr><td class="h"><a name="598"></a>598</td><td></td><td></td><td></td><td></td><td class="s"> my @E;</td></tr>
+<tr><td class="h"><a name="599"></a>599</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ( $g->edges05 ) {</td></tr>
+<tr><td class="h"><a name="600"></a>600</td><td></td><td></td><td></td><td></td><td class="s"> push @E, ($e) x $g->get_edge_count(@$e);</td></tr>
+<tr><td class="h"><a name="601"></a>601</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="602"></a>602</td><td></td><td></td><td></td><td></td><td class="s"> return @E;</td></tr>
+<tr><td class="h"><a name="603"></a>603</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="604"></a>604</td><td></td><td></td><td></td><td></td><td class="s"> my $E = 0;</td></tr>
+<tr><td class="h"><a name="605"></a>605</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ( $g->edges05 ) {</td></tr>
+<tr><td class="h"><a name="606"></a>606</td><td></td><td></td><td></td><td></td><td class="s"> $E += $g->get_edge_count(@$e);</td></tr>
+<tr><td class="h"><a name="607"></a>607</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="608"></a>608</td><td></td><td></td><td></td><td></td><td class="s"> return $E;</td></tr>
+<tr><td class="h"><a name="609"></a>609</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="610"></a>610</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="611"></a>611</td><td></td><td></td><td class="c3">5</td><td class="c0">21.3ms</td><td class="s"> return $g->edges05;<div class="calls"><div class="calls_out"> # spent 21.3ms making 5 calls to <a href="Graph-pm-695-block.html#554">Graph::edges05</a>, avg 4.26ms/call</div></div></td></tr>
+<tr><td class="h"><a name="612"></a>612</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="613"></a>613</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="614"></a>614</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="615"></a>615</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="616"></a>616</td><td></td><td></td><td></td><td></td><td class="s">sub has_edges {</td></tr>
+<tr><td class="h"><a name="617"></a>617</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="618"></a>618</td><td></td><td></td><td></td><td></td><td class="s"> scalar $g->[ _E ]->has_paths( @_ );</td></tr>
+<tr><td class="h"><a name="619"></a>619</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="620"></a>620</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="621"></a>621</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="622"></a>622</td><td></td><td></td><td></td><td></td><td class="s"># by_id</td></tr>
+<tr><td class="h"><a name="623"></a>623</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="624"></a>624</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="625"></a>625</td><td></td><td></td><td></td><td></td><td class="s">sub add_vertex_by_id {</td></tr>
+<tr><td class="h"><a name="626"></a>626</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="627"></a>627</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="628"></a>628</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->set_path_by_multi_id( @_ );</td></tr>
+<tr><td class="h"><a name="629"></a>629</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _G ]++;</td></tr>
+<tr><td class="h"><a name="630"></a>630</td><td></td><td></td><td></td><td></td><td class="s"> $g->_union_find_add_vertex( @_ ) if $g->has_union_find;</td></tr>
+<tr><td class="h"><a name="631"></a>631</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="632"></a>632</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="633"></a>633</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="634"></a>634</td><td></td><td></td><td></td><td></td><td class="s">sub add_vertex_get_id {</td></tr>
+<tr><td class="h"><a name="635"></a>635</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="636"></a>636</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="637"></a>637</td><td></td><td></td><td></td><td></td><td class="s"> my $id = $g->[ _V ]->set_path_by_multi_id( @_, _GEN_ID );</td></tr>
+<tr><td class="h"><a name="638"></a>638</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _G ]++;</td></tr>
+<tr><td class="h"><a name="639"></a>639</td><td></td><td></td><td></td><td></td><td class="s"> $g->_union_find_add_vertex( @_ ) if $g->has_union_find;</td></tr>
+<tr><td class="h"><a name="640"></a>640</td><td></td><td></td><td></td><td></td><td class="s"> return $id;</td></tr>
+<tr><td class="h"><a name="641"></a>641</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="642"></a>642</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="643"></a>643</td><td></td><td></td><td></td><td></td><td class="s">sub has_vertex_by_id {</td></tr>
+<tr><td class="h"><a name="644"></a>644</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="645"></a>645</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="646"></a>646</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->has_path_by_multi_id( @_ );</td></tr>
+<tr><td class="h"><a name="647"></a>647</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="648"></a>648</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="649"></a>649</td><td></td><td></td><td></td><td></td><td class="s">sub delete_vertex_by_id {</td></tr>
+<tr><td class="h"><a name="650"></a>650</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="651"></a>651</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="652"></a>652</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_unionfind;</td></tr>
+<tr><td class="h"><a name="653"></a>653</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="654"></a>654</td><td></td><td></td><td></td><td></td><td class="s"> return unless $V->has_path_by_multi_id( @_ );</td></tr>
+<tr><td class="h"><a name="655"></a>655</td><td></td><td></td><td></td><td></td><td class="s"> # TODO: what to about the edges at this vertex?</td></tr>
+<tr><td class="h"><a name="656"></a>656</td><td></td><td></td><td></td><td></td><td class="s"> # If the multiness of this vertex goes to zero, delete the edges?</td></tr>
+<tr><td class="h"><a name="657"></a>657</td><td></td><td></td><td></td><td></td><td class="s"> $V->del_path_by_multi_id( @_ );</td></tr>
+<tr><td class="h"><a name="658"></a>658</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _G ]++;</td></tr>
+<tr><td class="h"><a name="659"></a>659</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="660"></a>660</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="661"></a>661</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="662"></a>662</td><td></td><td></td><td></td><td></td><td class="s">sub get_multivertex_ids {</td></tr>
+<tr><td class="h"><a name="663"></a>663</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="664"></a>664</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="665"></a>665</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->get_multi_ids( @_ );</td></tr>
+<tr><td class="h"><a name="666"></a>666</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="667"></a>667</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="668"></a>668</td><td></td><td></td><td></td><td></td><td class="s">sub add_edge_by_id {</td></tr>
+<tr><td class="h"><a name="669"></a>669</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="670"></a>670</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="671"></a>671</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="672"></a>672</td><td></td><td></td><td></td><td></td><td class="s"> my @e = $g->_add_edge( @_ );</td></tr>
+<tr><td class="h"><a name="673"></a>673</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->set_path_by_multi_id( @e, $id );</td></tr>
+<tr><td class="h"><a name="674"></a>674</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _G ]++;</td></tr>
+<tr><td class="h"><a name="675"></a>675</td><td></td><td></td><td></td><td></td><td class="s"> $g->_union_find_add_edge( @e ) if $g->has_union_find;</td></tr>
+<tr><td class="h"><a name="676"></a>676</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="677"></a>677</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="678"></a>678</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="679"></a>679</td><td></td><td></td><td></td><td></td><td class="s">sub add_edge_get_id {</td></tr>
+<tr><td class="h"><a name="680"></a>680</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="681"></a>681</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="682"></a>682</td><td></td><td></td><td></td><td></td><td class="s"> my @i = $g->_add_edge( @_ );</td></tr>
+<tr><td class="h"><a name="683"></a>683</td><td></td><td></td><td></td><td></td><td class="s"> my $id = $g->[ _E ]->set_path_by_multi_id( @i, _GEN_ID );</td></tr>
+<tr><td class="h"><a name="684"></a>684</td><td></td><td></td><td></td><td></td><td class="s"> $g->_union_find_add_edge( @i ) if $g->has_union_find;</td></tr>
+<tr><td class="h"><a name="685"></a>685</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _G ]++;</td></tr>
+<tr><td class="h"><a name="686"></a>686</td><td></td><td></td><td></td><td></td><td class="s"> return $id;</td></tr>
+<tr><td class="h"><a name="687"></a>687</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="688"></a>688</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="689"></a>689</td><td></td><td></td><td></td><td></td><td class="s">sub has_edge_by_id {</td></tr>
+<tr><td class="h"><a name="690"></a>690</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="691"></a>691</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="692"></a>692</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="693"></a>693</td><td></td><td></td><td></td><td></td><td class="s"> my @i = $g->_vertex_ids( @_ );</td></tr>
+<tr><td class="h"><a name="694"></a>694</td><td></td><td></td><td></td><td></td><td class="s"> return 0 if @i == 0 && @_;</td></tr>
+<tr><td class="h"><a name="695"></a>695</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->has_path_by_multi_id( @i, $id );</td></tr>
+<tr><td class="h"><a name="696"></a>696</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="697"></a>697</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="698"></a>698</td><td></td><td></td><td></td><td></td><td class="s">sub delete_edge_by_id {</td></tr>
+<tr><td class="h"><a name="699"></a>699</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="700"></a>700</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="701"></a>701</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_unionfind;</td></tr>
+<tr><td class="h"><a name="702"></a>702</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _E ];</td></tr>
+<tr><td class="h"><a name="703"></a>703</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="704"></a>704</td><td></td><td></td><td></td><td></td><td class="s"> my @i = $g->_vertex_ids( @_ );</td></tr>
+<tr><td class="h"><a name="705"></a>705</td><td></td><td></td><td></td><td></td><td class="s"> return unless $V->has_path_by_multi_id( @i, $id );</td></tr>
+<tr><td class="h"><a name="706"></a>706</td><td></td><td></td><td></td><td></td><td class="s"> $V->del_path_by_multi_id( @i, $id );</td></tr>
+<tr><td class="h"><a name="707"></a>707</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _G ]++;</td></tr>
+<tr><td class="h"><a name="708"></a>708</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="709"></a>709</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="710"></a>710</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="711"></a>711</td><td></td><td></td><td></td><td></td><td class="s">sub get_multiedge_ids {</td></tr>
+<tr><td class="h"><a name="712"></a>712</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="713"></a>713</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="714"></a>714</td><td></td><td></td><td></td><td></td><td class="s"> my @id = $g->_vertex_ids( @_ );</td></tr>
+<tr><td class="h"><a name="715"></a>715</td><td></td><td></td><td></td><td></td><td class="s"> return unless @id;</td></tr>
+<tr><td class="h"><a name="716"></a>716</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->get_multi_ids( @id );</td></tr>
+<tr><td class="h"><a name="717"></a>717</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="718"></a>718</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="719"></a>719</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="720"></a>720</td><td></td><td></td><td></td><td></td><td class="s"># Neighbourhood.</td></tr>
+<tr><td class="h"><a name="721"></a>721</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="722"></a>722</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="723"></a>723</td><td></td><td></td><td></td><td></td><td class="s">sub vertices_at {</td></tr>
+<tr><td class="h"><a name="724"></a>724</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="725"></a>725</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="726"></a>726</td><td></td><td></td><td></td><td></td><td class="s"> return @_ unless ($V->[ _f ] & _HYPER);</td></tr>
+<tr><td class="h"><a name="727"></a>727</td><td></td><td></td><td></td><td></td><td class="s"> my %v;</td></tr>
+<tr><td class="h"><a name="728"></a>728</td><td></td><td></td><td></td><td></td><td class="s"> my @i;</td></tr>
+<tr><td class="h"><a name="729"></a>729</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ( @_ ) {</td></tr>
+<tr><td class="h"><a name="730"></a>730</td><td></td><td></td><td></td><td></td><td class="s"> my $i = $V->_get_path_id( $v );</td></tr>
+<tr><td class="h"><a name="731"></a>731</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $i;</td></tr>
+<tr><td class="h"><a name="732"></a>732</td><td></td><td></td><td></td><td></td><td class="s"> push @i, ( $v{ $v } = $i );</td></tr>
+<tr><td class="h"><a name="733"></a>733</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="734"></a>734</td><td></td><td></td><td></td><td></td><td class="s"> my $Vi = $V->_ids;</td></tr>
+<tr><td class="h"><a name="735"></a>735</td><td></td><td></td><td></td><td></td><td class="s"> my @v;</td></tr>
+<tr><td class="h"><a name="736"></a>736</td><td></td><td></td><td></td><td></td><td class="s"> while (my ($i, $v) = each %{ $Vi }) {</td></tr>
+<tr><td class="h"><a name="737"></a>737</td><td></td><td></td><td></td><td></td><td class="s"> my %i;</td></tr>
+<tr><td class="h"><a name="738"></a>738</td><td></td><td></td><td></td><td></td><td class="s"> my $h = $V->[_f ] & _HYPER;</td></tr>
+<tr><td class="h"><a name="739"></a>739</td><td></td><td></td><td></td><td></td><td class="s"> @i{ @i } = @i if @i; # @todo: nonuniq hyper vertices?</td></tr>
+<tr><td class="h"><a name="740"></a>740</td><td></td><td></td><td></td><td></td><td class="s"> for my $u (ref $v eq 'ARRAY' && $h ? @$v : $v) {</td></tr>
+<tr><td class="h"><a name="741"></a>741</td><td></td><td></td><td></td><td></td><td class="s"> my $j = exists $v{ $u } ? $v{ $u } : ( $v{ $u } = $i );</td></tr>
+<tr><td class="h"><a name="742"></a>742</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $j && exists $i{ $j }) {</td></tr>
+<tr><td class="h"><a name="743"></a>743</td><td></td><td></td><td></td><td></td><td class="s"> delete $i{ $j };</td></tr>
+<tr><td class="h"><a name="744"></a>744</td><td></td><td></td><td></td><td></td><td class="s"> unless (keys %i) {</td></tr>
+<tr><td class="h"><a name="745"></a>745</td><td></td><td></td><td></td><td></td><td class="s"> push @v, $v;</td></tr>
+<tr><td class="h"><a name="746"></a>746</td><td></td><td></td><td></td><td></td><td class="s"> last;</td></tr>
+<tr><td class="h"><a name="747"></a>747</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="748"></a>748</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="749"></a>749</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="750"></a>750</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="751"></a>751</td><td></td><td></td><td></td><td></td><td class="s"> return @v;</td></tr>
+<tr><td class="h"><a name="752"></a>752</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="753"></a>753</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="754"></a>754</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 326ms (325+798µs) within Graph::_edges_at which was called 107 times, avg 3.04ms/call:
+# 107 times (325ms+798µs) by Graph::delete_vertex at <a href="Graph-pm-695-block.html#995">line 995</a>, avg 3.04ms/call</div></div>sub _edges_at {</td></tr>
+<tr><td class="h"><a name="755"></a>755</td><td class="c0">963</td><td class="c0"><span title="Avg 2µs">1.46ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="756"></a>756</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="757"></a>757</td><td></td><td></td><td></td><td></td><td class="s"> my $E = $g->[ _E ];</td></tr>
+<tr><td class="h"><a name="758"></a>758</td><td></td><td></td><td></td><td></td><td class="s"> my @e;</td></tr>
+<tr><td class="h"><a name="759"></a>759</td><td></td><td></td><td></td><td></td><td class="s"> my $en = 0;</td></tr>
+<tr><td class="h"><a name="760"></a>760</td><td></td><td></td><td></td><td></td><td class="s"> my %ev;</td></tr>
+<tr><td class="h"><a name="761"></a>761</td><td></td><td></td><td></td><td></td><td class="s"> my $h = $V->[_f ] & _HYPER;</td></tr>
+<tr><td class="h"><a name="762"></a>762</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ( $h ? $g->vertices_at( @_ ) : @_ ) {</td></tr>
+<tr><td class="h"><a name="763"></a>763</td><td class="c0">428</td><td class="c0"><span title="Avg 390µs">167ms</span></td><td class="c1">107</td><td class="c3">518µs</td><td class="s"> my $vi = $V->_get_path_id( ref $v eq 'ARRAY' && $h ? @$v : $v );<div class="calls"><div class="calls_out"> # spent 518µs making 107 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#74">Graph::AdjacencyMap::Light::_get_path_id</a>, avg 5µs/call</div></div></td></tr>
+<tr><td class="h"><a name="764"></a>764</td><td></td><td></td><td></td><td></td><td class="s"> next unless defined $vi;</td></tr>
+<tr><td class="h"><a name="765"></a>765</td><td></td><td></td><td class="c1">107</td><td class="c3">280µs</td><td class="s"> my $Ei = $E->_ids;<div class="calls"><div class="calls_out"> # spent 280µs making 107 calls to <a href="Graph-AdjacencyMap-pm-696-block.html#56">Graph::AdjacencyMap::_ids</a>, avg 3µs/call</div></div></td></tr>
+<tr><td class="h"><a name="766"></a>766</td><td></td><td></td><td></td><td></td><td class="s"> while (my ($ei, $ev) = each %{ $Ei }) {</td></tr>
+<tr><td class="h"><a name="767"></a>767</td><td></td><td></td><td></td><td></td><td class="s"> if (wantarray) {</td></tr>
+<tr><td class="h"><a name="768"></a>768</td><td></td><td></td><td></td><td></td><td class="s"> for my $j (@$ev) {</td></tr>
+<tr><td class="h"><a name="769"></a>769</td><td class="c0">243510</td><td class="c0"><span title="Avg 343ns">83.5ms</span></td><td></td><td></td><td class="s"> push @e, [ $ei, $ev ]</td></tr>
+<tr><td class="h"><a name="770"></a>770</td><td></td><td></td><td></td><td></td><td class="s"> if $j == $vi && !$ev{$ei}++;</td></tr>
+<tr><td class="h"><a name="771"></a>771</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="772"></a>772</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="773"></a>773</td><td></td><td></td><td></td><td></td><td class="s"> for my $j (@$ev) {</td></tr>
+<tr><td class="h"><a name="774"></a>774</td><td></td><td></td><td></td><td></td><td class="s"> $en++ if $j == $vi;</td></tr>
+<tr><td class="h"><a name="775"></a>775</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="776"></a>776</td><td></td><td></td><td></td><td></td><td class="s"> } </td></tr>
+<tr><td class="h"><a name="777"></a>777</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="778"></a>778</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="779"></a>779</td><td></td><td></td><td></td><td></td><td class="s"> return wantarray ? @e : $en;</td></tr>
+<tr><td class="h"><a name="780"></a>780</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="781"></a>781</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="782"></a>782</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 541ms (264+277) within Graph::_edges which was called 12613 times, avg 43µs/call:
+# 12607 times (258ms+277ms) by Graph::edges_from or Graph::neighbours at <a href="Graph-pm-695-block.html#829">line 829</a>, avg 42µs/call
+# 6 times (5.46ms+84µs) by Graph::edges_to or Graph::neighbours at <a href="Graph-pm-695-block.html#834">line 834</a>, avg 924µs/call</div></div>sub _edges {</td></tr>
+<tr><td class="h"><a name="783"></a>783</td><td class="c0">189195</td><td class="c0"><span title="Avg 664ns">126ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="784"></a>784</td><td></td><td></td><td></td><td></td><td class="s"> my $n = pop;</td></tr>
+<tr><td class="h"><a name="785"></a>785</td><td></td><td></td><td></td><td></td><td class="s"> my $i = $n == _S ? 0 : -1; # _edges_from() or _edges_to()</td></tr>
+<tr><td class="h"><a name="786"></a>786</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="787"></a>787</td><td></td><td></td><td></td><td></td><td class="s"> my $E = $g->[ _E ];</td></tr>
+<tr><td class="h"><a name="788"></a>788</td><td></td><td></td><td></td><td></td><td class="s"> my $N = $g->[ $n ];</td></tr>
+<tr><td class="h"><a name="789"></a>789</td><td></td><td></td><td></td><td></td><td class="s"> my $h = $V->[ _f ] & _HYPER;</td></tr>
+<tr><td class="h"><a name="790"></a>790</td><td class="c0">24</td><td class="c0"><span title="Avg 121µs">2.90ms</span></td><td></td><td></td><td class="s"> unless (defined $N && $N->[ 0 ] == $g->[ _G ]) {</td></tr>
+<tr><td class="h"><a name="791"></a>791</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ $n ]->[ 1 ] = { };</td></tr>
+<tr><td class="h"><a name="792"></a>792</td><td></td><td></td><td></td><td></td><td class="s"> $N = $g->[ $n ];</td></tr>
+<tr><td class="h"><a name="793"></a>793</td><td></td><td></td><td></td><td></td><td class="s"> my $u = $E->[ _f ] & _UNORD;</td></tr>
+<tr><td class="h"><a name="794"></a>794</td><td></td><td></td><td class="c3">4</td><td class="c3">9µs</td><td class="s"> my $Ei = $E->_ids;<div class="calls"><div class="calls_out"> # spent 9µs making 4 calls to <a href="Graph-AdjacencyMap-pm-696-block.html#56">Graph::AdjacencyMap::_ids</a>, avg 2µs/call</div></div></td></tr>
+<tr><td class="h"><a name="795"></a>795</td><td class="c0">7398</td><td class="c0"><span title="Avg 359ns">2.66ms</span></td><td></td><td></td><td class="s"> while (my ($ei, $ev) = each %{ $Ei }) {</td></tr>
+<tr><td class="h"><a name="796"></a>796</td><td></td><td></td><td></td><td></td><td class="s"> next unless @$ev;</td></tr>
+<tr><td class="h"><a name="797"></a>797</td><td></td><td></td><td></td><td></td><td class="s"> my $e = [ $ei, $ev ];</td></tr>
+<tr><td class="h"><a name="798"></a>798</td><td class="c0">4932</td><td class="c0"><span title="Avg 1µs">5.23ms</span></td><td></td><td></td><td class="s"> if ($u) {</td></tr>
+<tr><td class="h"><a name="799"></a>799</td><td></td><td></td><td></td><td></td><td class="s"> push @{ $N->[ 1 ]->{ $ev->[ 0] } }, $e;</td></tr>
+<tr><td class="h"><a name="800"></a>800</td><td></td><td></td><td></td><td></td><td class="s"> push @{ $N->[ 1 ]->{ $ev->[-1] } }, $e;</td></tr>
+<tr><td class="h"><a name="801"></a>801</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="802"></a>802</td><td></td><td></td><td></td><td></td><td class="s"> my $e = [ $ei, $ev ];</td></tr>
+<tr><td class="h"><a name="803"></a>803</td><td></td><td></td><td></td><td></td><td class="s"> push @{ $N->[ 1 ]->{ $ev->[$i] } }, $e;</td></tr>
+<tr><td class="h"><a name="804"></a>804</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="805"></a>805</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="806"></a>806</td><td></td><td></td><td></td><td></td><td class="s"> $N->[ 0 ] = $g->[ _G ];</td></tr>
+<tr><td class="h"><a name="807"></a>807</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="808"></a>808</td><td></td><td></td><td></td><td></td><td class="s"> my @e;</td></tr>
+<tr><td class="h"><a name="809"></a>809</td><td></td><td></td><td></td><td></td><td class="s"> my @at = $h ? $g->vertices_at( @_ ) : @_;</td></tr>
+<tr><td class="h"><a name="810"></a>810</td><td class="c3">1</td><td class="c0"><span title="Avg 25.7ms">25.7ms</span></td><td class="c0">12605</td><td class="c0">70.0ms</td><td class="s"> my %at; @at{@at} = ();<div class="calls"><div class="calls_out"> # spent 70.0ms making 12605 calls to <a href="lib-Text-Tradition-Collation-Reading-pm-747-block.html#271">Text::Tradition::Collation::Reading::_stringify</a>, avg 6µs/call</div></div></td></tr>
+<tr><td class="h"><a name="811"></a>811</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ( @at ) {</td></tr>
+<tr><td class="h"><a name="812"></a>812</td><td class="c0">37839</td><td class="c0"><span title="Avg 2µs">59.2ms</span></td><td class="c0">12613</td><td class="c0">139ms</td><td class="s"> my $vi = $V->_get_path_id( ref $v eq 'ARRAY' && $h ? @$v : $v );<div class="calls"><div class="calls_out"> # spent 139ms making 12613 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#74">Graph::AdjacencyMap::Light::_get_path_id</a>, avg 11µs/call</div></div></td></tr>
+<tr><td class="h"><a name="813"></a>813</td><td></td><td></td><td></td><td></td><td class="s"> next unless defined $vi && exists $N->[ 1 ]->{ $vi };</td></tr>
+<tr><td class="h"><a name="814"></a>814</td><td></td><td></td><td></td><td></td><td class="s"> push @e, @{ $N->[ 1 ]->{ $vi } };</td></tr>
+<tr><td class="h"><a name="815"></a>815</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="816"></a>816</td><td class="c0">8</td><td class="c3"><span title="Avg 950ns">8µs</span></td><td class="c0">12613</td><td class="c0">68.6ms</td><td class="s"> if (wantarray && $g->is_undirected) {<div class="calls"><div class="calls_out"> # spent 68.6ms making 12613 calls to <a href="Graph-pm-695-block.html#340">Graph::omniedged</a>, avg 5µs/call</div></div></td></tr>
+<tr><td class="h"><a name="817"></a>817</td><td class="c0">4</td><td class="c3"><span title="Avg 1µs">5µs</span></td><td class="c3">4</td><td class="c3">12µs</td><td class="s"> my @i = map { $V->_get_path_id( $_ ) } @_;<div class="calls"><div class="calls_out"> # spent 12µs making 4 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#74">Graph::AdjacencyMap::Light::_get_path_id</a>, avg 3µs/call</div></div></td></tr>
+<tr><td class="h"><a name="818"></a>818</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ( @e ) {</td></tr>
+<tr><td class="h"><a name="819"></a>819</td><td class="c0">4</td><td class="c3"><span title="Avg 2µs">9µs</span></td><td></td><td></td><td class="s"> unless ( $e->[ 1 ]->[ $i ] == $i[ $i ] ) {</td></tr>
+<tr><td class="h"><a name="820"></a>820</td><td></td><td></td><td></td><td></td><td class="s"> $e = [ $e->[ 0 ], [ reverse @{ $e->[ 1 ] } ] ];</td></tr>
+<tr><td class="h"><a name="821"></a>821</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="822"></a>822</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="823"></a>823</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="824"></a>824</td><td></td><td></td><td></td><td></td><td class="s"> return @e;</td></tr>
+<tr><td class="h"><a name="825"></a>825</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="826"></a>826</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="827"></a>827</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 30.7ms within Graph::_edges_from which was called 12607 times, avg 2µs/call:
+# 12605 times (30.7ms+0s) by Graph::edges_from at <a href="Graph-pm-695-block.html#852">line 852</a>, avg 2µs/call
+# 2 times (9µs+0s) by Graph::neighbours at <a href="Graph-pm-695-block.html#939">line 939</a>, avg 4µs/call</div></div>sub _edges_from {</td></tr>
+<tr><td class="h"><a name="828"></a>828</td><td class="c0">25214</td><td class="c0"><span title="Avg 2µs">52.7ms</span></td><td></td><td></td><td class="s"> push @_, _S;</td></tr>
+<tr><td class="h"><a name="829"></a>829</td><td></td><td></td><td class="c0">12607</td><td class="c0">535ms</td><td class="s"> goto &_edges;<div class="calls"><div class="calls_out"> # spent 535ms making 12607 calls to <a href="Graph-pm-695-block.html#782">Graph::_edges</a>, avg 42µs/call</div></div></td></tr>
+<tr><td class="h"><a name="830"></a>830</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="831"></a>831</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="832"></a>832</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 24µs within Graph::_edges_to which was called 6 times, avg 4µs/call:
+# 4 times (19µs+0s) by Graph::edges_to at <a href="Graph-pm-695-block.html#857">line 857</a>, avg 5µs/call
+# 2 times (5µs+0s) by Graph::neighbours at <a href="Graph-pm-695-block.html#940">line 940</a>, avg 3µs/call</div></div>sub _edges_to {</td></tr>
+<tr><td class="h"><a name="833"></a>833</td><td class="c0">12</td><td class="c3"><span title="Avg 3µs">38µs</span></td><td></td><td></td><td class="s"> push @_, _P;</td></tr>
+<tr><td class="h"><a name="834"></a>834</td><td></td><td></td><td class="c3">6</td><td class="c0">5.54ms</td><td class="s"> goto &_edges;<div class="calls"><div class="calls_out"> # spent 5.54ms making 6 calls to <a href="Graph-pm-695-block.html#782">Graph::_edges</a>, avg 924µs/call</div></div></td></tr>
+<tr><td class="h"><a name="835"></a>835</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="836"></a>836</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="837"></a>837</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 245ms (161+84.0) within Graph::_edges_id_path which was called 13804 times, avg 18µs/call:
+# 13800 times (161ms+83.9ms) by Graph::edges_from at <a href="Graph-pm-695-block.html#852">line 852</a>, avg 18µs/call
+# 4 times (49µs+27µs) by Graph::edges_to at <a href="Graph-pm-695-block.html#857">line 857</a>, avg 19µs/call</div></div>sub _edges_id_path {</td></tr>
+<tr><td class="h"><a name="838"></a>838</td><td class="c0">41412</td><td class="c0"><span title="Avg 1µs">60.2ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="839"></a>839</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="840"></a>840</td><td></td><td></td><td class="c0">27608</td><td class="c0">84.0ms</td><td class="s"> [ map { my @v = $V->_get_id_path($_);<div class="calls"><div class="calls_out"> # spent 84.0ms making 27608 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#124">Graph::AdjacencyMap::Light::_get_id_path</a>, avg 3µs/call</div></div></td></tr>
+<tr><td class="h"><a name="841"></a>841</td><td></td><td></td><td></td><td></td><td class="s"> @v == 1 ? $v[0] : [ @v ] }</td></tr>
+<tr><td class="h"><a name="842"></a>842</td><td class="c0">55216</td><td class="c0"><span title="Avg 1µs">65.4ms</span></td><td></td><td></td><td class="s"> @{ $_[0]->[1] } ];</td></tr>
+<tr><td class="h"><a name="843"></a>843</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="844"></a>844</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="845"></a>845</td><td></td><td></td><td></td><td></td><td class="s">sub edges_at {</td></tr>
+<tr><td class="h"><a name="846"></a>846</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="847"></a>847</td><td></td><td></td><td></td><td></td><td class="s"> map { $g->_edges_id_path($_ ) } $g->_edges_at( @_ );</td></tr>
+<tr><td class="h"><a name="848"></a>848</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="849"></a>849</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="850"></a>850</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 927ms (116+811) within Graph::edges_from which was called 12605 times, avg 74µs/call:
+# 12605 times (116ms+811ms) by Text::Tradition::Collation::_find_linked_reading at <a href="lib-Text-Tradition-Collation-pm-686-block.html#1304">line 1304 of lib/Text/Tradition/Collation.pm</a>, avg 74µs/call</div></div>sub edges_from {</td></tr>
+<tr><td class="h"><a name="851"></a>851</td><td class="c0">25210</td><td class="c0"><span title="Avg 2µs">49.1ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="852"></a>852</td><td class="c0">13800</td><td class="c0"><span title="Avg 1µs">18.5ms</span></td><td class="c0">26405</td><td class="c0">276ms</td><td class="s"> map { $g->_edges_id_path($_ ) } $g->_edges_from( @_ );<div class="calls"><div class="calls_out"> # spent 245ms making 13800 calls to <a href="Graph-pm-695-block.html#837">Graph::_edges_id_path</a>, avg 18µs/call
+ # spent 30.7ms making 12605 calls to <a href="Graph-pm-695-block.html#827">Graph::_edges_from</a>, avg 2µs/call</div></div></td></tr>
+<tr><td class="h"><a name="853"></a>853</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="854"></a>854</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="855"></a>855</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 5.41ms (49µs+5.36) within Graph::edges_to which was called 4 times, avg 1.35ms/call:
+# 4 times (49µs+5.36ms) by Text::Tradition::Collation::reading_witnesses at <a href="lib-Text-Tradition-Collation-pm-686-block.html#535">line 535 of lib/Text/Tradition/Collation.pm</a>, avg 1.35ms/call</div></div>sub edges_to {</td></tr>
+<tr><td class="h"><a name="856"></a>856</td><td class="c0">8</td><td class="c3"><span title="Avg 3µs">22µs</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="857"></a>857</td><td class="c0">4</td><td class="c3"><span title="Avg 2µs">7µs</span></td><td class="c3">8</td><td class="c3">95µs</td><td class="s"> map { $g->_edges_id_path($_ ) } $g->_edges_to( @_ );<div class="calls"><div class="calls_out"> # spent 77µs making 4 calls to <a href="Graph-pm-695-block.html#837">Graph::_edges_id_path</a>, avg 19µs/call
+ # spent 19µs making 4 calls to <a href="Graph-pm-695-block.html#832">Graph::_edges_to</a>, avg 5µs/call</div></div></td></tr>
+<tr><td class="h"><a name="858"></a>858</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="859"></a>859</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="860"></a>860</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 1.59s (401ms+1.19) within Graph::successors which was called 106675 times, avg 15µs/call:
+# 105427 times (396ms+1.17s) by Graph::Traversal::next at <a href="Graph-Traversal-pm-713-block.html#285">line 285 of Graph/Traversal.pm</a>, avg 15µs/call
+# 1039 times (3.90ms+11.2ms) by Text::Tradition::Collation::_assign_rank at <a href="lib-Text-Tradition-Collation-pm-686-block.html#1551">line 1551 of lib/Text/Tradition/Collation.pm</a>, avg 15µs/call
+# 102 times (592µs+1.39ms) by Graph::is_isolated_vertex at <a href="Graph-pm-695-block.html#1127">line 1127</a>, avg 19µs/call
+# 56 times (335µs+1.00ms) by Text::Tradition::Collation::RelationshipStore::_make_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#831">line 831 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 24µs/call
+# 51 times (276µs+743µs) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#872">line 872 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 20µs/call</div></div>sub successors {</td></tr>
+<tr><td class="h"><a name="861"></a>861</td><td class="c0">320025</td><td class="c0"><span title="Avg 1µs">329ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="862"></a>862</td><td></td><td></td><td></td><td></td><td class="s"> my $E = $g->[ _E ];</td></tr>
+<tr><td class="h"><a name="863"></a>863</td><td></td><td></td><td class="c0">106675</td><td class="c0">1.19s</td><td class="s"> ($E->[ _f ] & _LIGHT) ?<div class="calls"><div class="calls_out"> # spent 1.19s making 106675 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#173">Graph::AdjacencyMap::Light::_successors</a>, avg 11µs/call</div></div></td></tr>
+<tr><td class="h"><a name="864"></a>864</td><td></td><td></td><td></td><td></td><td class="s"> $E->_successors($g, @_) :</td></tr>
+<tr><td class="h"><a name="865"></a>865</td><td></td><td></td><td></td><td></td><td class="s"> Graph::AdjacencyMap::_successors($E, $g, @_);</td></tr>
+<tr><td class="h"><a name="866"></a>866</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="867"></a>867</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="868"></a>868</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 1.41s (373ms+1.04) within Graph::predecessors which was called 110096 times, avg 13µs/call:
+# 108940 times (368ms+1.02s) by Graph::is_isolated_vertex at <a href="Graph-pm-695-block.html#1127">line 1127</a>, avg 13µs/call
+# 1049 times (3.98ms+10.8ms) by Text::Tradition::Collation::_assign_rank at <a href="lib-Text-Tradition-Collation-pm-686-block.html#1555">line 1555 of lib/Text/Tradition/Collation.pm</a>, avg 14µs/call
+# 56 times (409µs+1.17ms) by Text::Tradition::Collation::RelationshipStore::_make_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#828">line 828 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 28µs/call
+# 51 times (269µs+784µs) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#864">line 864 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 21µs/call</div></div>sub predecessors {</td></tr>
+<tr><td class="h"><a name="869"></a>869</td><td class="c0">330288</td><td class="c0"><span title="Avg 925ns">305ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="870"></a>870</td><td></td><td></td><td></td><td></td><td class="s"> my $E = $g->[ _E ];</td></tr>
+<tr><td class="h"><a name="871"></a>871</td><td></td><td></td><td class="c0">110096</td><td class="c0">1.04s</td><td class="s"> ($E->[ _f ] & _LIGHT) ?<div class="calls"><div class="calls_out"> # spent 1.04s making 110096 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#201">Graph::AdjacencyMap::Light::_predecessors</a>, avg 9µs/call</div></div></td></tr>
+<tr><td class="h"><a name="872"></a>872</td><td></td><td></td><td></td><td></td><td class="s"> $E->_predecessors($g, @_) :</td></tr>
+<tr><td class="h"><a name="873"></a>873</td><td></td><td></td><td></td><td></td><td class="s"> Graph::AdjacencyMap::_predecessors($E, $g, @_);</td></tr>
+<tr><td class="h"><a name="874"></a>874</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="875"></a>875</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="876"></a>876</td><td></td><td></td><td></td><td></td><td class="s">sub _all_successors {</td></tr>
+<tr><td class="h"><a name="877"></a>877</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="878"></a>878</td><td></td><td></td><td></td><td></td><td class="s"> my @init = @_;</td></tr>
+<tr><td class="h"><a name="879"></a>879</td><td></td><td></td><td></td><td></td><td class="s"> my %todo;</td></tr>
+<tr><td class="h"><a name="880"></a>880</td><td></td><td></td><td></td><td></td><td class="s"> @todo{@init} = @init;</td></tr>
+<tr><td class="h"><a name="881"></a>881</td><td></td><td></td><td></td><td></td><td class="s"> my %seen;</td></tr>
+<tr><td class="h"><a name="882"></a>882</td><td></td><td></td><td></td><td></td><td class="s"> my %init = %todo;</td></tr>
+<tr><td class="h"><a name="883"></a>883</td><td></td><td></td><td></td><td></td><td class="s"> my %self;</td></tr>
+<tr><td class="h"><a name="884"></a>884</td><td></td><td></td><td></td><td></td><td class="s"> while (keys %todo) {</td></tr>
+<tr><td class="h"><a name="885"></a>885</td><td></td><td></td><td></td><td></td><td class="s"> my @todo = values %todo;</td></tr>
+<tr><td class="h"><a name="886"></a>886</td><td></td><td></td><td></td><td></td><td class="s"> for my $t (@todo) {</td></tr>
+<tr><td class="h"><a name="887"></a>887</td><td></td><td></td><td></td><td></td><td class="s"> $seen{$t} = delete $todo{$t};</td></tr>
+<tr><td class="h"><a name="888"></a>888</td><td></td><td></td><td></td><td></td><td class="s"> for my $s ($g->successors($t)) {</td></tr>
+<tr><td class="h"><a name="889"></a>889</td><td></td><td></td><td></td><td></td><td class="s"> $self{$s} = $s if exists $init{$s};</td></tr>
+<tr><td class="h"><a name="890"></a>890</td><td></td><td></td><td></td><td></td><td class="s"> $todo{$s} = $s unless exists $seen{$s};</td></tr>
+<tr><td class="h"><a name="891"></a>891</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="892"></a>892</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="893"></a>893</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="894"></a>894</td><td></td><td></td><td></td><td></td><td class="s"> for my $v (@init) {</td></tr>
+<tr><td class="h"><a name="895"></a>895</td><td></td><td></td><td></td><td></td><td class="s"> delete $seen{$v} unless $g->has_edge($v, $v) || $self{$v};</td></tr>
+<tr><td class="h"><a name="896"></a>896</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="897"></a>897</td><td></td><td></td><td></td><td></td><td class="s"> return values %seen;</td></tr>
+<tr><td class="h"><a name="898"></a>898</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="899"></a>899</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="900"></a>900</td><td></td><td></td><td></td><td></td><td class="s">sub all_successors {</td></tr>
+<tr><td class="h"><a name="901"></a>901</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="902"></a>902</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="903"></a>903</td><td></td><td></td><td></td><td></td><td class="s"> return $g->_all_successors(@_);</td></tr>
+<tr><td class="h"><a name="904"></a>904</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="905"></a>905</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="906"></a>906</td><td></td><td></td><td></td><td></td><td class="s">sub _all_predecessors {</td></tr>
+<tr><td class="h"><a name="907"></a>907</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="908"></a>908</td><td></td><td></td><td></td><td></td><td class="s"> my @init = @_;</td></tr>
+<tr><td class="h"><a name="909"></a>909</td><td></td><td></td><td></td><td></td><td class="s"> my %todo;</td></tr>
+<tr><td class="h"><a name="910"></a>910</td><td></td><td></td><td></td><td></td><td class="s"> @todo{@init} = @init;</td></tr>
+<tr><td class="h"><a name="911"></a>911</td><td></td><td></td><td></td><td></td><td class="s"> my %seen;</td></tr>
+<tr><td class="h"><a name="912"></a>912</td><td></td><td></td><td></td><td></td><td class="s"> my %init = %todo;</td></tr>
+<tr><td class="h"><a name="913"></a>913</td><td></td><td></td><td></td><td></td><td class="s"> my %self;</td></tr>
+<tr><td class="h"><a name="914"></a>914</td><td></td><td></td><td></td><td></td><td class="s"> while (keys %todo) {</td></tr>
+<tr><td class="h"><a name="915"></a>915</td><td></td><td></td><td></td><td></td><td class="s"> my @todo = values %todo;</td></tr>
+<tr><td class="h"><a name="916"></a>916</td><td></td><td></td><td></td><td></td><td class="s"> for my $t (@todo) {</td></tr>
+<tr><td class="h"><a name="917"></a>917</td><td></td><td></td><td></td><td></td><td class="s"> $seen{$t} = delete $todo{$t};</td></tr>
+<tr><td class="h"><a name="918"></a>918</td><td></td><td></td><td></td><td></td><td class="s"> for my $p ($g->predecessors($t)) {</td></tr>
+<tr><td class="h"><a name="919"></a>919</td><td></td><td></td><td></td><td></td><td class="s"> $self{$p} = $p if exists $init{$p};</td></tr>
+<tr><td class="h"><a name="920"></a>920</td><td></td><td></td><td></td><td></td><td class="s"> $todo{$p} = $p unless exists $seen{$p};</td></tr>
+<tr><td class="h"><a name="921"></a>921</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="922"></a>922</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="923"></a>923</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="924"></a>924</td><td></td><td></td><td></td><td></td><td class="s"> for my $v (@init) {</td></tr>
+<tr><td class="h"><a name="925"></a>925</td><td></td><td></td><td></td><td></td><td class="s"> delete $seen{$v} unless $g->has_edge($v, $v) || $self{$v};</td></tr>
+<tr><td class="h"><a name="926"></a>926</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="927"></a>927</td><td></td><td></td><td></td><td></td><td class="s"> return values %seen;</td></tr>
+<tr><td class="h"><a name="928"></a>928</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="929"></a>929</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="930"></a>930</td><td></td><td></td><td></td><td></td><td class="s">sub all_predecessors {</td></tr>
+<tr><td class="h"><a name="931"></a>931</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="932"></a>932</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="933"></a>933</td><td></td><td></td><td></td><td></td><td class="s"> return $g->_all_predecessors(@_);</td></tr>
+<tr><td class="h"><a name="934"></a>934</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="935"></a>935</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="936"></a>936</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 681µs (62+619) within Graph::neighbours which was called 2 times, avg 341µs/call:
+# 2 times (62µs+619µs) by Text::Tradition::Collation::RelationshipStore::related_readings at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#702">line 702 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 341µs/call</div></div>sub neighbours {</td></tr>
+<tr><td class="h"><a name="937"></a>937</td><td class="c0">16</td><td class="c3"><span title="Avg 2µs">28µs</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="938"></a>938</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="939"></a>939</td><td class="c0">6</td><td class="c3"><span title="Avg 683ns">4µs</span></td><td class="c3">2</td><td class="c3">9µs</td><td class="s"> my @s = map { my @v = @{ $_->[ 1 ] }; shift @v; @v } $g->_edges_from( @_ );<div class="calls"><div class="calls_out"> # spent 9µs making 2 calls to <a href="Graph-pm-695-block.html#827">Graph::_edges_from</a>, avg 4µs/call</div></div></td></tr>
+<tr><td class="h"><a name="940"></a>940</td><td class="c0">6</td><td class="c3"><span title="Avg 650ns">4µs</span></td><td class="c3">2</td><td class="c3">5µs</td><td class="s"> my @p = map { my @v = @{ $_->[ 1 ] }; pop @v; @v } $g->_edges_to ( @_ );<div class="calls"><div class="calls_out"> # spent 5µs making 2 calls to <a href="Graph-pm-695-block.html#832">Graph::_edges_to</a>, avg 3µs/call</div></div></td></tr>
+<tr><td class="h"><a name="941"></a>941</td><td></td><td></td><td></td><td></td><td class="s"> my %n;</td></tr>
+<tr><td class="h"><a name="942"></a>942</td><td></td><td></td><td></td><td></td><td class="s"> @n{ @s } = @s;</td></tr>
+<tr><td class="h"><a name="943"></a>943</td><td></td><td></td><td></td><td></td><td class="s"> @n{ @p } = @p;</td></tr>
+<tr><td class="h"><a name="944"></a>944</td><td class="c3">2</td><td class="c3"><span title="Avg 2µs">3µs</span></td><td class="c3">2</td><td class="c3">8µs</td><td class="s"> map { $V->_get_id_path($_) } keys %n;<div class="calls"><div class="calls_out"> # spent 8µs making 2 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#124">Graph::AdjacencyMap::Light::_get_id_path</a>, avg 4µs/call</div></div></td></tr>
+<tr><td class="h"><a name="945"></a>945</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="946"></a>946</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="947"></a>947</td><td class="c3">1</td><td class="c3"><span title="Avg 2µs">2µs</span></td><td></td><td></td><td class="s">*neighbors = \&neighbours;</td></tr>
+<tr><td class="h"><a name="948"></a>948</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="949"></a>949</td><td></td><td></td><td></td><td></td><td class="s">sub all_neighbours {</td></tr>
+<tr><td class="h"><a name="950"></a>950</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="951"></a>951</td><td></td><td></td><td></td><td></td><td class="s"> my @init = @_;</td></tr>
+<tr><td class="h"><a name="952"></a>952</td><td></td><td></td><td></td><td></td><td class="s"> my @v = @init;</td></tr>
+<tr><td class="h"><a name="953"></a>953</td><td></td><td></td><td></td><td></td><td class="s"> my %n;</td></tr>
+<tr><td class="h"><a name="954"></a>954</td><td></td><td></td><td></td><td></td><td class="s"> my $o = 0;</td></tr>
+<tr><td class="h"><a name="955"></a>955</td><td></td><td></td><td></td><td></td><td class="s"> while (1) {</td></tr>
+<tr><td class="h"><a name="956"></a>956</td><td></td><td></td><td></td><td></td><td class="s"> my @p = $g->_all_predecessors(@v);</td></tr>
+<tr><td class="h"><a name="957"></a>957</td><td></td><td></td><td></td><td></td><td class="s"> my @s = $g->_all_successors(@v);</td></tr>
+<tr><td class="h"><a name="958"></a>958</td><td></td><td></td><td></td><td></td><td class="s"> @n{@p} = @p;</td></tr>
+<tr><td class="h"><a name="959"></a>959</td><td></td><td></td><td></td><td></td><td class="s"> @n{@s} = @s;</td></tr>
+<tr><td class="h"><a name="960"></a>960</td><td></td><td></td><td></td><td></td><td class="s"> @v = values %n;</td></tr>
+<tr><td class="h"><a name="961"></a>961</td><td></td><td></td><td></td><td></td><td class="s"> last if @v == $o; # Leave if no growth.</td></tr>
+<tr><td class="h"><a name="962"></a>962</td><td></td><td></td><td></td><td></td><td class="s"> $o = @v;</td></tr>
+<tr><td class="h"><a name="963"></a>963</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="964"></a>964</td><td></td><td></td><td></td><td></td><td class="s"> for my $v (@init) {</td></tr>
+<tr><td class="h"><a name="965"></a>965</td><td></td><td></td><td></td><td></td><td class="s"> delete $n{$v} unless $g->has_edge($v, $v);</td></tr>
+<tr><td class="h"><a name="966"></a>966</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="967"></a>967</td><td></td><td></td><td></td><td></td><td class="s"> return values %n;</td></tr>
+<tr><td class="h"><a name="968"></a>968</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="969"></a>969</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="970"></a>970</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*all_neighbors = \&all_neighbours;</td></tr>
+<tr><td class="h"><a name="971"></a>971</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="972"></a>972</td><td></td><td></td><td></td><td></td><td class="s">sub all_reachable {</td></tr>
+<tr><td class="h"><a name="973"></a>973</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="974"></a>974</td><td></td><td></td><td></td><td></td><td class="s"> $g->directed ? $g->all_successors(@_) : $g->all_neighbors(@_);</td></tr>
+<tr><td class="h"><a name="975"></a>975</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="976"></a>976</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="977"></a>977</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 676µs (185+491) within Graph::delete_edge which was called 10 times, avg 68µs/call:
+# 7 times (131µs+343µs) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#892">line 892 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 68µs/call
+# 3 times (54µs+148µs) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#888">line 888 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 68µs/call</div></div>sub delete_edge {</td></tr>
+<tr><td class="h"><a name="978"></a>978</td><td class="c0">90</td><td class="c2"><span title="Avg 2µs">142µs</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="979"></a>979</td><td></td><td></td><td class="c3">10</td><td class="c3">57µs</td><td class="s"> $g->expect_non_unionfind;<div class="calls"><div class="calls_out"> # spent 57µs making 10 calls to <a href="Graph-pm-695-block.html#2123">Graph::expect_non_unionfind</a>, avg 6µs/call</div></div></td></tr>
+<tr><td class="h"><a name="980"></a>980</td><td></td><td></td><td class="c3">10</td><td class="c3">90µs</td><td class="s"> my @i = $g->_vertex_ids( @_ );<div class="calls"><div class="calls_out"> # spent 90µs making 10 calls to <a href="Graph-pm-695-block.html#510">Graph::_vertex_ids</a>, avg 9µs/call</div></div></td></tr>
+<tr><td class="h"><a name="981"></a>981</td><td></td><td></td><td></td><td></td><td class="s"> return $g unless @i;</td></tr>
+<tr><td class="h"><a name="982"></a>982</td><td></td><td></td><td class="c3">10</td><td class="c3">77µs</td><td class="s"> my $i = $g->[ _E ]->_get_path_id( @i );<div class="calls"><div class="calls_out"> # spent 77µs making 10 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#74">Graph::AdjacencyMap::Light::_get_path_id</a>, avg 8µs/call</div></div></td></tr>
+<tr><td class="h"><a name="983"></a>983</td><td></td><td></td><td></td><td></td><td class="s"> return $g unless defined $i;</td></tr>
+<tr><td class="h"><a name="984"></a>984</td><td></td><td></td><td class="c3">10</td><td class="c3">267µs</td><td class="s"> $g->[ _E ]->_del_id( $i );<div class="calls"><div class="calls_out"> # spent 267µs making 10 calls to <a href="Graph-AdjacencyMap-pm-696-block.html#71">Graph::AdjacencyMap::_del_id</a>, avg 27µs/call</div></div></td></tr>
+<tr><td class="h"><a name="985"></a>985</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _G ]++;</td></tr>
+<tr><td class="h"><a name="986"></a>986</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="987"></a>987</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="988"></a>988</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="989"></a>989</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 337ms (3.57+334) within Graph::delete_vertex which was called 107 times, avg 3.15ms/call:
+# 56 times (1.87ms+178ms) by Text::Tradition::Collation::RelationshipStore::_make_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#834">line 834 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 3.20ms/call
+# 51 times (1.70ms+156ms) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#881">line 881 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 3.10ms/call</div></div>sub delete_vertex {</td></tr>
+<tr><td class="h"><a name="990"></a>990</td><td class="c0">963</td><td class="c0"><span title="Avg 2µs">1.93ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="991"></a>991</td><td></td><td></td><td class="c1">107</td><td class="c3">740µs</td><td class="s"> $g->expect_non_unionfind;<div class="calls"><div class="calls_out"> # spent 740µs making 107 calls to <a href="Graph-pm-695-block.html#2123">Graph::expect_non_unionfind</a>, avg 7µs/call</div></div></td></tr>
+<tr><td class="h"><a name="992"></a>992</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="993"></a>993</td><td></td><td></td><td class="c1">107</td><td class="c3">626µs</td><td class="s"> return $g unless $V->has_path( @_ );<div class="calls"><div class="calls_out"> # spent 626µs making 107 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#59">Graph::AdjacencyMap::Light::has_path</a>, avg 6µs/call</div></div></td></tr>
+<tr><td class="h"><a name="994"></a>994</td><td></td><td></td><td></td><td></td><td class="s"> my $E = $g->[ _E ];</td></tr>
+<tr><td class="h"><a name="995"></a>995</td><td></td><td></td><td class="c1">107</td><td class="c0">326ms</td><td class="s"> for my $e ( $g->_edges_at( @_ ) ) {<div class="calls"><div class="calls_out"> # spent 326ms making 107 calls to <a href="Graph-pm-695-block.html#754">Graph::_edges_at</a>, avg 3.04ms/call</div></div></td></tr>
+<tr><td class="h"><a name="996"></a>996</td><td class="c0">222</td><td class="c0"><span title="Avg 4µs">854µs</span></td><td class="c0">222</td><td class="c0">5.90ms</td><td class="s"> $E->_del_id( $e->[ 0 ] );<div class="calls"><div class="calls_out"> # spent 5.90ms making 222 calls to <a href="Graph-AdjacencyMap-pm-696-block.html#71">Graph::AdjacencyMap::_del_id</a>, avg 27µs/call</div></div></td></tr>
+<tr><td class="h"><a name="997"></a>997</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="998"></a>998</td><td></td><td></td><td class="c1">107</td><td class="c3">702µs</td><td class="s"> $V->del_path( @_ );<div class="calls"><div class="calls_out"> # spent 702µs making 107 calls to <a href="Graph-AdjacencyMap-Light-pm-700-block.html#131">Graph::AdjacencyMap::Light::del_path</a>, avg 7µs/call</div></div></td></tr>
+<tr><td class="h"><a name="999"></a>999</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _G ]++;</td></tr>
+<tr><td class="h"><a name="1000"></a>1000</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="1001"></a>1001</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1002"></a>1002</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1003"></a>1003</td><td></td><td></td><td></td><td></td><td class="s">sub get_vertex_count {</td></tr>
+<tr><td class="h"><a name="1004"></a>1004</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1005"></a>1005</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_get_path_count( @_ ) || 0;</td></tr>
+<tr><td class="h"><a name="1006"></a>1006</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1007"></a>1007</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1008"></a>1008</td><td></td><td></td><td></td><td></td><td class="s">sub get_edge_count {</td></tr>
+<tr><td class="h"><a name="1009"></a>1009</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1010"></a>1010</td><td></td><td></td><td></td><td></td><td class="s"> my @e = $g->_vertex_ids( @_ );</td></tr>
+<tr><td class="h"><a name="1011"></a>1011</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless @e;</td></tr>
+<tr><td class="h"><a name="1012"></a>1012</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_get_path_count( @e ) || 0;</td></tr>
+<tr><td class="h"><a name="1013"></a>1013</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1014"></a>1014</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1015"></a>1015</td><td></td><td></td><td></td><td></td><td class="s">sub delete_vertices {</td></tr>
+<tr><td class="h"><a name="1016"></a>1016</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1017"></a>1017</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_unionfind;</td></tr>
+<tr><td class="h"><a name="1018"></a>1018</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="1019"></a>1019</td><td></td><td></td><td></td><td></td><td class="s"> my $v = shift @_;</td></tr>
+<tr><td class="h"><a name="1020"></a>1020</td><td></td><td></td><td></td><td></td><td class="s"> $g->delete_vertex($v);</td></tr>
+<tr><td class="h"><a name="1021"></a>1021</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1022"></a>1022</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="1023"></a>1023</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1024"></a>1024</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1025"></a>1025</td><td></td><td></td><td></td><td></td><td class="s">sub delete_edges {</td></tr>
+<tr><td class="h"><a name="1026"></a>1026</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1027"></a>1027</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_unionfind;</td></tr>
+<tr><td class="h"><a name="1028"></a>1028</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="1029"></a>1029</td><td></td><td></td><td></td><td></td><td class="s"> my ($u, $v) = splice @_, 0, 2;</td></tr>
+<tr><td class="h"><a name="1030"></a>1030</td><td></td><td></td><td></td><td></td><td class="s"> $g->delete_edge($u, $v);</td></tr>
+<tr><td class="h"><a name="1031"></a>1031</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1032"></a>1032</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="1033"></a>1033</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1034"></a>1034</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1035"></a>1035</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="1036"></a>1036</td><td></td><td></td><td></td><td></td><td class="s"># Degrees.</td></tr>
+<tr><td class="h"><a name="1037"></a>1037</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="1038"></a>1038</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1039"></a>1039</td><td></td><td></td><td></td><td></td><td class="s">sub _in_degree {</td></tr>
+<tr><td class="h"><a name="1040"></a>1040</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1041"></a>1041</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless @_ && $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1042"></a>1042</td><td></td><td></td><td></td><td></td><td class="s"> my $in = 0;</td></tr>
+<tr><td class="h"><a name="1043"></a>1043</td><td></td><td></td><td></td><td></td><td class="s"> $in += $g->get_edge_count( @$_ ) for $g->edges_to( @_ );</td></tr>
+<tr><td class="h"><a name="1044"></a>1044</td><td></td><td></td><td></td><td></td><td class="s"> return $in;</td></tr>
+<tr><td class="h"><a name="1045"></a>1045</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1046"></a>1046</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1047"></a>1047</td><td></td><td></td><td></td><td></td><td class="s">sub in_degree {</td></tr>
+<tr><td class="h"><a name="1048"></a>1048</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1049"></a>1049</td><td></td><td></td><td></td><td></td><td class="s"> $g->_in_degree( @_ );</td></tr>
+<tr><td class="h"><a name="1050"></a>1050</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1051"></a>1051</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1052"></a>1052</td><td></td><td></td><td></td><td></td><td class="s">sub _out_degree {</td></tr>
+<tr><td class="h"><a name="1053"></a>1053</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1054"></a>1054</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless @_ && $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1055"></a>1055</td><td></td><td></td><td></td><td></td><td class="s"> my $out = 0;</td></tr>
+<tr><td class="h"><a name="1056"></a>1056</td><td></td><td></td><td></td><td></td><td class="s"> $out += $g->get_edge_count( @$_ ) for $g->edges_from( @_ );</td></tr>
+<tr><td class="h"><a name="1057"></a>1057</td><td></td><td></td><td></td><td></td><td class="s"> return $out;</td></tr>
+<tr><td class="h"><a name="1058"></a>1058</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1059"></a>1059</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1060"></a>1060</td><td></td><td></td><td></td><td></td><td class="s">sub out_degree {</td></tr>
+<tr><td class="h"><a name="1061"></a>1061</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1062"></a>1062</td><td></td><td></td><td></td><td></td><td class="s"> $g->_out_degree( @_ );</td></tr>
+<tr><td class="h"><a name="1063"></a>1063</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1064"></a>1064</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1065"></a>1065</td><td></td><td></td><td></td><td></td><td class="s">sub _total_degree {</td></tr>
+<tr><td class="h"><a name="1066"></a>1066</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1067"></a>1067</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless @_ && $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1068"></a>1068</td><td></td><td></td><td></td><td></td><td class="s"> $g->is_undirected ?</td></tr>
+<tr><td class="h"><a name="1069"></a>1069</td><td></td><td></td><td></td><td></td><td class="s"> $g->_in_degree( @_ ) :</td></tr>
+<tr><td class="h"><a name="1070"></a>1070</td><td></td><td></td><td></td><td></td><td class="s"> $g-> in_degree( @_ ) - $g-> out_degree( @_ );</td></tr>
+<tr><td class="h"><a name="1071"></a>1071</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1072"></a>1072</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1073"></a>1073</td><td></td><td></td><td></td><td></td><td class="s">sub degree {</td></tr>
+<tr><td class="h"><a name="1074"></a>1074</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1075"></a>1075</td><td></td><td></td><td></td><td></td><td class="s"> if (@_) {</td></tr>
+<tr><td class="h"><a name="1076"></a>1076</td><td></td><td></td><td></td><td></td><td class="s"> $g->_total_degree( @_ );</td></tr>
+<tr><td class="h"><a name="1077"></a>1077</td><td></td><td></td><td></td><td></td><td class="s"> } elsif ($g->is_undirected) {</td></tr>
+<tr><td class="h"><a name="1078"></a>1078</td><td></td><td></td><td></td><td></td><td class="s"> my $total = 0;</td></tr>
+<tr><td class="h"><a name="1079"></a>1079</td><td></td><td></td><td></td><td></td><td class="s"> $total += $g->_total_degree( $_ ) for $g->vertices05;</td></tr>
+<tr><td class="h"><a name="1080"></a>1080</td><td></td><td></td><td></td><td></td><td class="s"> return $total;</td></tr>
+<tr><td class="h"><a name="1081"></a>1081</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="1082"></a>1082</td><td></td><td></td><td></td><td></td><td class="s"> return 0;</td></tr>
+<tr><td class="h"><a name="1083"></a>1083</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1084"></a>1084</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1085"></a>1085</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1086"></a>1086</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*vertex_degree = \&degree;</td></tr>
+<tr><td class="h"><a name="1087"></a>1087</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1088"></a>1088</td><td></td><td></td><td></td><td></td><td class="s">sub is_sink_vertex {</td></tr>
+<tr><td class="h"><a name="1089"></a>1089</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1090"></a>1090</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless @_;</td></tr>
+<tr><td class="h"><a name="1091"></a>1091</td><td></td><td></td><td></td><td></td><td class="s"> $g->successors( @_ ) == 0 && $g->predecessors( @_ ) > 0;</td></tr>
+<tr><td class="h"><a name="1092"></a>1092</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1093"></a>1093</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1094"></a>1094</td><td></td><td></td><td></td><td></td><td class="s">sub is_source_vertex {</td></tr>
+<tr><td class="h"><a name="1095"></a>1095</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1096"></a>1096</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless @_;</td></tr>
+<tr><td class="h"><a name="1097"></a>1097</td><td></td><td></td><td></td><td></td><td class="s"> $g->predecessors( @_ ) == 0 && $g->successors( @_ ) > 0;</td></tr>
+<tr><td class="h"><a name="1098"></a>1098</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1099"></a>1099</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1100"></a>1100</td><td></td><td></td><td></td><td></td><td class="s">sub is_successorless_vertex {</td></tr>
+<tr><td class="h"><a name="1101"></a>1101</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1102"></a>1102</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless @_;</td></tr>
+<tr><td class="h"><a name="1103"></a>1103</td><td></td><td></td><td></td><td></td><td class="s"> $g->successors( @_ ) == 0;</td></tr>
+<tr><td class="h"><a name="1104"></a>1104</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1105"></a>1105</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1106"></a>1106</td><td></td><td></td><td></td><td></td><td class="s">sub is_predecessorless_vertex {</td></tr>
+<tr><td class="h"><a name="1107"></a>1107</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1108"></a>1108</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless @_;</td></tr>
+<tr><td class="h"><a name="1109"></a>1109</td><td></td><td></td><td></td><td></td><td class="s"> $g->predecessors( @_ ) == 0;</td></tr>
+<tr><td class="h"><a name="1110"></a>1110</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1111"></a>1111</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1112"></a>1112</td><td></td><td></td><td></td><td></td><td class="s">sub is_successorful_vertex {</td></tr>
+<tr><td class="h"><a name="1113"></a>1113</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1114"></a>1114</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless @_;</td></tr>
+<tr><td class="h"><a name="1115"></a>1115</td><td></td><td></td><td></td><td></td><td class="s"> $g->successors( @_ ) > 0;</td></tr>
+<tr><td class="h"><a name="1116"></a>1116</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1117"></a>1117</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1118"></a>1118</td><td></td><td></td><td></td><td></td><td class="s">sub is_predecessorful_vertex {</td></tr>
+<tr><td class="h"><a name="1119"></a>1119</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1120"></a>1120</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless @_;</td></tr>
+<tr><td class="h"><a name="1121"></a>1121</td><td></td><td></td><td></td><td></td><td class="s"> $g->predecessors( @_ ) > 0;</td></tr>
+<tr><td class="h"><a name="1122"></a>1122</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1123"></a>1123</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1124"></a>1124</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 1.78s (388ms+1.39) within Graph::is_isolated_vertex which was called 108940 times, avg 16µs/call:
+# 108940 times (388ms+1.39s) by Graph::isolated_vertices at <a href="Graph-pm-695-block.html#1189">line 1189</a>, avg 16µs/call</div></div>sub is_isolated_vertex {</td></tr>
+<tr><td class="h"><a name="1125"></a>1125</td><td class="c0">326820</td><td class="c0"><span title="Avg 933ns">305ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1126"></a>1126</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless @_;</td></tr>
+<tr><td class="h"><a name="1127"></a>1127</td><td></td><td></td><td class="c0">109042</td><td class="c0">1.39s</td><td class="s"> $g->predecessors( @_ ) == 0 && $g->successors( @_ ) == 0;<div class="calls"><div class="calls_out"> # spent 1.39s making 108940 calls to <a href="Graph-pm-695-block.html#868">Graph::predecessors</a>, avg 13µs/call
+ # spent 1.98ms making 102 calls to <a href="Graph-pm-695-block.html#860">Graph::successors</a>, avg 19µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1128"></a>1128</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1129"></a>1129</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1130"></a>1130</td><td></td><td></td><td></td><td></td><td class="s">sub is_interior_vertex {</td></tr>
+<tr><td class="h"><a name="1131"></a>1131</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1132"></a>1132</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless @_;</td></tr>
+<tr><td class="h"><a name="1133"></a>1133</td><td></td><td></td><td></td><td></td><td class="s"> my $p = $g->predecessors( @_ );</td></tr>
+<tr><td class="h"><a name="1134"></a>1134</td><td></td><td></td><td></td><td></td><td class="s"> my $s = $g->successors( @_ );</td></tr>
+<tr><td class="h"><a name="1135"></a>1135</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->is_self_loop_vertex( @_ )) {</td></tr>
+<tr><td class="h"><a name="1136"></a>1136</td><td></td><td></td><td></td><td></td><td class="s"> $p--;</td></tr>
+<tr><td class="h"><a name="1137"></a>1137</td><td></td><td></td><td></td><td></td><td class="s"> $s--;</td></tr>
+<tr><td class="h"><a name="1138"></a>1138</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1139"></a>1139</td><td></td><td></td><td></td><td></td><td class="s"> $p > 0 && $s > 0;</td></tr>
+<tr><td class="h"><a name="1140"></a>1140</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1141"></a>1141</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1142"></a>1142</td><td></td><td></td><td></td><td></td><td class="s">sub is_exterior_vertex {</td></tr>
+<tr><td class="h"><a name="1143"></a>1143</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1144"></a>1144</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless @_;</td></tr>
+<tr><td class="h"><a name="1145"></a>1145</td><td></td><td></td><td></td><td></td><td class="s"> $g->predecessors( @_ ) == 0 || $g->successors( @_ ) == 0;</td></tr>
+<tr><td class="h"><a name="1146"></a>1146</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1147"></a>1147</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1148"></a>1148</td><td></td><td></td><td></td><td></td><td class="s">sub is_self_loop_vertex {</td></tr>
+<tr><td class="h"><a name="1149"></a>1149</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1150"></a>1150</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless @_;</td></tr>
+<tr><td class="h"><a name="1151"></a>1151</td><td></td><td></td><td></td><td></td><td class="s"> for my $s ( $g->successors( @_ ) ) {</td></tr>
+<tr><td class="h"><a name="1152"></a>1152</td><td></td><td></td><td></td><td></td><td class="s"> return 1 if $s eq $_[0]; # @todo: multiedges, hypervertices</td></tr>
+<tr><td class="h"><a name="1153"></a>1153</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1154"></a>1154</td><td></td><td></td><td></td><td></td><td class="s"> return 0;</td></tr>
+<tr><td class="h"><a name="1155"></a>1155</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1156"></a>1156</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1157"></a>1157</td><td></td><td></td><td></td><td></td><td class="s">sub sink_vertices {</td></tr>
+<tr><td class="h"><a name="1158"></a>1158</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1159"></a>1159</td><td></td><td></td><td></td><td></td><td class="s"> grep { $g->is_sink_vertex($_) } $g->vertices05;</td></tr>
+<tr><td class="h"><a name="1160"></a>1160</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1161"></a>1161</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1162"></a>1162</td><td></td><td></td><td></td><td></td><td class="s">sub source_vertices {</td></tr>
+<tr><td class="h"><a name="1163"></a>1163</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1164"></a>1164</td><td></td><td></td><td></td><td></td><td class="s"> grep { $g->is_source_vertex($_) } $g->vertices05;</td></tr>
+<tr><td class="h"><a name="1165"></a>1165</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1166"></a>1166</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1167"></a>1167</td><td></td><td></td><td></td><td></td><td class="s">sub successorless_vertices {</td></tr>
+<tr><td class="h"><a name="1168"></a>1168</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1169"></a>1169</td><td></td><td></td><td></td><td></td><td class="s"> grep { $g->is_successorless_vertex($_) } $g->vertices05;</td></tr>
+<tr><td class="h"><a name="1170"></a>1170</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1171"></a>1171</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1172"></a>1172</td><td></td><td></td><td></td><td></td><td class="s">sub predecessorless_vertices {</td></tr>
+<tr><td class="h"><a name="1173"></a>1173</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1174"></a>1174</td><td></td><td></td><td></td><td></td><td class="s"> grep { $g->is_predecessorless_vertex($_) } $g->vertices05;</td></tr>
+<tr><td class="h"><a name="1175"></a>1175</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1176"></a>1176</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1177"></a>1177</td><td></td><td></td><td></td><td></td><td class="s">sub successorful_vertices {</td></tr>
+<tr><td class="h"><a name="1178"></a>1178</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1179"></a>1179</td><td></td><td></td><td></td><td></td><td class="s"> grep { $g->is_successorful_vertex($_) } $g->vertices05;</td></tr>
+<tr><td class="h"><a name="1180"></a>1180</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1181"></a>1181</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1182"></a>1182</td><td></td><td></td><td></td><td></td><td class="s">sub predecessorful_vertices {</td></tr>
+<tr><td class="h"><a name="1183"></a>1183</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1184"></a>1184</td><td></td><td></td><td></td><td></td><td class="s"> grep { $g->is_predecessorful_vertex($_) } $g->vertices05;</td></tr>
+<tr><td class="h"><a name="1185"></a>1185</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1186"></a>1186</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1187"></a>1187</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 2.23s (271ms+1.96) within Graph::isolated_vertices which was called 102 times, avg 21.9ms/call:
+# 102 times (271ms+1.96s) by Graph::stringify at <a href="Graph-pm-695-block.html#103">line 103</a>, avg 21.9ms/call</div></div>sub isolated_vertices {</td></tr>
+<tr><td class="h"><a name="1188"></a>1188</td><td class="c0">204</td><td class="c0"><span title="Avg 241µs">49.1ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1189"></a>1189</td><td class="c0">108940</td><td class="c0"><span title="Avg 1µs">148ms</span></td><td class="c0">109042</td><td class="c0">1.96s</td><td class="s"> grep { $g->is_isolated_vertex($_) } $g->vertices05;<div class="calls"><div class="calls_out"> # spent 1.78s making 108940 calls to <a href="Graph-pm-695-block.html#1124">Graph::is_isolated_vertex</a>, avg 16µs/call
+ # spent 177ms making 102 calls to <a href="Graph-pm-695-block.html#409">Graph::vertices05</a>, avg 1.74ms/call</div></div></td></tr>
+<tr><td class="h"><a name="1190"></a>1190</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1191"></a>1191</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1192"></a>1192</td><td></td><td></td><td></td><td></td><td class="s">sub interior_vertices {</td></tr>
+<tr><td class="h"><a name="1193"></a>1193</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1194"></a>1194</td><td></td><td></td><td></td><td></td><td class="s"> grep { $g->is_interior_vertex($_) } $g->vertices05;</td></tr>
+<tr><td class="h"><a name="1195"></a>1195</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1196"></a>1196</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1197"></a>1197</td><td></td><td></td><td></td><td></td><td class="s">sub exterior_vertices {</td></tr>
+<tr><td class="h"><a name="1198"></a>1198</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1199"></a>1199</td><td></td><td></td><td></td><td></td><td class="s"> grep { $g->is_exterior_vertex($_) } $g->vertices05;</td></tr>
+<tr><td class="h"><a name="1200"></a>1200</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1201"></a>1201</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1202"></a>1202</td><td></td><td></td><td></td><td></td><td class="s">sub self_loop_vertices {</td></tr>
+<tr><td class="h"><a name="1203"></a>1203</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1204"></a>1204</td><td></td><td></td><td></td><td></td><td class="s"> grep { $g->is_self_loop_vertex($_) } $g->vertices05;</td></tr>
+<tr><td class="h"><a name="1205"></a>1205</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1206"></a>1206</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1207"></a>1207</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="1208"></a>1208</td><td></td><td></td><td></td><td></td><td class="s"># Paths and cycles.</td></tr>
+<tr><td class="h"><a name="1209"></a>1209</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="1210"></a>1210</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1211"></a>1211</td><td></td><td></td><td></td><td></td><td class="s">sub add_path {</td></tr>
+<tr><td class="h"><a name="1212"></a>1212</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1213"></a>1213</td><td></td><td></td><td></td><td></td><td class="s"> my $u = shift;</td></tr>
+<tr><td class="h"><a name="1214"></a>1214</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="1215"></a>1215</td><td></td><td></td><td></td><td></td><td class="s"> my $v = shift;</td></tr>
+<tr><td class="h"><a name="1216"></a>1216</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge($u, $v);</td></tr>
+<tr><td class="h"><a name="1217"></a>1217</td><td></td><td></td><td></td><td></td><td class="s"> $u = $v;</td></tr>
+<tr><td class="h"><a name="1218"></a>1218</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1219"></a>1219</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="1220"></a>1220</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1221"></a>1221</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1222"></a>1222</td><td></td><td></td><td></td><td></td><td class="s">sub delete_path {</td></tr>
+<tr><td class="h"><a name="1223"></a>1223</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1224"></a>1224</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_unionfind;</td></tr>
+<tr><td class="h"><a name="1225"></a>1225</td><td></td><td></td><td></td><td></td><td class="s"> my $u = shift;</td></tr>
+<tr><td class="h"><a name="1226"></a>1226</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="1227"></a>1227</td><td></td><td></td><td></td><td></td><td class="s"> my $v = shift;</td></tr>
+<tr><td class="h"><a name="1228"></a>1228</td><td></td><td></td><td></td><td></td><td class="s"> $g->delete_edge($u, $v);</td></tr>
+<tr><td class="h"><a name="1229"></a>1229</td><td></td><td></td><td></td><td></td><td class="s"> $u = $v;</td></tr>
+<tr><td class="h"><a name="1230"></a>1230</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1231"></a>1231</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="1232"></a>1232</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1233"></a>1233</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1234"></a>1234</td><td></td><td></td><td></td><td></td><td class="s">sub has_path {</td></tr>
+<tr><td class="h"><a name="1235"></a>1235</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1236"></a>1236</td><td></td><td></td><td></td><td></td><td class="s"> my $u = shift;</td></tr>
+<tr><td class="h"><a name="1237"></a>1237</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="1238"></a>1238</td><td></td><td></td><td></td><td></td><td class="s"> my $v = shift;</td></tr>
+<tr><td class="h"><a name="1239"></a>1239</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless $g->has_edge($u, $v);</td></tr>
+<tr><td class="h"><a name="1240"></a>1240</td><td></td><td></td><td></td><td></td><td class="s"> $u = $v;</td></tr>
+<tr><td class="h"><a name="1241"></a>1241</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1242"></a>1242</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="1243"></a>1243</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1244"></a>1244</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1245"></a>1245</td><td></td><td></td><td></td><td></td><td class="s">sub add_cycle {</td></tr>
+<tr><td class="h"><a name="1246"></a>1246</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1247"></a>1247</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_path(@_, $_[0]);</td></tr>
+<tr><td class="h"><a name="1248"></a>1248</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1249"></a>1249</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1250"></a>1250</td><td></td><td></td><td></td><td></td><td class="s">sub delete_cycle {</td></tr>
+<tr><td class="h"><a name="1251"></a>1251</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1252"></a>1252</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_unionfind;</td></tr>
+<tr><td class="h"><a name="1253"></a>1253</td><td></td><td></td><td></td><td></td><td class="s"> $g->delete_path(@_, $_[0]);</td></tr>
+<tr><td class="h"><a name="1254"></a>1254</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1255"></a>1255</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1256"></a>1256</td><td></td><td></td><td></td><td></td><td class="s">sub has_cycle {</td></tr>
+<tr><td class="h"><a name="1257"></a>1257</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1258"></a>1258</td><td></td><td></td><td></td><td></td><td class="s"> @_ ? ($g->has_path(@_, $_[0]) ? 1 : 0) : 0;</td></tr>
+<tr><td class="h"><a name="1259"></a>1259</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1260"></a>1260</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1261"></a>1261</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 10.7s (159ms+10.5) within Graph::has_a_cycle which was called 51 times, avg 209ms/call:
+# 51 times (159ms+10.5s) by Text::Tradition::Collation::RelationshipStore::test_equivalence at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#882">line 882 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 209ms/call</div></div>sub has_a_cycle {</td></tr>
+<tr><td class="h"><a name="1262"></a>1262</td><td class="c0">306</td><td class="c0"><span title="Avg 520µs">159ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1263"></a>1263</td><td></td><td></td><td></td><td></td><td class="s"> my @r = ( back_edge => \&Graph::Traversal::has_a_cycle );</td></tr>
+<tr><td class="h"><a name="1264"></a>1264</td><td></td><td></td><td class="c3">51</td><td class="c3">431µs</td><td class="s"> push @r,<div class="calls"><div class="calls_out"> # spent 431µs making 51 calls to <a href="Graph-pm-695-block.html#340">Graph::omniedged</a>, avg 8µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1265"></a>1265</td><td></td><td></td><td></td><td></td><td class="s"> down_edge => \&Graph::Traversal::has_a_cycle</td></tr>
+<tr><td class="h"><a name="1266"></a>1266</td><td></td><td></td><td></td><td></td><td class="s"> if $g->is_undirected;</td></tr>
+<tr><td class="h"><a name="1267"></a>1267</td><td></td><td></td><td class="c3">51</td><td class="c0">206ms</td><td class="s"> my $t = Graph::Traversal::DFS->new($g, @r, @_);<div class="calls"><div class="calls_out"> # spent 206ms making 51 calls to <a href="Graph-Traversal-pm-713-block.html#158">Graph::Traversal::new</a>, avg 4.05ms/call</div></div></td></tr>
+<tr><td class="h"><a name="1268"></a>1268</td><td></td><td></td><td class="c3">51</td><td class="c0">10.3s</td><td class="s"> $t->dfs;<div class="calls"><div class="calls_out"> # spent 10.3s making 51 calls to <a href="Graph-Traversal-pm-713-block.html#361">Graph::Traversal::postorder</a>, avg 202ms/call</div></div></td></tr>
+<tr><td class="h"><a name="1269"></a>1269</td><td></td><td></td><td class="c3">51</td><td class="c3">196µs</td><td class="s"> return $t->get_state('has_a_cycle');<div class="calls"><div class="calls_out"> # spent 196µs making 51 calls to <a href="Graph-Traversal-pm-713-block.html#439">Graph::Traversal::get_state</a>, avg 4µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1270"></a>1270</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1271"></a>1271</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1272"></a>1272</td><td></td><td></td><td></td><td></td><td class="s">sub find_a_cycle {</td></tr>
+<tr><td class="h"><a name="1273"></a>1273</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1274"></a>1274</td><td></td><td></td><td></td><td></td><td class="s"> my @r = ( back_edge => \&Graph::Traversal::find_a_cycle);</td></tr>
+<tr><td class="h"><a name="1275"></a>1275</td><td></td><td></td><td></td><td></td><td class="s"> push @r,</td></tr>
+<tr><td class="h"><a name="1276"></a>1276</td><td></td><td></td><td></td><td></td><td class="s"> down_edge => \&Graph::Traversal::find_a_cycle</td></tr>
+<tr><td class="h"><a name="1277"></a>1277</td><td></td><td></td><td></td><td></td><td class="s"> if $g->is_undirected;</td></tr>
+<tr><td class="h"><a name="1278"></a>1278</td><td></td><td></td><td></td><td></td><td class="s"> my $t = Graph::Traversal::DFS->new($g, @r, @_);</td></tr>
+<tr><td class="h"><a name="1279"></a>1279</td><td></td><td></td><td></td><td></td><td class="s"> $t->dfs;</td></tr>
+<tr><td class="h"><a name="1280"></a>1280</td><td></td><td></td><td></td><td></td><td class="s"> $t->has_state('a_cycle') ? @{ $t->get_state('a_cycle') } : ();</td></tr>
+<tr><td class="h"><a name="1281"></a>1281</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1282"></a>1282</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1283"></a>1283</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="1284"></a>1284</td><td></td><td></td><td></td><td></td><td class="s"># Attributes.</td></tr>
+<tr><td class="h"><a name="1285"></a>1285</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1286"></a>1286</td><td></td><td></td><td></td><td></td><td class="s"># Vertex attributes.</td></tr>
+<tr><td class="h"><a name="1287"></a>1287</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1288"></a>1288</td><td></td><td></td><td></td><td></td><td class="s">sub set_vertex_attribute {</td></tr>
+<tr><td class="h"><a name="1289"></a>1289</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1290"></a>1290</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1291"></a>1291</td><td></td><td></td><td></td><td></td><td class="s"> my $value = pop;</td></tr>
+<tr><td class="h"><a name="1292"></a>1292</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1293"></a>1293</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_vertex( @_ ) unless $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1294"></a>1294</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_set_path_attr( @_, $attr, $value );</td></tr>
+<tr><td class="h"><a name="1295"></a>1295</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1296"></a>1296</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1297"></a>1297</td><td></td><td></td><td></td><td></td><td class="s">sub set_vertex_attribute_by_id {</td></tr>
+<tr><td class="h"><a name="1298"></a>1298</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1299"></a>1299</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1300"></a>1300</td><td></td><td></td><td></td><td></td><td class="s"> my $value = pop;</td></tr>
+<tr><td class="h"><a name="1301"></a>1301</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1302"></a>1302</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_vertex_by_id( @_ ) unless $g->has_vertex_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1303"></a>1303</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_set_path_attr( @_, $attr, $value );</td></tr>
+<tr><td class="h"><a name="1304"></a>1304</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1305"></a>1305</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1306"></a>1306</td><td></td><td></td><td></td><td></td><td class="s">sub set_vertex_attributes {</td></tr>
+<tr><td class="h"><a name="1307"></a>1307</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1308"></a>1308</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1309"></a>1309</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1310"></a>1310</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_vertex( @_ ) unless $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1311"></a>1311</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_set_path_attrs( @_, $attr );</td></tr>
+<tr><td class="h"><a name="1312"></a>1312</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1313"></a>1313</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1314"></a>1314</td><td></td><td></td><td></td><td></td><td class="s">sub set_vertex_attributes_by_id {</td></tr>
+<tr><td class="h"><a name="1315"></a>1315</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1316"></a>1316</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1317"></a>1317</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1318"></a>1318</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_vertex_by_id( @_ ) unless $g->has_vertex_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1319"></a>1319</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_set_path_attrs( @_, $attr );</td></tr>
+<tr><td class="h"><a name="1320"></a>1320</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1321"></a>1321</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1322"></a>1322</td><td></td><td></td><td></td><td></td><td class="s">sub has_vertex_attributes {</td></tr>
+<tr><td class="h"><a name="1323"></a>1323</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1324"></a>1324</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1325"></a>1325</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1326"></a>1326</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_has_path_attrs( @_ );</td></tr>
+<tr><td class="h"><a name="1327"></a>1327</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1328"></a>1328</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1329"></a>1329</td><td></td><td></td><td></td><td></td><td class="s">sub has_vertex_attributes_by_id {</td></tr>
+<tr><td class="h"><a name="1330"></a>1330</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1331"></a>1331</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1332"></a>1332</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless $g->has_vertex_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1333"></a>1333</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_has_path_attrs( @_ );</td></tr>
+<tr><td class="h"><a name="1334"></a>1334</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1335"></a>1335</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1336"></a>1336</td><td></td><td></td><td></td><td></td><td class="s">sub has_vertex_attribute {</td></tr>
+<tr><td class="h"><a name="1337"></a>1337</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1338"></a>1338</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1339"></a>1339</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1340"></a>1340</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1341"></a>1341</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_has_path_attr( @_, $attr );</td></tr>
+<tr><td class="h"><a name="1342"></a>1342</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1343"></a>1343</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1344"></a>1344</td><td></td><td></td><td></td><td></td><td class="s">sub has_vertex_attribute_by_id {</td></tr>
+<tr><td class="h"><a name="1345"></a>1345</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1346"></a>1346</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1347"></a>1347</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1348"></a>1348</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless $g->has_vertex_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1349"></a>1349</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_has_path_attr( @_, $attr );</td></tr>
+<tr><td class="h"><a name="1350"></a>1350</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1351"></a>1351</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1352"></a>1352</td><td></td><td></td><td></td><td></td><td class="s">sub get_vertex_attributes {</td></tr>
+<tr><td class="h"><a name="1353"></a>1353</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1354"></a>1354</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1355"></a>1355</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1356"></a>1356</td><td></td><td></td><td></td><td></td><td class="s"> my $a = $g->[ _V ]->_get_path_attrs( @_ );</td></tr>
+<tr><td class="h"><a name="1357"></a>1357</td><td></td><td></td><td></td><td></td><td class="s"> ($g->is_compat02) ? (defined $a ? %{ $a } : ()) : $a;</td></tr>
+<tr><td class="h"><a name="1358"></a>1358</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1359"></a>1359</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1360"></a>1360</td><td></td><td></td><td></td><td></td><td class="s">sub get_vertex_attributes_by_id {</td></tr>
+<tr><td class="h"><a name="1361"></a>1361</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1362"></a>1362</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1363"></a>1363</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_vertex_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1364"></a>1364</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_get_path_attrs( @_ );</td></tr>
+<tr><td class="h"><a name="1365"></a>1365</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1366"></a>1366</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1367"></a>1367</td><td></td><td></td><td></td><td></td><td class="s">sub get_vertex_attribute {</td></tr>
+<tr><td class="h"><a name="1368"></a>1368</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1369"></a>1369</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1370"></a>1370</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1371"></a>1371</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1372"></a>1372</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_get_path_attr( @_, $attr );</td></tr>
+<tr><td class="h"><a name="1373"></a>1373</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1374"></a>1374</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1375"></a>1375</td><td></td><td></td><td></td><td></td><td class="s">sub get_vertex_attribute_by_id {</td></tr>
+<tr><td class="h"><a name="1376"></a>1376</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1377"></a>1377</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1378"></a>1378</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1379"></a>1379</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_vertex_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1380"></a>1380</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_get_path_attr( @_, $attr );</td></tr>
+<tr><td class="h"><a name="1381"></a>1381</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1382"></a>1382</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1383"></a>1383</td><td></td><td></td><td></td><td></td><td class="s">sub get_vertex_attribute_names {</td></tr>
+<tr><td class="h"><a name="1384"></a>1384</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1385"></a>1385</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1386"></a>1386</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1387"></a>1387</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_get_path_attr_names( @_ );</td></tr>
+<tr><td class="h"><a name="1388"></a>1388</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1389"></a>1389</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1390"></a>1390</td><td></td><td></td><td></td><td></td><td class="s">sub get_vertex_attribute_names_by_id {</td></tr>
+<tr><td class="h"><a name="1391"></a>1391</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1392"></a>1392</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1393"></a>1393</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_vertex_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1394"></a>1394</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_get_path_attr_names( @_ );</td></tr>
+<tr><td class="h"><a name="1395"></a>1395</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1396"></a>1396</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1397"></a>1397</td><td></td><td></td><td></td><td></td><td class="s">sub get_vertex_attribute_values {</td></tr>
+<tr><td class="h"><a name="1398"></a>1398</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1399"></a>1399</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1400"></a>1400</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1401"></a>1401</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_get_path_attr_values( @_ );</td></tr>
+<tr><td class="h"><a name="1402"></a>1402</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1403"></a>1403</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1404"></a>1404</td><td></td><td></td><td></td><td></td><td class="s">sub get_vertex_attribute_values_by_id {</td></tr>
+<tr><td class="h"><a name="1405"></a>1405</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1406"></a>1406</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1407"></a>1407</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_vertex_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1408"></a>1408</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_get_path_attr_values( @_ );</td></tr>
+<tr><td class="h"><a name="1409"></a>1409</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1410"></a>1410</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1411"></a>1411</td><td></td><td></td><td></td><td></td><td class="s">sub delete_vertex_attributes {</td></tr>
+<tr><td class="h"><a name="1412"></a>1412</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1413"></a>1413</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1414"></a>1414</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1415"></a>1415</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_del_path_attrs( @_ );</td></tr>
+<tr><td class="h"><a name="1416"></a>1416</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1417"></a>1417</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1418"></a>1418</td><td></td><td></td><td></td><td></td><td class="s">sub delete_vertex_attributes_by_id {</td></tr>
+<tr><td class="h"><a name="1419"></a>1419</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1420"></a>1420</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1421"></a>1421</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless $g->has_vertex_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1422"></a>1422</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_del_path_attrs( @_ );</td></tr>
+<tr><td class="h"><a name="1423"></a>1423</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1424"></a>1424</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1425"></a>1425</td><td></td><td></td><td></td><td></td><td class="s">sub delete_vertex_attribute {</td></tr>
+<tr><td class="h"><a name="1426"></a>1426</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1427"></a>1427</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1428"></a>1428</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1429"></a>1429</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1430"></a>1430</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_del_path_attr( @_, $attr );</td></tr>
+<tr><td class="h"><a name="1431"></a>1431</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1432"></a>1432</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1433"></a>1433</td><td></td><td></td><td></td><td></td><td class="s">sub delete_vertex_attribute_by_id {</td></tr>
+<tr><td class="h"><a name="1434"></a>1434</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1435"></a>1435</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1436"></a>1436</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1437"></a>1437</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless $g->has_vertex_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1438"></a>1438</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _V ]->_del_path_attr( @_, $attr );</td></tr>
+<tr><td class="h"><a name="1439"></a>1439</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1440"></a>1440</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1441"></a>1441</td><td></td><td></td><td></td><td></td><td class="s"># Edge attributes.</td></tr>
+<tr><td class="h"><a name="1442"></a>1442</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1443"></a>1443</td><td></td><td></td><td></td><td></td><td class="s">sub _set_edge_attribute {</td></tr>
+<tr><td class="h"><a name="1444"></a>1444</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1445"></a>1445</td><td></td><td></td><td></td><td></td><td class="s"> my $value = pop;</td></tr>
+<tr><td class="h"><a name="1446"></a>1446</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1447"></a>1447</td><td></td><td></td><td></td><td></td><td class="s"> my $E = $g->[ _E ];</td></tr>
+<tr><td class="h"><a name="1448"></a>1448</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $E->[ _f ];</td></tr>
+<tr><td class="h"><a name="1449"></a>1449</td><td></td><td></td><td></td><td></td><td class="s"> my @i;</td></tr>
+<tr><td class="h"><a name="1450"></a>1450</td><td></td><td></td><td></td><td></td><td class="s"> if ($E->[ _a ] == 2 && @_ == 2 && !($f & (_HYPER|_REF|_UNIQ))) { # Fast path.</td></tr>
+<tr><td class="h"><a name="1451"></a>1451</td><td></td><td></td><td></td><td></td><td class="s"> @_ = sort @_ if ($f & _UNORD);</td></tr>
+<tr><td class="h"><a name="1452"></a>1452</td><td></td><td></td><td></td><td></td><td class="s"> my $s = $E->[ _s ];</td></tr>
+<tr><td class="h"><a name="1453"></a>1453</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge( @_ ) unless exists $s->{ $_[0] } && exists $s->{ $_[0] }->{ $_[1] };</td></tr>
+<tr><td class="h"><a name="1454"></a>1454</td><td></td><td></td><td></td><td></td><td class="s"> @i = @{ $g->[ _V ]->[ _s ] }{ @_ };</td></tr>
+<tr><td class="h"><a name="1455"></a>1455</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="1456"></a>1456</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge( @_ ) unless $g->has_edge( @_ );</td></tr>
+<tr><td class="h"><a name="1457"></a>1457</td><td></td><td></td><td></td><td></td><td class="s"> @i = $g->_vertex_ids( @_ );</td></tr>
+<tr><td class="h"><a name="1458"></a>1458</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1459"></a>1459</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_set_path_attr( @i, $attr, $value );</td></tr>
+<tr><td class="h"><a name="1460"></a>1460</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1461"></a>1461</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1462"></a>1462</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 626ms (140+486) within Graph::set_edge_attribute which was called 12664 times, avg 49µs/call:
+# 12605 times (139ms+481ms) by Text::Tradition::Collation::add_path at <a href="lib-Text-Tradition-Collation-pm-686-block.html#439">line 439 of lib/Text/Tradition/Collation.pm</a>, avg 49µs/call
+# 59 times (980µs+4.50ms) by Text::Tradition::Collation::RelationshipStore::_set_relationship at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#166">line 166 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 93µs/call</div></div>sub set_edge_attribute {</td></tr>
+<tr><td class="h"><a name="1463"></a>1463</td><td class="c0">88648</td><td class="c0"><span title="Avg 1µs">96.6ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1464"></a>1464</td><td></td><td></td><td class="c0">12664</td><td class="c0">85.2ms</td><td class="s"> $g->expect_non_multiedged;<div class="calls"><div class="calls_out"> # spent 85.2ms making 12664 calls to <a href="Graph-pm-695-block.html#2113">Graph::expect_non_multiedged</a>, avg 7µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1465"></a>1465</td><td></td><td></td><td></td><td></td><td class="s"> my $value = pop;</td></tr>
+<tr><td class="h"><a name="1466"></a>1466</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1467"></a>1467</td><td></td><td></td><td></td><td></td><td class="s"> my $E = $g->[ _E ];</td></tr>
+<tr><td class="h"><a name="1468"></a>1468</td><td></td><td></td><td class="c0">12664</td><td class="c0">97.1ms</td><td class="s"> $g->add_edge( @_ ) unless $g->has_edge( @_ );<div class="calls"><div class="calls_out"> # spent 97.1ms making 12664 calls to <a href="Graph-pm-695-block.html#530">Graph::has_edge</a>, avg 8µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1469"></a>1469</td><td></td><td></td><td class="c0">25328</td><td class="c0">303ms</td><td class="s"> $E->_set_path_attr( $g->_vertex_ids( @_ ), $attr, $value );<div class="calls"><div class="calls_out"> # spent 214ms making 12664 calls to <a href="Graph-AdjacencyMap-pm-696-block.html#199">Graph::AdjacencyMap::_set_path_attr</a>, avg 17µs/call
+ # spent 89.4ms making 12664 calls to <a href="Graph-pm-695-block.html#510">Graph::_vertex_ids</a>, avg 7µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1470"></a>1470</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1471"></a>1471</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1472"></a>1472</td><td></td><td></td><td></td><td></td><td class="s">sub set_edge_attribute_by_id {</td></tr>
+<tr><td class="h"><a name="1473"></a>1473</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1474"></a>1474</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="1475"></a>1475</td><td></td><td></td><td></td><td></td><td class="s"> my $value = pop;</td></tr>
+<tr><td class="h"><a name="1476"></a>1476</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1477"></a>1477</td><td></td><td></td><td></td><td></td><td class="s"> # $g->add_edge_by_id( @_ ) unless $g->has_edge_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1478"></a>1478</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="1479"></a>1479</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_set_path_attr( $g->_vertex_ids( @_ ), $id, $attr, $value );</td></tr>
+<tr><td class="h"><a name="1480"></a>1480</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1481"></a>1481</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1482"></a>1482</td><td></td><td></td><td></td><td></td><td class="s">sub set_edge_attributes {</td></tr>
+<tr><td class="h"><a name="1483"></a>1483</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1484"></a>1484</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multiedged;</td></tr>
+<tr><td class="h"><a name="1485"></a>1485</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1486"></a>1486</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge( @_ ) unless $g->has_edge( @_ );</td></tr>
+<tr><td class="h"><a name="1487"></a>1487</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_set_path_attrs( $g->_vertex_ids( @_ ), $attr );</td></tr>
+<tr><td class="h"><a name="1488"></a>1488</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1489"></a>1489</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1490"></a>1490</td><td></td><td></td><td></td><td></td><td class="s">sub set_edge_attributes_by_id {</td></tr>
+<tr><td class="h"><a name="1491"></a>1491</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1492"></a>1492</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="1493"></a>1493</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1494"></a>1494</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge_by_id( @_ ) unless $g->has_edge_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1495"></a>1495</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="1496"></a>1496</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_set_path_attrs( $g->_vertex_ids( @_ ), $id, $attr );</td></tr>
+<tr><td class="h"><a name="1497"></a>1497</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1498"></a>1498</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1499"></a>1499</td><td></td><td></td><td></td><td></td><td class="s">sub has_edge_attributes {</td></tr>
+<tr><td class="h"><a name="1500"></a>1500</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1501"></a>1501</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multiedged;</td></tr>
+<tr><td class="h"><a name="1502"></a>1502</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless $g->has_edge( @_ );</td></tr>
+<tr><td class="h"><a name="1503"></a>1503</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_has_path_attrs( $g->_vertex_ids( @_ ) );</td></tr>
+<tr><td class="h"><a name="1504"></a>1504</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1505"></a>1505</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1506"></a>1506</td><td></td><td></td><td></td><td></td><td class="s">sub has_edge_attributes_by_id {</td></tr>
+<tr><td class="h"><a name="1507"></a>1507</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1508"></a>1508</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="1509"></a>1509</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless $g->has_edge_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1510"></a>1510</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="1511"></a>1511</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_has_path_attrs( $g->_vertex_ids( @_ ), $id );</td></tr>
+<tr><td class="h"><a name="1512"></a>1512</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1513"></a>1513</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1514"></a>1514</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 790ms (161+629) within Graph::has_edge_attribute which was called 13355 times, avg 59µs/call:
+# 13187 times (159ms+623ms) by Text::Tradition::Collation::_find_linked_reading at <a href="lib-Text-Tradition-Collation-pm-686-block.html#1317">line 1317 of lib/Text/Tradition/Collation.pm</a>, avg 59µs/call
+# 168 times (1.67ms+6.09ms) by Text::Tradition::Collation::RelationshipStore::get_relationship at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#157">line 157 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 46µs/call</div></div>sub has_edge_attribute {</td></tr>
+<tr><td class="h"><a name="1515"></a>1515</td><td class="c0">66616</td><td class="c0"><span title="Avg 2µs">106ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1516"></a>1516</td><td></td><td></td><td class="c0">13355</td><td class="c0">102ms</td><td class="s"> $g->expect_non_multiedged;<div class="calls"><div class="calls_out"> # spent 102ms making 13355 calls to <a href="Graph-pm-695-block.html#2113">Graph::expect_non_multiedged</a>, avg 8µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1517"></a>1517</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1518"></a>1518</td><td></td><td></td><td class="c0">13355</td><td class="c0">131ms</td><td class="s"> return 0 unless $g->has_edge( @_ );<div class="calls"><div class="calls_out"> # spent 131ms making 13355 calls to <a href="Graph-pm-695-block.html#530">Graph::has_edge</a>, avg 10µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1519"></a>1519</td><td></td><td></td><td class="c0">26392</td><td class="c0">396ms</td><td class="s"> $g->[ _E ]->_has_path_attr( $g->_vertex_ids( @_ ), $attr );<div class="calls"><div class="calls_out"> # spent 300ms making 13196 calls to <a href="Graph-AdjacencyMap-pm-696-block.html#180">Graph::AdjacencyMap::_has_path_attr</a>, avg 23µs/call
+ # spent 96.6ms making 13196 calls to <a href="Graph-pm-695-block.html#510">Graph::_vertex_ids</a>, avg 7µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1520"></a>1520</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1521"></a>1521</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1522"></a>1522</td><td></td><td></td><td></td><td></td><td class="s">sub has_edge_attribute_by_id {</td></tr>
+<tr><td class="h"><a name="1523"></a>1523</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1524"></a>1524</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="1525"></a>1525</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1526"></a>1526</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless $g->has_edge_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1527"></a>1527</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="1528"></a>1528</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_has_path_attr( $g->_vertex_ids( @_ ), $id, $attr );</td></tr>
+<tr><td class="h"><a name="1529"></a>1529</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1530"></a>1530</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1531"></a>1531</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 916ms (214+701) within Graph::get_edge_attributes which was called 15571 times, avg 59µs/call:
+# 15567 times (214ms+701ms) by Text::Tradition::Collation::path_witnesses at <a href="lib-Text-Tradition-Collation-pm-686-block.html#789">line 789 of lib/Text/Tradition/Collation.pm</a>, avg 59µs/call
+# 4 times (67µs+208µs) by Text::Tradition::Collation::reading_witnesses at <a href="lib-Text-Tradition-Collation-pm-686-block.html#536">line 536 of lib/Text/Tradition/Collation.pm</a>, avg 69µs/call</div></div>sub get_edge_attributes {</td></tr>
+<tr><td class="h"><a name="1532"></a>1532</td><td class="c0">77855</td><td class="c0"><span title="Avg 2µs">137ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1533"></a>1533</td><td></td><td></td><td class="c0">15571</td><td class="c0">107ms</td><td class="s"> $g->expect_non_multiedged;<div class="calls"><div class="calls_out"> # spent 107ms making 15571 calls to <a href="Graph-pm-695-block.html#2113">Graph::expect_non_multiedged</a>, avg 7µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1534"></a>1534</td><td></td><td></td><td class="c0">15571</td><td class="c0">130ms</td><td class="s"> return unless $g->has_edge( @_ );<div class="calls"><div class="calls_out"> # spent 130ms making 15571 calls to <a href="Graph-pm-695-block.html#530">Graph::has_edge</a>, avg 8µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1535"></a>1535</td><td></td><td></td><td class="c0">31142</td><td class="c0">434ms</td><td class="s"> my $a = $g->[ _E ]->_get_path_attrs( $g->_vertex_ids( @_ ) );<div class="calls"><div class="calls_out"> # spent 319ms making 15571 calls to <a href="Graph-AdjacencyMap-pm-696-block.html#230">Graph::AdjacencyMap::_get_path_attrs</a>, avg 20µs/call
+ # spent 115ms making 15571 calls to <a href="Graph-pm-695-block.html#510">Graph::_vertex_ids</a>, avg 7µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1536"></a>1536</td><td></td><td></td><td class="c0">15571</td><td class="c0">30.0ms</td><td class="s"> ($g->is_compat02) ? (defined $a ? %{ $a } : ()) : $a;<div class="calls"><div class="calls_out"> # spent 30.0ms making 15571 calls to <a href="Graph-pm-695-block.html#134">Graph::is_compat02</a>, avg 2µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1537"></a>1537</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1538"></a>1538</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1539"></a>1539</td><td></td><td></td><td></td><td></td><td class="s">sub get_edge_attributes_by_id {</td></tr>
+<tr><td class="h"><a name="1540"></a>1540</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1541"></a>1541</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="1542"></a>1542</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_edge_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1543"></a>1543</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="1544"></a>1544</td><td></td><td></td><td></td><td></td><td class="s"> return $g->[ _E ]->_get_path_attrs( $g->_vertex_ids( @_ ), $id );</td></tr>
+<tr><td class="h"><a name="1545"></a>1545</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1546"></a>1546</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1547"></a>1547</td><td></td><td></td><td></td><td></td><td class="s">sub _get_edge_attribute { # Fast path; less checks.</td></tr>
+<tr><td class="h"><a name="1548"></a>1548</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1549"></a>1549</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1550"></a>1550</td><td></td><td></td><td></td><td></td><td class="s"> my $E = $g->[ _E ];</td></tr>
+<tr><td class="h"><a name="1551"></a>1551</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $E->[ _f ];</td></tr>
+<tr><td class="h"><a name="1552"></a>1552</td><td></td><td></td><td></td><td></td><td class="s"> if ($E->[ _a ] == 2 && @_ == 2 && !($f & (_HYPER|_REF|_UNIQ))) { # Fast path.</td></tr>
+<tr><td class="h"><a name="1553"></a>1553</td><td></td><td></td><td></td><td></td><td class="s"> @_ = sort @_ if ($f & _UNORD);</td></tr>
+<tr><td class="h"><a name="1554"></a>1554</td><td></td><td></td><td></td><td></td><td class="s"> my $s = $E->[ _s ];</td></tr>
+<tr><td class="h"><a name="1555"></a>1555</td><td></td><td></td><td></td><td></td><td class="s"> return unless exists $s->{ $_[0] } && exists $s->{ $_[0] }->{ $_[1] };</td></tr>
+<tr><td class="h"><a name="1556"></a>1556</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="1557"></a>1557</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_edge( @_ );</td></tr>
+<tr><td class="h"><a name="1558"></a>1558</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1559"></a>1559</td><td></td><td></td><td></td><td></td><td class="s"> my @i = $g->_vertex_ids( @_ );</td></tr>
+<tr><td class="h"><a name="1560"></a>1560</td><td></td><td></td><td></td><td></td><td class="s"> $E->_get_path_attr( @i, $attr );</td></tr>
+<tr><td class="h"><a name="1561"></a>1561</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1562"></a>1562</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1563"></a>1563</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 672µs (153+519) within Graph::get_edge_attribute which was called 9 times, avg 75µs/call:
+# 9 times (153µs+519µs) by Text::Tradition::Collation::RelationshipStore::get_relationship at <a href="lib-Text-Tradition-Collation-RelationshipStore-pm-811-block.html#157">line 157 of lib/Text/Tradition/Collation/RelationshipStore.pm</a>, avg 75µs/call</div></div>sub get_edge_attribute {</td></tr>
+<tr><td class="h"><a name="1564"></a>1564</td><td class="c0">72</td><td class="c3"><span title="Avg 1µs">107µs</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1565"></a>1565</td><td></td><td></td><td class="c3">9</td><td class="c3">65µs</td><td class="s"> $g->expect_non_multiedged;<div class="calls"><div class="calls_out"> # spent 65µs making 9 calls to <a href="Graph-pm-695-block.html#2113">Graph::expect_non_multiedged</a>, avg 7µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1566"></a>1566</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1567"></a>1567</td><td></td><td></td><td class="c3">9</td><td class="c3">100µs</td><td class="s"> return undef unless $g->has_edge( @_ );<div class="calls"><div class="calls_out"> # spent 100µs making 9 calls to <a href="Graph-pm-695-block.html#530">Graph::has_edge</a>, avg 11µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1568"></a>1568</td><td></td><td></td><td class="c3">9</td><td class="c3">62µs</td><td class="s"> my @i = $g->_vertex_ids( @_ );<div class="calls"><div class="calls_out"> # spent 62µs making 9 calls to <a href="Graph-pm-695-block.html#510">Graph::_vertex_ids</a>, avg 7µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1569"></a>1569</td><td></td><td></td><td></td><td></td><td class="s"> return undef if @i == 0 && @_;</td></tr>
+<tr><td class="h"><a name="1570"></a>1570</td><td></td><td></td><td></td><td></td><td class="s"> my $E = $g->[ _E ];</td></tr>
+<tr><td class="h"><a name="1571"></a>1571</td><td></td><td></td><td class="c3">9</td><td class="c3">292µs</td><td class="s"> $E->_get_path_attr( @i, $attr );<div class="calls"><div class="calls_out"> # spent 292µs making 9 calls to <a href="Graph-AdjacencyMap-pm-696-block.html#249">Graph::AdjacencyMap::_get_path_attr</a>, avg 32µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1572"></a>1572</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1573"></a>1573</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1574"></a>1574</td><td></td><td></td><td></td><td></td><td class="s">sub get_edge_attribute_by_id {</td></tr>
+<tr><td class="h"><a name="1575"></a>1575</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1576"></a>1576</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="1577"></a>1577</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1578"></a>1578</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_edge_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1579"></a>1579</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="1580"></a>1580</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_get_path_attr( $g->_vertex_ids( @_ ), $id, $attr );</td></tr>
+<tr><td class="h"><a name="1581"></a>1581</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1582"></a>1582</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1583"></a>1583</td><td></td><td></td><td></td><td></td><td class="s">sub get_edge_attribute_names {</td></tr>
+<tr><td class="h"><a name="1584"></a>1584</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1585"></a>1585</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multiedged;</td></tr>
+<tr><td class="h"><a name="1586"></a>1586</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_edge( @_ );</td></tr>
+<tr><td class="h"><a name="1587"></a>1587</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_get_path_attr_names( $g->_vertex_ids( @_ ) );</td></tr>
+<tr><td class="h"><a name="1588"></a>1588</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1589"></a>1589</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1590"></a>1590</td><td></td><td></td><td></td><td></td><td class="s">sub get_edge_attribute_names_by_id {</td></tr>
+<tr><td class="h"><a name="1591"></a>1591</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1592"></a>1592</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="1593"></a>1593</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_edge_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1594"></a>1594</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="1595"></a>1595</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_get_path_attr_names( $g->_vertex_ids( @_ ), $id );</td></tr>
+<tr><td class="h"><a name="1596"></a>1596</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1597"></a>1597</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1598"></a>1598</td><td></td><td></td><td></td><td></td><td class="s">sub get_edge_attribute_values {</td></tr>
+<tr><td class="h"><a name="1599"></a>1599</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1600"></a>1600</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multiedged;</td></tr>
+<tr><td class="h"><a name="1601"></a>1601</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_edge( @_ );</td></tr>
+<tr><td class="h"><a name="1602"></a>1602</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_get_path_attr_values( $g->_vertex_ids( @_ ) );</td></tr>
+<tr><td class="h"><a name="1603"></a>1603</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1604"></a>1604</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1605"></a>1605</td><td></td><td></td><td></td><td></td><td class="s">sub get_edge_attribute_values_by_id {</td></tr>
+<tr><td class="h"><a name="1606"></a>1606</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1607"></a>1607</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="1608"></a>1608</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_edge_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1609"></a>1609</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="1610"></a>1610</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_get_path_attr_values( $g->_vertex_ids( @_ ), $id );</td></tr>
+<tr><td class="h"><a name="1611"></a>1611</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1612"></a>1612</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1613"></a>1613</td><td></td><td></td><td></td><td></td><td class="s">sub delete_edge_attributes {</td></tr>
+<tr><td class="h"><a name="1614"></a>1614</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1615"></a>1615</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multiedged;</td></tr>
+<tr><td class="h"><a name="1616"></a>1616</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_edge( @_ );</td></tr>
+<tr><td class="h"><a name="1617"></a>1617</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_del_path_attrs( $g->_vertex_ids( @_ ) );</td></tr>
+<tr><td class="h"><a name="1618"></a>1618</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1619"></a>1619</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1620"></a>1620</td><td></td><td></td><td></td><td></td><td class="s">sub delete_edge_attributes_by_id {</td></tr>
+<tr><td class="h"><a name="1621"></a>1621</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1622"></a>1622</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="1623"></a>1623</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_edge_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1624"></a>1624</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="1625"></a>1625</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_del_path_attrs( $g->_vertex_ids( @_ ), $id );</td></tr>
+<tr><td class="h"><a name="1626"></a>1626</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1627"></a>1627</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1628"></a>1628</td><td></td><td></td><td></td><td></td><td class="s">sub delete_edge_attribute {</td></tr>
+<tr><td class="h"><a name="1629"></a>1629</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1630"></a>1630</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multiedged;</td></tr>
+<tr><td class="h"><a name="1631"></a>1631</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1632"></a>1632</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_edge( @_ );</td></tr>
+<tr><td class="h"><a name="1633"></a>1633</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_del_path_attr( $g->_vertex_ids( @_ ), $attr );</td></tr>
+<tr><td class="h"><a name="1634"></a>1634</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1635"></a>1635</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1636"></a>1636</td><td></td><td></td><td></td><td></td><td class="s">sub delete_edge_attribute_by_id {</td></tr>
+<tr><td class="h"><a name="1637"></a>1637</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1638"></a>1638</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="1639"></a>1639</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="1640"></a>1640</td><td></td><td></td><td></td><td></td><td class="s"> return unless $g->has_edge_by_id( @_ );</td></tr>
+<tr><td class="h"><a name="1641"></a>1641</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="1642"></a>1642</td><td></td><td></td><td></td><td></td><td class="s"> $g->[ _E ]->_del_path_attr( $g->_vertex_ids( @_ ), $id, $attr );</td></tr>
+<tr><td class="h"><a name="1643"></a>1643</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1644"></a>1644</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1645"></a>1645</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="1646"></a>1646</td><td></td><td></td><td></td><td></td><td class="s"># Compat.</td></tr>
+<tr><td class="h"><a name="1647"></a>1647</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="1648"></a>1648</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1649"></a>1649</td><td></td><td></td><td></td><td></td><td class="s">sub vertex {</td></tr>
+<tr><td class="h"><a name="1650"></a>1650</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1651"></a>1651</td><td></td><td></td><td></td><td></td><td class="s"> $g->has_vertex( @_ ) ? @_ : undef;</td></tr>
+<tr><td class="h"><a name="1652"></a>1652</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1653"></a>1653</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1654"></a>1654</td><td></td><td></td><td></td><td></td><td class="s">sub out_edges {</td></tr>
+<tr><td class="h"><a name="1655"></a>1655</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1656"></a>1656</td><td></td><td></td><td></td><td></td><td class="s"> return unless @_ && $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1657"></a>1657</td><td></td><td></td><td></td><td></td><td class="s"> my @e = $g->edges_from( @_ );</td></tr>
+<tr><td class="h"><a name="1658"></a>1658</td><td></td><td></td><td></td><td></td><td class="s"> wantarray ? map { @$_ } @e : @e;</td></tr>
+<tr><td class="h"><a name="1659"></a>1659</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1660"></a>1660</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1661"></a>1661</td><td></td><td></td><td></td><td></td><td class="s">sub in_edges {</td></tr>
+<tr><td class="h"><a name="1662"></a>1662</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1663"></a>1663</td><td></td><td></td><td></td><td></td><td class="s"> return unless @_ && $g->has_vertex( @_ );</td></tr>
+<tr><td class="h"><a name="1664"></a>1664</td><td></td><td></td><td></td><td></td><td class="s"> my @e = $g->edges_to( @_ );</td></tr>
+<tr><td class="h"><a name="1665"></a>1665</td><td></td><td></td><td></td><td></td><td class="s"> wantarray ? map { @$_ } @e : @e;</td></tr>
+<tr><td class="h"><a name="1666"></a>1666</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1667"></a>1667</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1668"></a>1668</td><td></td><td></td><td></td><td></td><td class="s">sub add_vertices {</td></tr>
+<tr><td class="h"><a name="1669"></a>1669</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1670"></a>1670</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_vertex( $_ ) for @_;</td></tr>
+<tr><td class="h"><a name="1671"></a>1671</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="1672"></a>1672</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1673"></a>1673</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1674"></a>1674</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 171µs (16+156) within Graph::add_edges which was called 2 times, avg 86µs/call:
+# 2 times (16µs+156µs) by Graph::AdjacencyMap::Light::__attr at <a href="Graph-AdjacencyMap-Light-pm-700-block.html#227">line 227 of Graph/AdjacencyMap/Light.pm</a>, avg 86µs/call</div></div>sub add_edges {</td></tr>
+<tr><td class="h"><a name="1675"></a>1675</td><td class="c0">6</td><td class="c3"><span title="Avg 1µs">7µs</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1676"></a>1676</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="1677"></a>1677</td><td class="c0">4</td><td class="c3"><span title="Avg 1µs">5µs</span></td><td></td><td></td><td class="s"> my $u = shift @_;</td></tr>
+<tr><td class="h"><a name="1678"></a>1678</td><td></td><td></td><td class="c3">2</td><td class="c3">156µs</td><td class="s"> if (ref $u eq 'ARRAY') {<div class="calls"><div class="calls_out"> # spent 156µs making 2 calls to <a href="Graph-pm-695-block.html#488">Graph::add_edge</a>, avg 78µs/call</div></div></td></tr>
+<tr><td class="h"><a name="1679"></a>1679</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge( @$u );</td></tr>
+<tr><td class="h"><a name="1680"></a>1680</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="1681"></a>1681</td><td></td><td></td><td></td><td></td><td class="s"> if (@_) {</td></tr>
+<tr><td class="h"><a name="1682"></a>1682</td><td></td><td></td><td></td><td></td><td class="s"> my $v = shift @_;</td></tr>
+<tr><td class="h"><a name="1683"></a>1683</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge( $u, $v );</td></tr>
+<tr><td class="h"><a name="1684"></a>1684</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="1685"></a>1685</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="1686"></a>1686</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("Graph::add_edges: missing end vertex");</td></tr>
+<tr><td class="h"><a name="1687"></a>1687</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1688"></a>1688</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1689"></a>1689</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1690"></a>1690</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="1691"></a>1691</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1692"></a>1692</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1693"></a>1693</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="1694"></a>1694</td><td></td><td></td><td></td><td></td><td class="s"># More constructors.</td></tr>
+<tr><td class="h"><a name="1695"></a>1695</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="1696"></a>1696</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1697"></a>1697</td><td></td><td></td><td></td><td></td><td class="s">sub copy {</td></tr>
+<tr><td class="h"><a name="1698"></a>1698</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1699"></a>1699</td><td></td><td></td><td></td><td></td><td class="s"> my %opt = _get_options( \@_ );</td></tr>
+<tr><td class="h"><a name="1700"></a>1700</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1701"></a>1701</td><td></td><td></td><td></td><td></td><td class="s"> my $c =</td></tr>
+<tr><td class="h"><a name="1702"></a>1702</td><td></td><td></td><td></td><td></td><td class="s"> (ref $g)->new(map { $_ => $g->$_ ? 1 : 0 }</td></tr>
+<tr><td class="h"><a name="1703"></a>1703</td><td></td><td></td><td></td><td></td><td class="s"> qw(directed</td></tr>
+<tr><td class="h"><a name="1704"></a>1704</td><td></td><td></td><td></td><td></td><td class="s"> compat02</td></tr>
+<tr><td class="h"><a name="1705"></a>1705</td><td></td><td></td><td></td><td></td><td class="s"> refvertexed</td></tr>
+<tr><td class="h"><a name="1706"></a>1706</td><td></td><td></td><td></td><td></td><td class="s"> hypervertexed</td></tr>
+<tr><td class="h"><a name="1707"></a>1707</td><td></td><td></td><td></td><td></td><td class="s"> countvertexed</td></tr>
+<tr><td class="h"><a name="1708"></a>1708</td><td></td><td></td><td></td><td></td><td class="s"> multivertexed</td></tr>
+<tr><td class="h"><a name="1709"></a>1709</td><td></td><td></td><td></td><td></td><td class="s"> hyperedged</td></tr>
+<tr><td class="h"><a name="1710"></a>1710</td><td></td><td></td><td></td><td></td><td class="s"> countedged</td></tr>
+<tr><td class="h"><a name="1711"></a>1711</td><td></td><td></td><td></td><td></td><td class="s"> multiedged</td></tr>
+<tr><td class="h"><a name="1712"></a>1712</td><td></td><td></td><td></td><td></td><td class="s"> omniedged</td></tr>
+<tr><td class="h"><a name="1713"></a>1713</td><td></td><td></td><td></td><td></td><td class="s"> __stringified));</td></tr>
+<tr><td class="h"><a name="1714"></a>1714</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ($g->isolated_vertices) { $c->add_vertex($v) }</td></tr>
+<tr><td class="h"><a name="1715"></a>1715</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ($g->edges05) { $c->add_edge(@$e) }</td></tr>
+<tr><td class="h"><a name="1716"></a>1716</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1717"></a>1717</td><td></td><td></td><td></td><td></td><td class="s"> return $c;</td></tr>
+<tr><td class="h"><a name="1718"></a>1718</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1719"></a>1719</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1720"></a>1720</td><td class="c3">1</td><td class="c3"><span title="Avg 2µs">2µs</span></td><td></td><td></td><td class="s">*copy_graph = \&copy;</td></tr>
+<tr><td class="h"><a name="1721"></a>1721</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1722"></a>1722</td><td></td><td></td><td></td><td></td><td class="s">sub _deep_copy_Storable {</td></tr>
+<tr><td class="h"><a name="1723"></a>1723</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1724"></a>1724</td><td></td><td></td><td></td><td></td><td class="s"> my $safe = new Safe;</td></tr>
+<tr><td class="h"><a name="1725"></a>1725</td><td></td><td></td><td></td><td></td><td class="s"> local $Storable::Deparse = 1;</td></tr>
+<tr><td class="h"><a name="1726"></a>1726</td><td></td><td></td><td></td><td></td><td class="s"> local $Storable::Eval = sub { $safe->reval($_[0]) };</td></tr>
+<tr><td class="h"><a name="1727"></a>1727</td><td></td><td></td><td></td><td></td><td class="s"> return Storable::thaw(Storable::freeze($g));</td></tr>
+<tr><td class="h"><a name="1728"></a>1728</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1729"></a>1729</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1730"></a>1730</td><td></td><td></td><td></td><td></td><td class="s">sub _deep_copy_DataDumper {</td></tr>
+<tr><td class="h"><a name="1731"></a>1731</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1732"></a>1732</td><td></td><td></td><td></td><td></td><td class="s"> my $d = Data::Dumper->new([$g]);</td></tr>
+<tr><td class="h"><a name="1733"></a>1733</td><td class="c3">2</td><td class="c0"><span title="Avg 1.08ms">2.17ms</span></td><td class="c3">2</td><td class="c3">101µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 59µs (17+42) within Graph::BEGIN@1733 which was called:
+# once (17µs+42µs) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#1733">line 1733</a></div></div> use vars qw($VAR1);<div class="calls"><div class="calls_out"> # spent 59µs making 1 call to <a href="Graph-pm-695-block.html#1733">Graph::BEGIN@1733</a>
+ # spent 42µs making 1 call to <a href="vars-pm-6-block.html#10">vars::import</a></div></div></td></tr>
+<tr><td class="h"><a name="1734"></a>1734</td><td></td><td></td><td></td><td></td><td class="s"> $d->Purity(1)->Terse(1)->Deepcopy(1);</td></tr>
+<tr><td class="h"><a name="1735"></a>1735</td><td></td><td></td><td></td><td></td><td class="s"> $d->Deparse(1) if $] >= 5.008;</td></tr>
+<tr><td class="h"><a name="1736"></a>1736</td><td></td><td></td><td></td><td></td><td class="s"> eval $d->Dump;</td></tr>
+<tr><td class="h"><a name="1737"></a>1737</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1738"></a>1738</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1739"></a>1739</td><td></td><td></td><td></td><td></td><td class="s">sub deep_copy {</td></tr>
+<tr><td class="h"><a name="1740"></a>1740</td><td></td><td></td><td></td><td></td><td class="s"> if (_can_deep_copy_Storable()) {</td></tr>
+<tr><td class="h"><a name="1741"></a>1741</td><td></td><td></td><td></td><td></td><td class="s"> return _deep_copy_Storable(@_);</td></tr>
+<tr><td class="h"><a name="1742"></a>1742</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="1743"></a>1743</td><td></td><td></td><td></td><td></td><td class="s"> return _deep_copy_DataDumper(@_);</td></tr>
+<tr><td class="h"><a name="1744"></a>1744</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1745"></a>1745</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1746"></a>1746</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1747"></a>1747</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*deep_copy_graph = \&deep_copy;</td></tr>
+<tr><td class="h"><a name="1748"></a>1748</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1749"></a>1749</td><td></td><td></td><td></td><td></td><td class="s">sub transpose_edge {</td></tr>
+<tr><td class="h"><a name="1750"></a>1750</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1751"></a>1751</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->is_directed) {</td></tr>
+<tr><td class="h"><a name="1752"></a>1752</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless $g->has_edge( @_ );</td></tr>
+<tr><td class="h"><a name="1753"></a>1753</td><td></td><td></td><td></td><td></td><td class="s"> my $c = $g->get_edge_count( @_ );</td></tr>
+<tr><td class="h"><a name="1754"></a>1754</td><td></td><td></td><td></td><td></td><td class="s"> my $a = $g->get_edge_attributes( @_ );</td></tr>
+<tr><td class="h"><a name="1755"></a>1755</td><td></td><td></td><td></td><td></td><td class="s"> my @e = reverse @_;</td></tr>
+<tr><td class="h"><a name="1756"></a>1756</td><td></td><td></td><td></td><td></td><td class="s"> $g->delete_edge( @_ ) unless $g->has_edge( @e );</td></tr>
+<tr><td class="h"><a name="1757"></a>1757</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge( @e ) for 1..$c;</td></tr>
+<tr><td class="h"><a name="1758"></a>1758</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_edge_attributes(@e, $a) if $a;</td></tr>
+<tr><td class="h"><a name="1759"></a>1759</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1760"></a>1760</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="1761"></a>1761</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1762"></a>1762</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1763"></a>1763</td><td></td><td></td><td></td><td></td><td class="s">sub transpose_graph {</td></tr>
+<tr><td class="h"><a name="1764"></a>1764</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1765"></a>1765</td><td></td><td></td><td></td><td></td><td class="s"> my $t = $g->copy;</td></tr>
+<tr><td class="h"><a name="1766"></a>1766</td><td></td><td></td><td></td><td></td><td class="s"> if ($t->directed) {</td></tr>
+<tr><td class="h"><a name="1767"></a>1767</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ($t->edges05) {</td></tr>
+<tr><td class="h"><a name="1768"></a>1768</td><td></td><td></td><td></td><td></td><td class="s"> $t->transpose_edge(@$e);</td></tr>
+<tr><td class="h"><a name="1769"></a>1769</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1770"></a>1770</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1771"></a>1771</td><td></td><td></td><td></td><td></td><td class="s"> return $t;</td></tr>
+<tr><td class="h"><a name="1772"></a>1772</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1773"></a>1773</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1774"></a>1774</td><td class="c3">1</td><td class="c3"><span title="Avg 2µs">2µs</span></td><td></td><td></td><td class="s">*transpose = \&transpose_graph;</td></tr>
+<tr><td class="h"><a name="1775"></a>1775</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1776"></a>1776</td><td></td><td></td><td></td><td></td><td class="s">sub complete_graph {</td></tr>
+<tr><td class="h"><a name="1777"></a>1777</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1778"></a>1778</td><td></td><td></td><td></td><td></td><td class="s"> my $c = $g->new( directed => $g->directed );</td></tr>
+<tr><td class="h"><a name="1779"></a>1779</td><td></td><td></td><td></td><td></td><td class="s"> my @v = $g->vertices05;</td></tr>
+<tr><td class="h"><a name="1780"></a>1780</td><td></td><td></td><td></td><td></td><td class="s"> for (my $i = 0; $i <= $#v; $i++ ) {</td></tr>
+<tr><td class="h"><a name="1781"></a>1781</td><td></td><td></td><td></td><td></td><td class="s"> for (my $j = 0; $j <= $#v; $j++ ) {</td></tr>
+<tr><td class="h"><a name="1782"></a>1782</td><td></td><td></td><td></td><td></td><td class="s"> next if $i >= $j;</td></tr>
+<tr><td class="h"><a name="1783"></a>1783</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->is_undirected) {</td></tr>
+<tr><td class="h"><a name="1784"></a>1784</td><td></td><td></td><td></td><td></td><td class="s"> $c->add_edge($v[$i], $v[$j]);</td></tr>
+<tr><td class="h"><a name="1785"></a>1785</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="1786"></a>1786</td><td></td><td></td><td></td><td></td><td class="s"> $c->add_edge($v[$i], $v[$j]);</td></tr>
+<tr><td class="h"><a name="1787"></a>1787</td><td></td><td></td><td></td><td></td><td class="s"> $c->add_edge($v[$j], $v[$i]);</td></tr>
+<tr><td class="h"><a name="1788"></a>1788</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1789"></a>1789</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1790"></a>1790</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1791"></a>1791</td><td></td><td></td><td></td><td></td><td class="s"> return $c;</td></tr>
+<tr><td class="h"><a name="1792"></a>1792</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1793"></a>1793</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1794"></a>1794</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*complement = \&complement_graph;</td></tr>
+<tr><td class="h"><a name="1795"></a>1795</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1796"></a>1796</td><td></td><td></td><td></td><td></td><td class="s">sub complement_graph {</td></tr>
+<tr><td class="h"><a name="1797"></a>1797</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1798"></a>1798</td><td></td><td></td><td></td><td></td><td class="s"> my $c = $g->new( directed => $g->directed );</td></tr>
+<tr><td class="h"><a name="1799"></a>1799</td><td></td><td></td><td></td><td></td><td class="s"> my @v = $g->vertices05;</td></tr>
+<tr><td class="h"><a name="1800"></a>1800</td><td></td><td></td><td></td><td></td><td class="s"> for (my $i = 0; $i <= $#v; $i++ ) {</td></tr>
+<tr><td class="h"><a name="1801"></a>1801</td><td></td><td></td><td></td><td></td><td class="s"> for (my $j = 0; $j <= $#v; $j++ ) {</td></tr>
+<tr><td class="h"><a name="1802"></a>1802</td><td></td><td></td><td></td><td></td><td class="s"> next if $i >= $j;</td></tr>
+<tr><td class="h"><a name="1803"></a>1803</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->is_undirected) {</td></tr>
+<tr><td class="h"><a name="1804"></a>1804</td><td></td><td></td><td></td><td></td><td class="s"> $c->add_edge($v[$i], $v[$j])</td></tr>
+<tr><td class="h"><a name="1805"></a>1805</td><td></td><td></td><td></td><td></td><td class="s"> unless $g->has_edge($v[$i], $v[$j]);</td></tr>
+<tr><td class="h"><a name="1806"></a>1806</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="1807"></a>1807</td><td></td><td></td><td></td><td></td><td class="s"> $c->add_edge($v[$i], $v[$j])</td></tr>
+<tr><td class="h"><a name="1808"></a>1808</td><td></td><td></td><td></td><td></td><td class="s"> unless $g->has_edge($v[$i], $v[$j]);</td></tr>
+<tr><td class="h"><a name="1809"></a>1809</td><td></td><td></td><td></td><td></td><td class="s"> $c->add_edge($v[$j], $v[$i])</td></tr>
+<tr><td class="h"><a name="1810"></a>1810</td><td></td><td></td><td></td><td></td><td class="s"> unless $g->has_edge($v[$j], $v[$i]);</td></tr>
+<tr><td class="h"><a name="1811"></a>1811</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1812"></a>1812</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1813"></a>1813</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1814"></a>1814</td><td></td><td></td><td></td><td></td><td class="s"> return $c;</td></tr>
+<tr><td class="h"><a name="1815"></a>1815</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1816"></a>1816</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1817"></a>1817</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*complete = \&complete_graph;</td></tr>
+<tr><td class="h"><a name="1818"></a>1818</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1819"></a>1819</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="1820"></a>1820</td><td></td><td></td><td></td><td></td><td class="s"># Transitivity.</td></tr>
+<tr><td class="h"><a name="1821"></a>1821</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="1822"></a>1822</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1823"></a>1823</td><td></td><td></td><td></td><td></td><td class="s">sub is_transitive {</td></tr>
+<tr><td class="h"><a name="1824"></a>1824</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1825"></a>1825</td><td></td><td></td><td></td><td></td><td class="s"> Graph::TransitiveClosure::is_transitive($g);</td></tr>
+<tr><td class="h"><a name="1826"></a>1826</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1827"></a>1827</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1828"></a>1828</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="1829"></a>1829</td><td></td><td></td><td></td><td></td><td class="s"># Weighted vertices.</td></tr>
+<tr><td class="h"><a name="1830"></a>1830</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="1831"></a>1831</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1832"></a>1832</td><td class="c3">1</td><td class="c3"><span title="Avg 800ns">800ns</span></td><td></td><td></td><td class="s">my $defattr = 'weight';</td></tr>
+<tr><td class="h"><a name="1833"></a>1833</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1834"></a>1834</td><td></td><td></td><td></td><td></td><td class="s">sub _defattr {</td></tr>
+<tr><td class="h"><a name="1835"></a>1835</td><td></td><td></td><td></td><td></td><td class="s"> return $defattr;</td></tr>
+<tr><td class="h"><a name="1836"></a>1836</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1837"></a>1837</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1838"></a>1838</td><td></td><td></td><td></td><td></td><td class="s">sub add_weighted_vertex {</td></tr>
+<tr><td class="h"><a name="1839"></a>1839</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1840"></a>1840</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1841"></a>1841</td><td></td><td></td><td></td><td></td><td class="s"> my $w = pop;</td></tr>
+<tr><td class="h"><a name="1842"></a>1842</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_vertex(@_);</td></tr>
+<tr><td class="h"><a name="1843"></a>1843</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_vertex_attribute(@_, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="1844"></a>1844</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1845"></a>1845</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1846"></a>1846</td><td></td><td></td><td></td><td></td><td class="s">sub add_weighted_vertices {</td></tr>
+<tr><td class="h"><a name="1847"></a>1847</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1848"></a>1848</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1849"></a>1849</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="1850"></a>1850</td><td></td><td></td><td></td><td></td><td class="s"> my ($v, $w) = splice @_, 0, 2;</td></tr>
+<tr><td class="h"><a name="1851"></a>1851</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_vertex($v);</td></tr>
+<tr><td class="h"><a name="1852"></a>1852</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_vertex_attribute($v, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="1853"></a>1853</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1854"></a>1854</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1855"></a>1855</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1856"></a>1856</td><td></td><td></td><td></td><td></td><td class="s">sub get_vertex_weight {</td></tr>
+<tr><td class="h"><a name="1857"></a>1857</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1858"></a>1858</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1859"></a>1859</td><td></td><td></td><td></td><td></td><td class="s"> $g->get_vertex_attribute(@_, $defattr);</td></tr>
+<tr><td class="h"><a name="1860"></a>1860</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1861"></a>1861</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1862"></a>1862</td><td></td><td></td><td></td><td></td><td class="s">sub has_vertex_weight {</td></tr>
+<tr><td class="h"><a name="1863"></a>1863</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1864"></a>1864</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1865"></a>1865</td><td></td><td></td><td></td><td></td><td class="s"> $g->has_vertex_attribute(@_, $defattr);</td></tr>
+<tr><td class="h"><a name="1866"></a>1866</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1867"></a>1867</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1868"></a>1868</td><td></td><td></td><td></td><td></td><td class="s">sub set_vertex_weight {</td></tr>
+<tr><td class="h"><a name="1869"></a>1869</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1870"></a>1870</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1871"></a>1871</td><td></td><td></td><td></td><td></td><td class="s"> my $w = pop;</td></tr>
+<tr><td class="h"><a name="1872"></a>1872</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_vertex_attribute(@_, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="1873"></a>1873</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1874"></a>1874</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1875"></a>1875</td><td></td><td></td><td></td><td></td><td class="s">sub delete_vertex_weight {</td></tr>
+<tr><td class="h"><a name="1876"></a>1876</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1877"></a>1877</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multivertexed;</td></tr>
+<tr><td class="h"><a name="1878"></a>1878</td><td></td><td></td><td></td><td></td><td class="s"> $g->delete_vertex_attribute(@_, $defattr);</td></tr>
+<tr><td class="h"><a name="1879"></a>1879</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1880"></a>1880</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1881"></a>1881</td><td></td><td></td><td></td><td></td><td class="s">sub add_weighted_vertex_by_id {</td></tr>
+<tr><td class="h"><a name="1882"></a>1882</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1883"></a>1883</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1884"></a>1884</td><td></td><td></td><td></td><td></td><td class="s"> my $w = pop;</td></tr>
+<tr><td class="h"><a name="1885"></a>1885</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_vertex_by_id(@_);</td></tr>
+<tr><td class="h"><a name="1886"></a>1886</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_vertex_attribute_by_id(@_, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="1887"></a>1887</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1888"></a>1888</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1889"></a>1889</td><td></td><td></td><td></td><td></td><td class="s">sub add_weighted_vertices_by_id {</td></tr>
+<tr><td class="h"><a name="1890"></a>1890</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1891"></a>1891</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1892"></a>1892</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="1893"></a>1893</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="1894"></a>1894</td><td></td><td></td><td></td><td></td><td class="s"> my ($v, $w) = splice @_, 0, 2;</td></tr>
+<tr><td class="h"><a name="1895"></a>1895</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_vertex_by_id($v, $id);</td></tr>
+<tr><td class="h"><a name="1896"></a>1896</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_vertex_attribute_by_id($v, $id, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="1897"></a>1897</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1898"></a>1898</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1899"></a>1899</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1900"></a>1900</td><td></td><td></td><td></td><td></td><td class="s">sub get_vertex_weight_by_id {</td></tr>
+<tr><td class="h"><a name="1901"></a>1901</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1902"></a>1902</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1903"></a>1903</td><td></td><td></td><td></td><td></td><td class="s"> $g->get_vertex_attribute_by_id(@_, $defattr);</td></tr>
+<tr><td class="h"><a name="1904"></a>1904</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1905"></a>1905</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1906"></a>1906</td><td></td><td></td><td></td><td></td><td class="s">sub has_vertex_weight_by_id {</td></tr>
+<tr><td class="h"><a name="1907"></a>1907</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1908"></a>1908</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1909"></a>1909</td><td></td><td></td><td></td><td></td><td class="s"> $g->has_vertex_attribute_by_id(@_, $defattr);</td></tr>
+<tr><td class="h"><a name="1910"></a>1910</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1911"></a>1911</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1912"></a>1912</td><td></td><td></td><td></td><td></td><td class="s">sub set_vertex_weight_by_id {</td></tr>
+<tr><td class="h"><a name="1913"></a>1913</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1914"></a>1914</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1915"></a>1915</td><td></td><td></td><td></td><td></td><td class="s"> my $w = pop;</td></tr>
+<tr><td class="h"><a name="1916"></a>1916</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_vertex_attribute_by_id(@_, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="1917"></a>1917</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1918"></a>1918</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1919"></a>1919</td><td></td><td></td><td></td><td></td><td class="s">sub delete_vertex_weight_by_id {</td></tr>
+<tr><td class="h"><a name="1920"></a>1920</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1921"></a>1921</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multivertexed;</td></tr>
+<tr><td class="h"><a name="1922"></a>1922</td><td></td><td></td><td></td><td></td><td class="s"> $g->delete_vertex_attribute_by_id(@_, $defattr);</td></tr>
+<tr><td class="h"><a name="1923"></a>1923</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1924"></a>1924</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1925"></a>1925</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="1926"></a>1926</td><td></td><td></td><td></td><td></td><td class="s"># Weighted edges.</td></tr>
+<tr><td class="h"><a name="1927"></a>1927</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="1928"></a>1928</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1929"></a>1929</td><td></td><td></td><td></td><td></td><td class="s">sub add_weighted_edge {</td></tr>
+<tr><td class="h"><a name="1930"></a>1930</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1931"></a>1931</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multiedged;</td></tr>
+<tr><td class="h"><a name="1932"></a>1932</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->is_compat02) {</td></tr>
+<tr><td class="h"><a name="1933"></a>1933</td><td></td><td></td><td></td><td></td><td class="s"> my $w = splice @_, 1, 1;</td></tr>
+<tr><td class="h"><a name="1934"></a>1934</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge(@_);</td></tr>
+<tr><td class="h"><a name="1935"></a>1935</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_edge_attribute(@_, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="1936"></a>1936</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="1937"></a>1937</td><td></td><td></td><td></td><td></td><td class="s"> my $w = pop;</td></tr>
+<tr><td class="h"><a name="1938"></a>1938</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge(@_);</td></tr>
+<tr><td class="h"><a name="1939"></a>1939</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_edge_attribute(@_, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="1940"></a>1940</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1941"></a>1941</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1942"></a>1942</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1943"></a>1943</td><td></td><td></td><td></td><td></td><td class="s">sub add_weighted_edges {</td></tr>
+<tr><td class="h"><a name="1944"></a>1944</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1945"></a>1945</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multiedged;</td></tr>
+<tr><td class="h"><a name="1946"></a>1946</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->is_compat02) {</td></tr>
+<tr><td class="h"><a name="1947"></a>1947</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="1948"></a>1948</td><td></td><td></td><td></td><td></td><td class="s"> my ($u, $w, $v) = splice @_, 0, 3;</td></tr>
+<tr><td class="h"><a name="1949"></a>1949</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge($u, $v);</td></tr>
+<tr><td class="h"><a name="1950"></a>1950</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_edge_attribute($u, $v, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="1951"></a>1951</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1952"></a>1952</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="1953"></a>1953</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="1954"></a>1954</td><td></td><td></td><td></td><td></td><td class="s"> my ($u, $v, $w) = splice @_, 0, 3;</td></tr>
+<tr><td class="h"><a name="1955"></a>1955</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge($u, $v);</td></tr>
+<tr><td class="h"><a name="1956"></a>1956</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_edge_attribute($u, $v, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="1957"></a>1957</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1958"></a>1958</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1959"></a>1959</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1960"></a>1960</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1961"></a>1961</td><td></td><td></td><td></td><td></td><td class="s">sub add_weighted_edges_by_id {</td></tr>
+<tr><td class="h"><a name="1962"></a>1962</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1963"></a>1963</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="1964"></a>1964</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="1965"></a>1965</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="1966"></a>1966</td><td></td><td></td><td></td><td></td><td class="s"> my ($u, $v, $w) = splice @_, 0, 3;</td></tr>
+<tr><td class="h"><a name="1967"></a>1967</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge_by_id($u, $v, $id);</td></tr>
+<tr><td class="h"><a name="1968"></a>1968</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_edge_attribute_by_id($u, $v, $id, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="1969"></a>1969</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1970"></a>1970</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1971"></a>1971</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1972"></a>1972</td><td></td><td></td><td></td><td></td><td class="s">sub add_weighted_path {</td></tr>
+<tr><td class="h"><a name="1973"></a>1973</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1974"></a>1974</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multiedged;</td></tr>
+<tr><td class="h"><a name="1975"></a>1975</td><td></td><td></td><td></td><td></td><td class="s"> my $u = shift;</td></tr>
+<tr><td class="h"><a name="1976"></a>1976</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="1977"></a>1977</td><td></td><td></td><td></td><td></td><td class="s"> my ($w, $v) = splice @_, 0, 2;</td></tr>
+<tr><td class="h"><a name="1978"></a>1978</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge($u, $v);</td></tr>
+<tr><td class="h"><a name="1979"></a>1979</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_edge_attribute($u, $v, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="1980"></a>1980</td><td></td><td></td><td></td><td></td><td class="s"> $u = $v;</td></tr>
+<tr><td class="h"><a name="1981"></a>1981</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="1982"></a>1982</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1983"></a>1983</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1984"></a>1984</td><td></td><td></td><td></td><td></td><td class="s">sub get_edge_weight {</td></tr>
+<tr><td class="h"><a name="1985"></a>1985</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1986"></a>1986</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multiedged;</td></tr>
+<tr><td class="h"><a name="1987"></a>1987</td><td></td><td></td><td></td><td></td><td class="s"> $g->get_edge_attribute(@_, $defattr);</td></tr>
+<tr><td class="h"><a name="1988"></a>1988</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1989"></a>1989</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1990"></a>1990</td><td></td><td></td><td></td><td></td><td class="s">sub has_edge_weight {</td></tr>
+<tr><td class="h"><a name="1991"></a>1991</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1992"></a>1992</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multiedged;</td></tr>
+<tr><td class="h"><a name="1993"></a>1993</td><td></td><td></td><td></td><td></td><td class="s"> $g->has_edge_attribute(@_, $defattr);</td></tr>
+<tr><td class="h"><a name="1994"></a>1994</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="1995"></a>1995</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="1996"></a>1996</td><td></td><td></td><td></td><td></td><td class="s">sub set_edge_weight {</td></tr>
+<tr><td class="h"><a name="1997"></a>1997</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="1998"></a>1998</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multiedged;</td></tr>
+<tr><td class="h"><a name="1999"></a>1999</td><td></td><td></td><td></td><td></td><td class="s"> my $w = pop;</td></tr>
+<tr><td class="h"><a name="2000"></a>2000</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_edge_attribute(@_, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="2001"></a>2001</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2002"></a>2002</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2003"></a>2003</td><td></td><td></td><td></td><td></td><td class="s">sub delete_edge_weight {</td></tr>
+<tr><td class="h"><a name="2004"></a>2004</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2005"></a>2005</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_non_multiedged;</td></tr>
+<tr><td class="h"><a name="2006"></a>2006</td><td></td><td></td><td></td><td></td><td class="s"> $g->delete_edge_attribute(@_, $defattr);</td></tr>
+<tr><td class="h"><a name="2007"></a>2007</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2008"></a>2008</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2009"></a>2009</td><td></td><td></td><td></td><td></td><td class="s">sub add_weighted_edge_by_id {</td></tr>
+<tr><td class="h"><a name="2010"></a>2010</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2011"></a>2011</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="2012"></a>2012</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->is_compat02) {</td></tr>
+<tr><td class="h"><a name="2013"></a>2013</td><td></td><td></td><td></td><td></td><td class="s"> my $w = splice @_, 1, 1;</td></tr>
+<tr><td class="h"><a name="2014"></a>2014</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge_by_id(@_);</td></tr>
+<tr><td class="h"><a name="2015"></a>2015</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_edge_attribute_by_id(@_, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="2016"></a>2016</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2017"></a>2017</td><td></td><td></td><td></td><td></td><td class="s"> my $w = pop;</td></tr>
+<tr><td class="h"><a name="2018"></a>2018</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge_by_id(@_);</td></tr>
+<tr><td class="h"><a name="2019"></a>2019</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_edge_attribute_by_id(@_, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="2020"></a>2020</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2021"></a>2021</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2022"></a>2022</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2023"></a>2023</td><td></td><td></td><td></td><td></td><td class="s">sub add_weighted_path_by_id {</td></tr>
+<tr><td class="h"><a name="2024"></a>2024</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2025"></a>2025</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="2026"></a>2026</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop;</td></tr>
+<tr><td class="h"><a name="2027"></a>2027</td><td></td><td></td><td></td><td></td><td class="s"> my $u = shift;</td></tr>
+<tr><td class="h"><a name="2028"></a>2028</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="2029"></a>2029</td><td></td><td></td><td></td><td></td><td class="s"> my ($w, $v) = splice @_, 0, 2;</td></tr>
+<tr><td class="h"><a name="2030"></a>2030</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge_by_id($u, $v, $id);</td></tr>
+<tr><td class="h"><a name="2031"></a>2031</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_edge_attribute_by_id($u, $v, $id, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="2032"></a>2032</td><td></td><td></td><td></td><td></td><td class="s"> $u = $v;</td></tr>
+<tr><td class="h"><a name="2033"></a>2033</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2034"></a>2034</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2035"></a>2035</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2036"></a>2036</td><td></td><td></td><td></td><td></td><td class="s">sub get_edge_weight_by_id {</td></tr>
+<tr><td class="h"><a name="2037"></a>2037</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2038"></a>2038</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="2039"></a>2039</td><td></td><td></td><td></td><td></td><td class="s"> $g->get_edge_attribute_by_id(@_, $defattr);</td></tr>
+<tr><td class="h"><a name="2040"></a>2040</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2041"></a>2041</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2042"></a>2042</td><td></td><td></td><td></td><td></td><td class="s">sub has_edge_weight_by_id {</td></tr>
+<tr><td class="h"><a name="2043"></a>2043</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2044"></a>2044</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="2045"></a>2045</td><td></td><td></td><td></td><td></td><td class="s"> $g->has_edge_attribute_by_id(@_, $defattr);</td></tr>
+<tr><td class="h"><a name="2046"></a>2046</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2047"></a>2047</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2048"></a>2048</td><td></td><td></td><td></td><td></td><td class="s">sub set_edge_weight_by_id {</td></tr>
+<tr><td class="h"><a name="2049"></a>2049</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2050"></a>2050</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="2051"></a>2051</td><td></td><td></td><td></td><td></td><td class="s"> my $w = pop;</td></tr>
+<tr><td class="h"><a name="2052"></a>2052</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_edge_attribute_by_id(@_, $defattr, $w);</td></tr>
+<tr><td class="h"><a name="2053"></a>2053</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2054"></a>2054</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2055"></a>2055</td><td></td><td></td><td></td><td></td><td class="s">sub delete_edge_weight_by_id {</td></tr>
+<tr><td class="h"><a name="2056"></a>2056</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2057"></a>2057</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_multiedged;</td></tr>
+<tr><td class="h"><a name="2058"></a>2058</td><td></td><td></td><td></td><td></td><td class="s"> $g->delete_edge_attribute_by_id(@_, $defattr);</td></tr>
+<tr><td class="h"><a name="2059"></a>2059</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2060"></a>2060</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2061"></a>2061</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="2062"></a>2062</td><td></td><td></td><td></td><td></td><td class="s"># Error helpers.</td></tr>
+<tr><td class="h"><a name="2063"></a>2063</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="2064"></a>2064</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2065"></a>2065</td><td class="c3">1</td><td class="c3"><span title="Avg 400ns">400ns</span></td><td></td><td></td><td class="s">my %expected;</td></tr>
+<tr><td class="h"><a name="2066"></a>2066</td><td class="c3">1</td><td class="c3"><span title="Avg 3µs">3µs</span></td><td></td><td></td><td class="s">@expected{qw(directed undirected acyclic)} = qw(undirected directed cyclic);</td></tr>
+<tr><td class="h"><a name="2067"></a>2067</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2068"></a>2068</td><td></td><td></td><td></td><td></td><td class="s">sub _expected {</td></tr>
+<tr><td class="h"><a name="2069"></a>2069</td><td></td><td></td><td></td><td></td><td class="s"> my $exp = shift;</td></tr>
+<tr><td class="h"><a name="2070"></a>2070</td><td></td><td></td><td></td><td></td><td class="s"> my $got = @_ ? shift : $expected{$exp};</td></tr>
+<tr><td class="h"><a name="2071"></a>2071</td><td></td><td></td><td></td><td></td><td class="s"> $got = defined $got ? ", got $got" : "";</td></tr>
+<tr><td class="h"><a name="2072"></a>2072</td><td></td><td></td><td></td><td></td><td class="s"> if (my @caller2 = caller(2)) {</td></tr>
+<tr><td class="h"><a name="2073"></a>2073</td><td></td><td></td><td></td><td></td><td class="s"> die "$caller2[3]: expected $exp graph$got, at $caller2[1] line $caller2[2].\n";</td></tr>
+<tr><td class="h"><a name="2074"></a>2074</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2075"></a>2075</td><td></td><td></td><td></td><td></td><td class="s"> my @caller1 = caller(1);</td></tr>
+<tr><td class="h"><a name="2076"></a>2076</td><td></td><td></td><td></td><td></td><td class="s"> die "$caller1[3]: expected $exp graph$got, at $caller1[1] line $caller1[2].\n";</td></tr>
+<tr><td class="h"><a name="2077"></a>2077</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2078"></a>2078</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2079"></a>2079</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2080"></a>2080</td><td></td><td></td><td></td><td></td><td class="s">sub expect_undirected {</td></tr>
+<tr><td class="h"><a name="2081"></a>2081</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2082"></a>2082</td><td></td><td></td><td></td><td></td><td class="s"> _expected('undirected') unless $g->is_undirected;</td></tr>
+<tr><td class="h"><a name="2083"></a>2083</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2084"></a>2084</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2085"></a>2085</td><td></td><td></td><td></td><td></td><td class="s">sub expect_directed {</td></tr>
+<tr><td class="h"><a name="2086"></a>2086</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2087"></a>2087</td><td></td><td></td><td></td><td></td><td class="s"> _expected('directed') unless $g->is_directed;</td></tr>
+<tr><td class="h"><a name="2088"></a>2088</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2089"></a>2089</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2090"></a>2090</td><td></td><td></td><td></td><td></td><td class="s">sub expect_acyclic {</td></tr>
+<tr><td class="h"><a name="2091"></a>2091</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2092"></a>2092</td><td></td><td></td><td></td><td></td><td class="s"> _expected('acyclic') unless $g->is_acyclic;</td></tr>
+<tr><td class="h"><a name="2093"></a>2093</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2094"></a>2094</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2095"></a>2095</td><td></td><td></td><td></td><td></td><td class="s">sub expect_dag {</td></tr>
+<tr><td class="h"><a name="2096"></a>2096</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2097"></a>2097</td><td></td><td></td><td></td><td></td><td class="s"> my @got;</td></tr>
+<tr><td class="h"><a name="2098"></a>2098</td><td></td><td></td><td></td><td></td><td class="s"> push @got, 'undirected' unless $g->is_directed;</td></tr>
+<tr><td class="h"><a name="2099"></a>2099</td><td></td><td></td><td></td><td></td><td class="s"> push @got, 'cyclic' unless $g->is_acyclic;</td></tr>
+<tr><td class="h"><a name="2100"></a>2100</td><td></td><td></td><td></td><td></td><td class="s"> _expected('directed acyclic', "@got") if @got;</td></tr>
+<tr><td class="h"><a name="2101"></a>2101</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2102"></a>2102</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2103"></a>2103</td><td></td><td></td><td></td><td></td><td class="s">sub expect_multivertexed {</td></tr>
+<tr><td class="h"><a name="2104"></a>2104</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2105"></a>2105</td><td></td><td></td><td></td><td></td><td class="s"> _expected('multivertexed') unless $g->is_multivertexed;</td></tr>
+<tr><td class="h"><a name="2106"></a>2106</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2107"></a>2107</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2108"></a>2108</td><td></td><td></td><td></td><td></td><td class="s">sub expect_non_multivertexed {</td></tr>
+<tr><td class="h"><a name="2109"></a>2109</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2110"></a>2110</td><td></td><td></td><td></td><td></td><td class="s"> _expected('non-multivertexed') if $g->is_multivertexed;</td></tr>
+<tr><td class="h"><a name="2111"></a>2111</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2112"></a>2112</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2113"></a>2113</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 294ms (115+179) within Graph::expect_non_multiedged which was called 41599 times, avg 7µs/call:
+# 15571 times (41.8ms+65.3ms) by Graph::get_edge_attributes at <a href="Graph-pm-695-block.html#1533">line 1533</a>, avg 7µs/call
+# 13355 times (40.0ms+61.6ms) by Graph::has_edge_attribute at <a href="Graph-pm-695-block.html#1516">line 1516</a>, avg 8µs/call
+# 12664 times (33.5ms+51.8ms) by Graph::set_edge_attribute at <a href="Graph-pm-695-block.html#1464">line 1464</a>, avg 7µs/call
+# 9 times (28µs+37µs) by Graph::get_edge_attribute at <a href="Graph-pm-695-block.html#1565">line 1565</a>, avg 7µs/call</div></div>sub expect_non_multiedged {</td></tr>
+<tr><td class="h"><a name="2114"></a>2114</td><td class="c0">83198</td><td class="c0"><span title="Avg 1µs">100ms</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2115"></a>2115</td><td></td><td></td><td class="c0">41599</td><td class="c0">179ms</td><td class="s"> _expected('non-multiedged') if $g->is_multiedged;<div class="calls"><div class="calls_out"> # spent 179ms making 41599 calls to <a href="Graph-pm-695-block.html#338">Graph::multiedged</a>, avg 4µs/call</div></div></td></tr>
+<tr><td class="h"><a name="2116"></a>2116</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2117"></a>2117</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2118"></a>2118</td><td></td><td></td><td></td><td></td><td class="s">sub expect_multiedged {</td></tr>
+<tr><td class="h"><a name="2119"></a>2119</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2120"></a>2120</td><td></td><td></td><td></td><td></td><td class="s"> _expected('multiedged') unless $g->is_multiedged;</td></tr>
+<tr><td class="h"><a name="2121"></a>2121</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2122"></a>2122</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2123"></a>2123</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 797µs (562+235) within Graph::expect_non_unionfind which was called 117 times, avg 7µs/call:
+# 107 times (519µs+221µs) by Graph::delete_vertex at <a href="Graph-pm-695-block.html#991">line 991</a>, avg 7µs/call
+# 10 times (43µs+14µs) by Graph::delete_edge at <a href="Graph-pm-695-block.html#979">line 979</a>, avg 6µs/call</div></div>sub expect_non_unionfind {</td></tr>
+<tr><td class="h"><a name="2124"></a>2124</td><td class="c0">234</td><td class="c0"><span title="Avg 2µs">464µs</span></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2125"></a>2125</td><td></td><td></td><td class="c1">117</td><td class="c3">235µs</td><td class="s"> _expected('non-unionfind') if $g->has_union_find;<div class="calls"><div class="calls_out"> # spent 235µs making 117 calls to <a href="Graph-pm-695-block.html#141">Graph::has_union_find</a>, avg 2µs/call</div></div></td></tr>
+<tr><td class="h"><a name="2126"></a>2126</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2127"></a>2127</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2128"></a>2128</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 766µs within Graph::_get_options which was called 54 times, avg 14µs/call:
+# 54 times (766µs+0s) by Graph::new at <a href="Graph-pm-695-block.html#175">line 175</a>, avg 14µs/call</div></div>sub _get_options {</td></tr>
+<tr><td class="h"><a name="2129"></a>2129</td><td class="c0">270</td><td class="c0"><span title="Avg 3µs">807µs</span></td><td></td><td></td><td class="s"> my @caller = caller(1);</td></tr>
+<tr><td class="h"><a name="2130"></a>2130</td><td></td><td></td><td></td><td></td><td class="s"> unless (@_ == 1 && ref $_[0] eq 'ARRAY') {</td></tr>
+<tr><td class="h"><a name="2131"></a>2131</td><td></td><td></td><td></td><td></td><td class="s"> die "$caller[3]: internal error: should be called with only one array ref argument, at $caller[1] line $caller[2].\n";</td></tr>
+<tr><td class="h"><a name="2132"></a>2132</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2133"></a>2133</td><td></td><td></td><td></td><td></td><td class="s"> my @opt = @{ $_[0] };</td></tr>
+<tr><td class="h"><a name="2134"></a>2134</td><td></td><td></td><td></td><td></td><td class="s"> unless (@opt % 2 == 0) {</td></tr>
+<tr><td class="h"><a name="2135"></a>2135</td><td></td><td></td><td></td><td></td><td class="s"> die "$caller[3]: expected an options hash, got a non-even number of arguments, at $caller[1] line $caller[2].\n";</td></tr>
+<tr><td class="h"><a name="2136"></a>2136</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2137"></a>2137</td><td></td><td></td><td></td><td></td><td class="s"> return @opt;</td></tr>
+<tr><td class="h"><a name="2138"></a>2138</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2139"></a>2139</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2140"></a>2140</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="2141"></a>2141</td><td></td><td></td><td></td><td></td><td class="s"># Random constructors and accessors.</td></tr>
+<tr><td class="h"><a name="2142"></a>2142</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="2143"></a>2143</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2144"></a>2144</td><td></td><td></td><td></td><td></td><td class="s">sub __fisher_yates_shuffle (@) {</td></tr>
+<tr><td class="h"><a name="2145"></a>2145</td><td></td><td></td><td></td><td></td><td class="s"> # From perlfaq4, but modified to be non-modifying.</td></tr>
+<tr><td class="h"><a name="2146"></a>2146</td><td></td><td></td><td></td><td></td><td class="s"> my @a = @_;</td></tr>
+<tr><td class="h"><a name="2147"></a>2147</td><td></td><td></td><td></td><td></td><td class="s"> my $i = @a;</td></tr>
+<tr><td class="h"><a name="2148"></a>2148</td><td></td><td></td><td></td><td></td><td class="s"> while ($i--) {</td></tr>
+<tr><td class="h"><a name="2149"></a>2149</td><td></td><td></td><td></td><td></td><td class="s"> my $j = int rand ($i+1);</td></tr>
+<tr><td class="h"><a name="2150"></a>2150</td><td></td><td></td><td></td><td></td><td class="s"> @a[$i,$j] = @a[$j,$i];</td></tr>
+<tr><td class="h"><a name="2151"></a>2151</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2152"></a>2152</td><td></td><td></td><td></td><td></td><td class="s"> return @a;</td></tr>
+<tr><td class="h"><a name="2153"></a>2153</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2154"></a>2154</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2155"></a>2155</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 32µs within Graph::BEGIN@2155 which was called:
+# once (32µs+0s) by Text::Tradition::Collation::BEGIN@6 at <a href="Graph-pm-695-block.html#2166">line 2166</a></div></div>BEGIN {</td></tr>
+<tr><td class="h"><a name="2156"></a>2156</td><td></td><td></td><td></td><td></td><td class="s"> sub _shuffle(@);</td></tr>
+<tr><td class="h"><a name="2157"></a>2157</td><td></td><td></td><td></td><td></td><td class="s"> # Workaround for the Perl bug [perl #32383] where -d:Dprof and</td></tr>
+<tr><td class="h"><a name="2158"></a>2158</td><td></td><td></td><td></td><td></td><td class="s"> # List::Util::shuffle do not like each other: if any debugging</td></tr>
+<tr><td class="h"><a name="2159"></a>2159</td><td></td><td></td><td></td><td></td><td class="s"> # (-d) flags are on, fall back to our own Fisher-Yates shuffle.</td></tr>
+<tr><td class="h"><a name="2160"></a>2160</td><td></td><td></td><td></td><td></td><td class="s"> # The bug was fixed by perl changes #26054 and #26062, which</td></tr>
+<tr><td class="h"><a name="2161"></a>2161</td><td></td><td></td><td></td><td></td><td class="s"> # went to Perl 5.9.3. If someone tests this with a pre-5.9.3</td></tr>
+<tr><td class="h"><a name="2162"></a>2162</td><td></td><td></td><td></td><td></td><td class="s"> # bleadperl that calls itself 5.9.3 but doesn't yet have the</td></tr>
+<tr><td class="h"><a name="2163"></a>2163</td><td></td><td></td><td></td><td></td><td class="s"> # patches, oh, well.</td></tr>
+<tr><td class="h"><a name="2164"></a>2164</td><td class="c3">1</td><td class="c3"><span title="Avg 37µs">37µs</span></td><td></td><td></td><td class="s"> *_shuffle = $^P && $] < 5.009003 ?</td></tr>
+<tr><td class="h"><a name="2165"></a>2165</td><td></td><td></td><td></td><td></td><td class="s"> \&__fisher_yates_shuffle : \&List::Util::shuffle;</td></tr>
+<tr><td class="h"><a name="2166"></a>2166</td><td class="c3">1</td><td class="c0"><span title="Avg 9.11ms">9.11ms</span></td><td class="c3">1</td><td class="c3">32µs</td><td class="s">}<div class="calls"><div class="calls_out"># spent 32µs making 1 call to <a href="Graph-pm-695-block.html#2155">Graph::BEGIN@2155</a></div></div></td></tr>
+<tr><td class="h"><a name="2167"></a>2167</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2168"></a>2168</td><td></td><td></td><td></td><td></td><td class="s">sub random_graph {</td></tr>
+<tr><td class="h"><a name="2169"></a>2169</td><td></td><td></td><td></td><td></td><td class="s"> my $class = (@_ % 2) == 0 ? 'Graph' : shift;</td></tr>
+<tr><td class="h"><a name="2170"></a>2170</td><td></td><td></td><td></td><td></td><td class="s"> my %opt = _get_options( \@_ );</td></tr>
+<tr><td class="h"><a name="2171"></a>2171</td><td></td><td></td><td></td><td></td><td class="s"> my $random_edge;</td></tr>
+<tr><td class="h"><a name="2172"></a>2172</td><td></td><td></td><td></td><td></td><td class="s"> unless (exists $opt{vertices} && defined $opt{vertices}) {</td></tr>
+<tr><td class="h"><a name="2173"></a>2173</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="2174"></a>2174</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("Graph::random_graph: argument 'vertices' missing or undef");</td></tr>
+<tr><td class="h"><a name="2175"></a>2175</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2176"></a>2176</td><td></td><td></td><td></td><td></td><td class="s"> if (exists $opt{random_seed}) {</td></tr>
+<tr><td class="h"><a name="2177"></a>2177</td><td></td><td></td><td></td><td></td><td class="s"> srand($opt{random_seed});</td></tr>
+<tr><td class="h"><a name="2178"></a>2178</td><td></td><td></td><td></td><td></td><td class="s"> delete $opt{random_seed};</td></tr>
+<tr><td class="h"><a name="2179"></a>2179</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2180"></a>2180</td><td></td><td></td><td></td><td></td><td class="s"> if (exists $opt{random_edge}) {</td></tr>
+<tr><td class="h"><a name="2181"></a>2181</td><td></td><td></td><td></td><td></td><td class="s"> $random_edge = $opt{random_edge};</td></tr>
+<tr><td class="h"><a name="2182"></a>2182</td><td></td><td></td><td></td><td></td><td class="s"> delete $opt{random_edge};</td></tr>
+<tr><td class="h"><a name="2183"></a>2183</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2184"></a>2184</td><td></td><td></td><td></td><td></td><td class="s"> my @V;</td></tr>
+<tr><td class="h"><a name="2185"></a>2185</td><td></td><td></td><td></td><td></td><td class="s"> if (my $ref = ref $opt{vertices}) {</td></tr>
+<tr><td class="h"><a name="2186"></a>2186</td><td></td><td></td><td></td><td></td><td class="s"> if ($ref eq 'ARRAY') {</td></tr>
+<tr><td class="h"><a name="2187"></a>2187</td><td></td><td></td><td></td><td></td><td class="s"> @V = @{ $opt{vertices} };</td></tr>
+<tr><td class="h"><a name="2188"></a>2188</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2189"></a>2189</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("Graph::random_graph: argument 'vertices' illegal");</td></tr>
+<tr><td class="h"><a name="2190"></a>2190</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2191"></a>2191</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2192"></a>2192</td><td></td><td></td><td></td><td></td><td class="s"> @V = 0..($opt{vertices} - 1);</td></tr>
+<tr><td class="h"><a name="2193"></a>2193</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2194"></a>2194</td><td></td><td></td><td></td><td></td><td class="s"> delete $opt{vertices};</td></tr>
+<tr><td class="h"><a name="2195"></a>2195</td><td></td><td></td><td></td><td></td><td class="s"> my $V = @V;</td></tr>
+<tr><td class="h"><a name="2196"></a>2196</td><td></td><td></td><td></td><td></td><td class="s"> my $C = $V * ($V - 1) / 2;</td></tr>
+<tr><td class="h"><a name="2197"></a>2197</td><td></td><td></td><td></td><td></td><td class="s"> my $E;</td></tr>
+<tr><td class="h"><a name="2198"></a>2198</td><td></td><td></td><td></td><td></td><td class="s"> if (exists $opt{edges} && exists $opt{edges_fill}) {</td></tr>
+<tr><td class="h"><a name="2199"></a>2199</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("Graph::random_graph: both arguments 'edges' and 'edges_fill' specified");</td></tr>
+<tr><td class="h"><a name="2200"></a>2200</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2201"></a>2201</td><td></td><td></td><td></td><td></td><td class="s"> $E = exists $opt{edges_fill} ? $opt{edges_fill} * $C : $opt{edges};</td></tr>
+<tr><td class="h"><a name="2202"></a>2202</td><td></td><td></td><td></td><td></td><td class="s"> delete $opt{edges};</td></tr>
+<tr><td class="h"><a name="2203"></a>2203</td><td></td><td></td><td></td><td></td><td class="s"> delete $opt{edges_fill};</td></tr>
+<tr><td class="h"><a name="2204"></a>2204</td><td></td><td></td><td></td><td></td><td class="s"> my $g = $class->new(%opt);</td></tr>
+<tr><td class="h"><a name="2205"></a>2205</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_vertices(@V);</td></tr>
+<tr><td class="h"><a name="2206"></a>2206</td><td></td><td></td><td></td><td></td><td class="s"> return $g if $V < 2;</td></tr>
+<tr><td class="h"><a name="2207"></a>2207</td><td></td><td></td><td></td><td></td><td class="s"> $C *= 2 if $g->directed;</td></tr>
+<tr><td class="h"><a name="2208"></a>2208</td><td></td><td></td><td></td><td></td><td class="s"> $E = $C / 2 unless defined $E;</td></tr>
+<tr><td class="h"><a name="2209"></a>2209</td><td></td><td></td><td></td><td></td><td class="s"> $E = int($E + 0.5);</td></tr>
+<tr><td class="h"><a name="2210"></a>2210</td><td></td><td></td><td></td><td></td><td class="s"> my $p = $E / $C;</td></tr>
+<tr><td class="h"><a name="2211"></a>2211</td><td></td><td></td><td></td><td></td><td class="s"> $random_edge = sub { $p } unless defined $random_edge;</td></tr>
+<tr><td class="h"><a name="2212"></a>2212</td><td></td><td></td><td></td><td></td><td class="s"> # print "V = $V, E = $E, C = $C, p = $p\n";</td></tr>
+<tr><td class="h"><a name="2213"></a>2213</td><td></td><td></td><td></td><td></td><td class="s"> if ($p > 1.0 && !($g->countedged || $g->multiedged)) {</td></tr>
+<tr><td class="h"><a name="2214"></a>2214</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="2215"></a>2215</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("Graph::random_graph: needs to be countedged or multiedged ($E > $C)");</td></tr>
+<tr><td class="h"><a name="2216"></a>2216</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2217"></a>2217</td><td></td><td></td><td></td><td></td><td class="s"> my @V1 = @V;</td></tr>
+<tr><td class="h"><a name="2218"></a>2218</td><td></td><td></td><td></td><td></td><td class="s"> my @V2 = @V;</td></tr>
+<tr><td class="h"><a name="2219"></a>2219</td><td></td><td></td><td></td><td></td><td class="s"> # Shuffle the vertex lists so that the pairs at</td></tr>
+<tr><td class="h"><a name="2220"></a>2220</td><td></td><td></td><td></td><td></td><td class="s"> # the beginning of the lists are not more likely.</td></tr>
+<tr><td class="h"><a name="2221"></a>2221</td><td></td><td></td><td></td><td></td><td class="s"> @V1 = _shuffle @V1;</td></tr>
+<tr><td class="h"><a name="2222"></a>2222</td><td></td><td></td><td></td><td></td><td class="s"> @V2 = _shuffle @V2;</td></tr>
+<tr><td class="h"><a name="2223"></a>2223</td><td></td><td></td><td></td><td></td><td class="s"> LOOP:</td></tr>
+<tr><td class="h"><a name="2224"></a>2224</td><td></td><td></td><td></td><td></td><td class="s"> while ($E) {</td></tr>
+<tr><td class="h"><a name="2225"></a>2225</td><td></td><td></td><td></td><td></td><td class="s"> for my $v1 (@V1) {</td></tr>
+<tr><td class="h"><a name="2226"></a>2226</td><td></td><td></td><td></td><td></td><td class="s"> for my $v2 (@V2) {</td></tr>
+<tr><td class="h"><a name="2227"></a>2227</td><td></td><td></td><td></td><td></td><td class="s"> next if $v1 eq $v2; # TODO: allow self-loops?</td></tr>
+<tr><td class="h"><a name="2228"></a>2228</td><td></td><td></td><td></td><td></td><td class="s"> my $q = $random_edge->($g, $v1, $v2, $p);</td></tr>
+<tr><td class="h"><a name="2229"></a>2229</td><td></td><td></td><td></td><td></td><td class="s"> if ($q && ($q == 1 || rand() <= $q) &&</td></tr>
+<tr><td class="h"><a name="2230"></a>2230</td><td></td><td></td><td></td><td></td><td class="s"> !$g->has_edge($v1, $v2)) {</td></tr>
+<tr><td class="h"><a name="2231"></a>2231</td><td></td><td></td><td></td><td></td><td class="s"> $g->add_edge($v1, $v2);</td></tr>
+<tr><td class="h"><a name="2232"></a>2232</td><td></td><td></td><td></td><td></td><td class="s"> $E--;</td></tr>
+<tr><td class="h"><a name="2233"></a>2233</td><td></td><td></td><td></td><td></td><td class="s"> last LOOP unless $E;</td></tr>
+<tr><td class="h"><a name="2234"></a>2234</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2235"></a>2235</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2236"></a>2236</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2237"></a>2237</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2238"></a>2238</td><td></td><td></td><td></td><td></td><td class="s"> return $g;</td></tr>
+<tr><td class="h"><a name="2239"></a>2239</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2240"></a>2240</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2241"></a>2241</td><td></td><td></td><td></td><td></td><td class="s">sub random_vertex {</td></tr>
+<tr><td class="h"><a name="2242"></a>2242</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2243"></a>2243</td><td></td><td></td><td></td><td></td><td class="s"> my @V = $g->vertices05;</td></tr>
+<tr><td class="h"><a name="2244"></a>2244</td><td></td><td></td><td></td><td></td><td class="s"> @V[rand @V];</td></tr>
+<tr><td class="h"><a name="2245"></a>2245</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2246"></a>2246</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2247"></a>2247</td><td></td><td></td><td></td><td></td><td class="s">sub random_edge {</td></tr>
+<tr><td class="h"><a name="2248"></a>2248</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2249"></a>2249</td><td></td><td></td><td></td><td></td><td class="s"> my @E = $g->edges05;</td></tr>
+<tr><td class="h"><a name="2250"></a>2250</td><td></td><td></td><td></td><td></td><td class="s"> @E[rand @E];</td></tr>
+<tr><td class="h"><a name="2251"></a>2251</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2252"></a>2252</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2253"></a>2253</td><td></td><td></td><td></td><td></td><td class="s">sub random_successor {</td></tr>
+<tr><td class="h"><a name="2254"></a>2254</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $v) = @_;</td></tr>
+<tr><td class="h"><a name="2255"></a>2255</td><td></td><td></td><td></td><td></td><td class="s"> my @S = $g->successors($v);</td></tr>
+<tr><td class="h"><a name="2256"></a>2256</td><td></td><td></td><td></td><td></td><td class="s"> @S[rand @S];</td></tr>
+<tr><td class="h"><a name="2257"></a>2257</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2258"></a>2258</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2259"></a>2259</td><td></td><td></td><td></td><td></td><td class="s">sub random_predecessor {</td></tr>
+<tr><td class="h"><a name="2260"></a>2260</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $v) = @_;</td></tr>
+<tr><td class="h"><a name="2261"></a>2261</td><td></td><td></td><td></td><td></td><td class="s"> my @P = $g->predecessors($v);</td></tr>
+<tr><td class="h"><a name="2262"></a>2262</td><td></td><td></td><td></td><td></td><td class="s"> @P[rand @P];</td></tr>
+<tr><td class="h"><a name="2263"></a>2263</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2264"></a>2264</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2265"></a>2265</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="2266"></a>2266</td><td></td><td></td><td></td><td></td><td class="s"># Algorithms.</td></tr>
+<tr><td class="h"><a name="2267"></a>2267</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="2268"></a>2268</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2269"></a>2269</td><td class="c3">1</td><td class="c3"><span title="Avg 3µs">3µs</span></td><td></td><td></td><td class="s">my $MST_comparator = sub { ($_[0] || 0) <=> ($_[1] || 0) };</td></tr>
+<tr><td class="h"><a name="2270"></a>2270</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2271"></a>2271</td><td></td><td></td><td></td><td></td><td class="s">sub _MST_attr {</td></tr>
+<tr><td class="h"><a name="2272"></a>2272</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = shift;</td></tr>
+<tr><td class="h"><a name="2273"></a>2273</td><td></td><td></td><td></td><td></td><td class="s"> my $attribute =</td></tr>
+<tr><td class="h"><a name="2274"></a>2274</td><td></td><td></td><td></td><td></td><td class="s"> exists $attr->{attribute} ?</td></tr>
+<tr><td class="h"><a name="2275"></a>2275</td><td></td><td></td><td></td><td></td><td class="s"> $attr->{attribute} : $defattr;</td></tr>
+<tr><td class="h"><a name="2276"></a>2276</td><td></td><td></td><td></td><td></td><td class="s"> my $comparator =</td></tr>
+<tr><td class="h"><a name="2277"></a>2277</td><td></td><td></td><td></td><td></td><td class="s"> exists $attr->{comparator} ?</td></tr>
+<tr><td class="h"><a name="2278"></a>2278</td><td></td><td></td><td></td><td></td><td class="s"> $attr->{comparator} : $MST_comparator;</td></tr>
+<tr><td class="h"><a name="2279"></a>2279</td><td></td><td></td><td></td><td></td><td class="s"> return ($attribute, $comparator);</td></tr>
+<tr><td class="h"><a name="2280"></a>2280</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2281"></a>2281</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2282"></a>2282</td><td></td><td></td><td></td><td></td><td class="s">sub _MST_edges {</td></tr>
+<tr><td class="h"><a name="2283"></a>2283</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $attr) = @_;</td></tr>
+<tr><td class="h"><a name="2284"></a>2284</td><td></td><td></td><td></td><td></td><td class="s"> my ($attribute, $comparator) = _MST_attr($attr);</td></tr>
+<tr><td class="h"><a name="2285"></a>2285</td><td></td><td></td><td></td><td></td><td class="s"> map { $_->[1] }</td></tr>
+<tr><td class="h"><a name="2286"></a>2286</td><td></td><td></td><td></td><td></td><td class="s"> sort { $comparator->($a->[0], $b->[0], $a->[1], $b->[1]) }</td></tr>
+<tr><td class="h"><a name="2287"></a>2287</td><td></td><td></td><td></td><td></td><td class="s"> map { [ $g->get_edge_attribute(@$_, $attribute), $_ ] }</td></tr>
+<tr><td class="h"><a name="2288"></a>2288</td><td></td><td></td><td></td><td></td><td class="s"> $g->edges05;</td></tr>
+<tr><td class="h"><a name="2289"></a>2289</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2290"></a>2290</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2291"></a>2291</td><td></td><td></td><td></td><td></td><td class="s">sub MST_Kruskal {</td></tr>
+<tr><td class="h"><a name="2292"></a>2292</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, %attr) = @_;</td></tr>
+<tr><td class="h"><a name="2293"></a>2293</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2294"></a>2294</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_undirected;</td></tr>
+<tr><td class="h"><a name="2295"></a>2295</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2296"></a>2296</td><td></td><td></td><td></td><td></td><td class="s"> my $MST = Graph::Undirected->new;</td></tr>
+<tr><td class="h"><a name="2297"></a>2297</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2298"></a>2298</td><td></td><td></td><td></td><td></td><td class="s"> my $UF = Graph::UnionFind->new;</td></tr>
+<tr><td class="h"><a name="2299"></a>2299</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ($g->vertices05) { $UF->add($v) }</td></tr>
+<tr><td class="h"><a name="2300"></a>2300</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2301"></a>2301</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ($g->_MST_edges(\%attr)) {</td></tr>
+<tr><td class="h"><a name="2302"></a>2302</td><td></td><td></td><td></td><td></td><td class="s"> my ($u, $v) = @$e; # TODO: hyperedges</td></tr>
+<tr><td class="h"><a name="2303"></a>2303</td><td></td><td></td><td></td><td></td><td class="s"> my $t0 = $UF->find( $u );</td></tr>
+<tr><td class="h"><a name="2304"></a>2304</td><td></td><td></td><td></td><td></td><td class="s"> my $t1 = $UF->find( $v );</td></tr>
+<tr><td class="h"><a name="2305"></a>2305</td><td></td><td></td><td></td><td></td><td class="s"> unless ($t0 eq $t1) {</td></tr>
+<tr><td class="h"><a name="2306"></a>2306</td><td></td><td></td><td></td><td></td><td class="s"> $UF->union($u, $v);</td></tr>
+<tr><td class="h"><a name="2307"></a>2307</td><td></td><td></td><td></td><td></td><td class="s"> $MST->add_edge($u, $v);</td></tr>
+<tr><td class="h"><a name="2308"></a>2308</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2309"></a>2309</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2310"></a>2310</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2311"></a>2311</td><td></td><td></td><td></td><td></td><td class="s"> return $MST;</td></tr>
+<tr><td class="h"><a name="2312"></a>2312</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2313"></a>2313</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2314"></a>2314</td><td></td><td></td><td></td><td></td><td class="s">sub _MST_add {</td></tr>
+<tr><td class="h"><a name="2315"></a>2315</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $h, $HF, $r, $attr, $unseen) = @_;</td></tr>
+<tr><td class="h"><a name="2316"></a>2316</td><td></td><td></td><td></td><td></td><td class="s"> for my $s ( grep { exists $unseen->{ $_ } } $g->successors( $r ) ) {</td></tr>
+<tr><td class="h"><a name="2317"></a>2317</td><td></td><td></td><td></td><td></td><td class="s"> $HF->add( Graph::MSTHeapElem->new( $r, $s, $g->get_edge_attribute( $r, $s, $attr ) ) );</td></tr>
+<tr><td class="h"><a name="2318"></a>2318</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2319"></a>2319</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2320"></a>2320</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2321"></a>2321</td><td></td><td></td><td></td><td></td><td class="s">sub _next_alphabetic { shift; (sort keys %{ $_[0] })[0] }</td></tr>
+<tr><td class="h"><a name="2322"></a>2322</td><td></td><td></td><td></td><td></td><td class="s">sub _next_numeric { shift; (sort { $a <=> $b } keys %{ $_[0] })[0] }</td></tr>
+<tr><td class="h"><a name="2323"></a>2323</td><td class="c0">107186</td><td class="c0"><span title="Avg 2µs">177ms</span></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 141ms within Graph::_next_random which was called 53593 times, avg 3µs/call:
+# 53130 times (133ms+0s) by Graph::Traversal::next at <a href="Graph-Traversal-pm-713-block.html#298">line 298 of Graph/Traversal.pm</a>, avg 2µs/call
+# 412 times (6.05ms+0s) by Graph::Traversal::next at <a href="Graph-Traversal-pm-713-block.html#332">line 332 of Graph/Traversal.pm</a>, avg 15µs/call
+# 51 times (2.64ms+0s) by Graph::Traversal::next at <a href="Graph-Traversal-pm-713-block.html#324">line 324 of Graph/Traversal.pm</a>, avg 52µs/call</div></div>sub _next_random { shift; (values %{ $_[0] })[ rand keys %{ $_[0] } ] }</td></tr>
+<tr><td class="h"><a name="2324"></a>2324</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2325"></a>2325</td><td></td><td></td><td></td><td></td><td class="s">sub _root_opt {</td></tr>
+<tr><td class="h"><a name="2326"></a>2326</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2327"></a>2327</td><td></td><td></td><td></td><td></td><td class="s"> my %opt = @_ == 1 ? ( first_root => $_[0] ) : _get_options( \@_ );</td></tr>
+<tr><td class="h"><a name="2328"></a>2328</td><td></td><td></td><td></td><td></td><td class="s"> my %unseen;</td></tr>
+<tr><td class="h"><a name="2329"></a>2329</td><td></td><td></td><td></td><td></td><td class="s"> my @unseen = $g->vertices05;</td></tr>
+<tr><td class="h"><a name="2330"></a>2330</td><td></td><td></td><td></td><td></td><td class="s"> @unseen{ @unseen } = @unseen;</td></tr>
+<tr><td class="h"><a name="2331"></a>2331</td><td></td><td></td><td></td><td></td><td class="s"> @unseen = _shuffle @unseen;</td></tr>
+<tr><td class="h"><a name="2332"></a>2332</td><td></td><td></td><td></td><td></td><td class="s"> my $r;</td></tr>
+<tr><td class="h"><a name="2333"></a>2333</td><td></td><td></td><td></td><td></td><td class="s"> if (exists $opt{ start }) {</td></tr>
+<tr><td class="h"><a name="2334"></a>2334</td><td></td><td></td><td></td><td></td><td class="s"> $opt{ first_root } = $opt{ start };</td></tr>
+<tr><td class="h"><a name="2335"></a>2335</td><td></td><td></td><td></td><td></td><td class="s"> $opt{ next_root } = undef;</td></tr>
+<tr><td class="h"><a name="2336"></a>2336</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2337"></a>2337</td><td></td><td></td><td></td><td></td><td class="s"> if (exists $opt{ get_next_root }) {</td></tr>
+<tr><td class="h"><a name="2338"></a>2338</td><td></td><td></td><td></td><td></td><td class="s"> $opt{ next_root } = $opt{ get_next_root }; # Graph 0.201 compat.</td></tr>
+<tr><td class="h"><a name="2339"></a>2339</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2340"></a>2340</td><td></td><td></td><td></td><td></td><td class="s"> if (exists $opt{ first_root }) {</td></tr>
+<tr><td class="h"><a name="2341"></a>2341</td><td></td><td></td><td></td><td></td><td class="s"> if (ref $opt{ first_root } eq 'CODE') {</td></tr>
+<tr><td class="h"><a name="2342"></a>2342</td><td></td><td></td><td></td><td></td><td class="s"> $r = $opt{ first_root }->( $g, \%unseen );</td></tr>
+<tr><td class="h"><a name="2343"></a>2343</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2344"></a>2344</td><td></td><td></td><td></td><td></td><td class="s"> $r = $opt{ first_root };</td></tr>
+<tr><td class="h"><a name="2345"></a>2345</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2346"></a>2346</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2347"></a>2347</td><td></td><td></td><td></td><td></td><td class="s"> $r = shift @unseen;</td></tr>
+<tr><td class="h"><a name="2348"></a>2348</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2349"></a>2349</td><td></td><td></td><td></td><td></td><td class="s"> my $next =</td></tr>
+<tr><td class="h"><a name="2350"></a>2350</td><td></td><td></td><td></td><td></td><td class="s"> exists $opt{ next_root } ?</td></tr>
+<tr><td class="h"><a name="2351"></a>2351</td><td></td><td></td><td></td><td></td><td class="s"> $opt{ next_root } :</td></tr>
+<tr><td class="h"><a name="2352"></a>2352</td><td></td><td></td><td></td><td></td><td class="s"> $opt{ next_alphabetic } ?</td></tr>
+<tr><td class="h"><a name="2353"></a>2353</td><td></td><td></td><td></td><td></td><td class="s"> \&_next_alphabetic :</td></tr>
+<tr><td class="h"><a name="2354"></a>2354</td><td></td><td></td><td></td><td></td><td class="s"> $opt{ next_numeric } ? \&_next_numeric :</td></tr>
+<tr><td class="h"><a name="2355"></a>2355</td><td></td><td></td><td></td><td></td><td class="s"> \&_next_random;</td></tr>
+<tr><td class="h"><a name="2356"></a>2356</td><td></td><td></td><td></td><td></td><td class="s"> my $code = ref $next eq 'CODE';</td></tr>
+<tr><td class="h"><a name="2357"></a>2357</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = exists $opt{ attribute } ? $opt{ attribute } : $defattr;</td></tr>
+<tr><td class="h"><a name="2358"></a>2358</td><td></td><td></td><td></td><td></td><td class="s"> return ( \%opt, \%unseen, \@unseen, $r, $next, $code, $attr );</td></tr>
+<tr><td class="h"><a name="2359"></a>2359</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2360"></a>2360</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2361"></a>2361</td><td></td><td></td><td></td><td></td><td class="s">sub _heap_walk {</td></tr>
+<tr><td class="h"><a name="2362"></a>2362</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $h, $add, $etc) = splice @_, 0, 4; # Leave %opt in @_.</td></tr>
+<tr><td class="h"><a name="2363"></a>2363</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2364"></a>2364</td><td></td><td></td><td></td><td></td><td class="s"> my ($opt, $unseenh, $unseena, $r, $next, $code, $attr) = $g->_root_opt(@_);</td></tr>
+<tr><td class="h"><a name="2365"></a>2365</td><td></td><td></td><td></td><td></td><td class="s"> my $HF = Heap071::Fibonacci->new;</td></tr>
+<tr><td class="h"><a name="2366"></a>2366</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2367"></a>2367</td><td></td><td></td><td></td><td></td><td class="s"> while (defined $r) {</td></tr>
+<tr><td class="h"><a name="2368"></a>2368</td><td></td><td></td><td></td><td></td><td class="s"> # print "r = $r\n";</td></tr>
+<tr><td class="h"><a name="2369"></a>2369</td><td></td><td></td><td></td><td></td><td class="s"> $add->($g, $h, $HF, $r, $attr, $unseenh, $etc);</td></tr>
+<tr><td class="h"><a name="2370"></a>2370</td><td></td><td></td><td></td><td></td><td class="s"> delete $unseenh->{ $r };</td></tr>
+<tr><td class="h"><a name="2371"></a>2371</td><td></td><td></td><td></td><td></td><td class="s"> while (defined $HF->top) {</td></tr>
+<tr><td class="h"><a name="2372"></a>2372</td><td></td><td></td><td></td><td></td><td class="s"> my $t = $HF->extract_top;</td></tr>
+<tr><td class="h"><a name="2373"></a>2373</td><td></td><td></td><td></td><td></td><td class="s"> # use Data::Dumper; print "t = ", Dumper($t);</td></tr>
+<tr><td class="h"><a name="2374"></a>2374</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $t) {</td></tr>
+<tr><td class="h"><a name="2375"></a>2375</td><td></td><td></td><td></td><td></td><td class="s"> my ($u, $v, $w) = $t->val;</td></tr>
+<tr><td class="h"><a name="2376"></a>2376</td><td></td><td></td><td></td><td></td><td class="s"> # print "extracted top: $u $v $w\n";</td></tr>
+<tr><td class="h"><a name="2377"></a>2377</td><td></td><td></td><td></td><td></td><td class="s"> if (exists $unseenh->{ $v }) {</td></tr>
+<tr><td class="h"><a name="2378"></a>2378</td><td></td><td></td><td></td><td></td><td class="s"> $h->set_edge_attribute($u, $v, $attr, $w);</td></tr>
+<tr><td class="h"><a name="2379"></a>2379</td><td></td><td></td><td></td><td></td><td class="s"> delete $unseenh->{ $v };</td></tr>
+<tr><td class="h"><a name="2380"></a>2380</td><td></td><td></td><td></td><td></td><td class="s"> $add->($g, $h, $HF, $v, $attr, $unseenh, $etc);</td></tr>
+<tr><td class="h"><a name="2381"></a>2381</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2382"></a>2382</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2383"></a>2383</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2384"></a>2384</td><td></td><td></td><td></td><td></td><td class="s"> return $h unless defined $next;</td></tr>
+<tr><td class="h"><a name="2385"></a>2385</td><td></td><td></td><td></td><td></td><td class="s"> $r = $code ? $next->( $g, $unseenh ) : shift @$unseena;</td></tr>
+<tr><td class="h"><a name="2386"></a>2386</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2387"></a>2387</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2388"></a>2388</td><td></td><td></td><td></td><td></td><td class="s"> return $h;</td></tr>
+<tr><td class="h"><a name="2389"></a>2389</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2390"></a>2390</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2391"></a>2391</td><td></td><td></td><td></td><td></td><td class="s">sub MST_Prim {</td></tr>
+<tr><td class="h"><a name="2392"></a>2392</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2393"></a>2393</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_undirected;</td></tr>
+<tr><td class="h"><a name="2394"></a>2394</td><td></td><td></td><td></td><td></td><td class="s"> $g->_heap_walk(Graph::Undirected->new(), \&_MST_add, undef, @_);</td></tr>
+<tr><td class="h"><a name="2395"></a>2395</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2396"></a>2396</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2397"></a>2397</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*MST_Dijkstra = \&MST_Prim;</td></tr>
+<tr><td class="h"><a name="2398"></a>2398</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2399"></a>2399</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*minimum_spanning_tree = \&MST_Prim;</td></tr>
+<tr><td class="h"><a name="2400"></a>2400</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2401"></a>2401</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="2402"></a>2402</td><td></td><td></td><td></td><td></td><td class="s"># Cycle detection.</td></tr>
+<tr><td class="h"><a name="2403"></a>2403</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="2404"></a>2404</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2405"></a>2405</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*is_cyclic = \&has_a_cycle;</td></tr>
+<tr><td class="h"><a name="2406"></a>2406</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2407"></a>2407</td><td></td><td></td><td></td><td></td><td class="s">sub is_acyclic {</td></tr>
+<tr><td class="h"><a name="2408"></a>2408</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2409"></a>2409</td><td></td><td></td><td></td><td></td><td class="s"> return !$g->is_cyclic;</td></tr>
+<tr><td class="h"><a name="2410"></a>2410</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2411"></a>2411</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2412"></a>2412</td><td></td><td></td><td></td><td></td><td class="s">sub is_dag {</td></tr>
+<tr><td class="h"><a name="2413"></a>2413</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2414"></a>2414</td><td></td><td></td><td></td><td></td><td class="s"> return $g->is_directed && $g->is_acyclic ? 1 : 0;</td></tr>
+<tr><td class="h"><a name="2415"></a>2415</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2416"></a>2416</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2417"></a>2417</td><td class="c3">1</td><td class="c3"><span title="Avg 2µs">2µs</span></td><td></td><td></td><td class="s">*is_directed_acyclic_graph = \&is_dag;</td></tr>
+<tr><td class="h"><a name="2418"></a>2418</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2419"></a>2419</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="2420"></a>2420</td><td></td><td></td><td></td><td></td><td class="s"># Backward compat.</td></tr>
+<tr><td class="h"><a name="2421"></a>2421</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="2422"></a>2422</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2423"></a>2423</td><td></td><td></td><td></td><td></td><td class="s">sub average_degree {</td></tr>
+<tr><td class="h"><a name="2424"></a>2424</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2425"></a>2425</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->vertices05;</td></tr>
+<tr><td class="h"><a name="2426"></a>2426</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2427"></a>2427</td><td></td><td></td><td></td><td></td><td class="s"> return $V ? $g->degree / $V : 0;</td></tr>
+<tr><td class="h"><a name="2428"></a>2428</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2429"></a>2429</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2430"></a>2430</td><td></td><td></td><td></td><td></td><td class="s">sub density_limits {</td></tr>
+<tr><td class="h"><a name="2431"></a>2431</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2432"></a>2432</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2433"></a>2433</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->vertices05;</td></tr>
+<tr><td class="h"><a name="2434"></a>2434</td><td></td><td></td><td></td><td></td><td class="s"> my $M = $V * ($V - 1);</td></tr>
+<tr><td class="h"><a name="2435"></a>2435</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2436"></a>2436</td><td></td><td></td><td></td><td></td><td class="s"> $M /= 2 if $g->is_undirected;</td></tr>
+<tr><td class="h"><a name="2437"></a>2437</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2438"></a>2438</td><td></td><td></td><td></td><td></td><td class="s"> return ( 0.25 * $M, 0.75 * $M, $M );</td></tr>
+<tr><td class="h"><a name="2439"></a>2439</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2440"></a>2440</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2441"></a>2441</td><td></td><td></td><td></td><td></td><td class="s">sub density {</td></tr>
+<tr><td class="h"><a name="2442"></a>2442</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2443"></a>2443</td><td></td><td></td><td></td><td></td><td class="s"> my ($sparse, $dense, $complete) = $g->density_limits;</td></tr>
+<tr><td class="h"><a name="2444"></a>2444</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2445"></a>2445</td><td></td><td></td><td></td><td></td><td class="s"> return $complete ? $g->edges / $complete : 0;</td></tr>
+<tr><td class="h"><a name="2446"></a>2446</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2447"></a>2447</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2448"></a>2448</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="2449"></a>2449</td><td></td><td></td><td></td><td></td><td class="s"># Attribute backward compat</td></tr>
+<tr><td class="h"><a name="2450"></a>2450</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="2451"></a>2451</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2452"></a>2452</td><td></td><td></td><td></td><td></td><td class="s">sub _attr02_012 {</td></tr>
+<tr><td class="h"><a name="2453"></a>2453</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $op, $ga, $va, $ea) = splice @_, 0, 5;</td></tr>
+<tr><td class="h"><a name="2454"></a>2454</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->is_compat02) {</td></tr>
+<tr><td class="h"><a name="2455"></a>2455</td><td></td><td></td><td></td><td></td><td class="s"> if (@_ == 0) { return $ga->( $g ) }</td></tr>
+<tr><td class="h"><a name="2456"></a>2456</td><td></td><td></td><td></td><td></td><td class="s"> elsif (@_ == 1) { return $va->( $g, @_ ) }</td></tr>
+<tr><td class="h"><a name="2457"></a>2457</td><td></td><td></td><td></td><td></td><td class="s"> elsif (@_ == 2) { return $ea->( $g, @_ ) }</td></tr>
+<tr><td class="h"><a name="2458"></a>2458</td><td></td><td></td><td></td><td></td><td class="s"> else {</td></tr>
+<tr><td class="h"><a name="2459"></a>2459</td><td></td><td></td><td></td><td></td><td class="s"> die sprintf "$op: wrong number of arguments (%d)", scalar @_;</td></tr>
+<tr><td class="h"><a name="2460"></a>2460</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2461"></a>2461</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2462"></a>2462</td><td></td><td></td><td></td><td></td><td class="s"> die "$op: not a compat02 graph"</td></tr>
+<tr><td class="h"><a name="2463"></a>2463</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2464"></a>2464</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2465"></a>2465</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2466"></a>2466</td><td></td><td></td><td></td><td></td><td class="s">sub _attr02_123 {</td></tr>
+<tr><td class="h"><a name="2467"></a>2467</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $op, $ga, $va, $ea) = splice @_, 0, 5;</td></tr>
+<tr><td class="h"><a name="2468"></a>2468</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->is_compat02) {</td></tr>
+<tr><td class="h"><a name="2469"></a>2469</td><td></td><td></td><td></td><td></td><td class="s"> if (@_ == 1) { return $ga->( $g, @_ ) }</td></tr>
+<tr><td class="h"><a name="2470"></a>2470</td><td></td><td></td><td></td><td></td><td class="s"> elsif (@_ == 2) { return $va->( $g, @_[1, 0] ) }</td></tr>
+<tr><td class="h"><a name="2471"></a>2471</td><td></td><td></td><td></td><td></td><td class="s"> elsif (@_ == 3) { return $ea->( $g, @_[1, 2, 0] ) }</td></tr>
+<tr><td class="h"><a name="2472"></a>2472</td><td></td><td></td><td></td><td></td><td class="s"> else {</td></tr>
+<tr><td class="h"><a name="2473"></a>2473</td><td></td><td></td><td></td><td></td><td class="s"> die sprintf "$op: wrong number of arguments (%d)", scalar @_;</td></tr>
+<tr><td class="h"><a name="2474"></a>2474</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2475"></a>2475</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2476"></a>2476</td><td></td><td></td><td></td><td></td><td class="s"> die "$op: not a compat02 graph"</td></tr>
+<tr><td class="h"><a name="2477"></a>2477</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2478"></a>2478</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2479"></a>2479</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2480"></a>2480</td><td></td><td></td><td></td><td></td><td class="s">sub _attr02_234 {</td></tr>
+<tr><td class="h"><a name="2481"></a>2481</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $op, $ga, $va, $ea) = splice @_, 0, 5;</td></tr>
+<tr><td class="h"><a name="2482"></a>2482</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->is_compat02) {</td></tr>
+<tr><td class="h"><a name="2483"></a>2483</td><td></td><td></td><td></td><td></td><td class="s"> if (@_ == 2) { return $ga->( $g, @_ ) }</td></tr>
+<tr><td class="h"><a name="2484"></a>2484</td><td></td><td></td><td></td><td></td><td class="s"> elsif (@_ == 3) { return $va->( $g, @_[1, 0, 2] ) }</td></tr>
+<tr><td class="h"><a name="2485"></a>2485</td><td></td><td></td><td></td><td></td><td class="s"> elsif (@_ == 4) { return $ea->( $g, @_[1, 2, 0, 3] ) }</td></tr>
+<tr><td class="h"><a name="2486"></a>2486</td><td></td><td></td><td></td><td></td><td class="s"> else {</td></tr>
+<tr><td class="h"><a name="2487"></a>2487</td><td></td><td></td><td></td><td></td><td class="s"> die sprintf "$op: wrong number of arguments (%d)", scalar @_;</td></tr>
+<tr><td class="h"><a name="2488"></a>2488</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2489"></a>2489</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2490"></a>2490</td><td></td><td></td><td></td><td></td><td class="s"> die "$op: not a compat02 graph";</td></tr>
+<tr><td class="h"><a name="2491"></a>2491</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2492"></a>2492</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2493"></a>2493</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2494"></a>2494</td><td></td><td></td><td></td><td></td><td class="s">sub set_attribute {</td></tr>
+<tr><td class="h"><a name="2495"></a>2495</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2496"></a>2496</td><td></td><td></td><td></td><td></td><td class="s"> $g->_attr02_234('set_attribute',</td></tr>
+<tr><td class="h"><a name="2497"></a>2497</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::set_graph_attribute,</td></tr>
+<tr><td class="h"><a name="2498"></a>2498</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::set_vertex_attribute,</td></tr>
+<tr><td class="h"><a name="2499"></a>2499</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::set_edge_attribute,</td></tr>
+<tr><td class="h"><a name="2500"></a>2500</td><td></td><td></td><td></td><td></td><td class="s"> @_);</td></tr>
+<tr><td class="h"><a name="2501"></a>2501</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2502"></a>2502</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2503"></a>2503</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2504"></a>2504</td><td></td><td></td><td></td><td></td><td class="s">sub set_attributes {</td></tr>
+<tr><td class="h"><a name="2505"></a>2505</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2506"></a>2506</td><td></td><td></td><td></td><td></td><td class="s"> my $a = pop;</td></tr>
+<tr><td class="h"><a name="2507"></a>2507</td><td></td><td></td><td></td><td></td><td class="s"> $g->_attr02_123('set_attributes',</td></tr>
+<tr><td class="h"><a name="2508"></a>2508</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::set_graph_attributes,</td></tr>
+<tr><td class="h"><a name="2509"></a>2509</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::set_vertex_attributes,</td></tr>
+<tr><td class="h"><a name="2510"></a>2510</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::set_edge_attributes,</td></tr>
+<tr><td class="h"><a name="2511"></a>2511</td><td></td><td></td><td></td><td></td><td class="s"> $a, @_);</td></tr>
+<tr><td class="h"><a name="2512"></a>2512</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2513"></a>2513</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2514"></a>2514</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2515"></a>2515</td><td></td><td></td><td></td><td></td><td class="s">sub get_attribute {</td></tr>
+<tr><td class="h"><a name="2516"></a>2516</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2517"></a>2517</td><td></td><td></td><td></td><td></td><td class="s"> $g->_attr02_123('get_attribute',</td></tr>
+<tr><td class="h"><a name="2518"></a>2518</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::get_graph_attribute,</td></tr>
+<tr><td class="h"><a name="2519"></a>2519</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::get_vertex_attribute,</td></tr>
+<tr><td class="h"><a name="2520"></a>2520</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::get_edge_attribute,</td></tr>
+<tr><td class="h"><a name="2521"></a>2521</td><td></td><td></td><td></td><td></td><td class="s"> @_);</td></tr>
+<tr><td class="h"><a name="2522"></a>2522</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2523"></a>2523</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2524"></a>2524</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2525"></a>2525</td><td></td><td></td><td></td><td></td><td class="s">sub get_attributes {</td></tr>
+<tr><td class="h"><a name="2526"></a>2526</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2527"></a>2527</td><td></td><td></td><td></td><td></td><td class="s"> $g->_attr02_012('get_attributes',</td></tr>
+<tr><td class="h"><a name="2528"></a>2528</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::get_graph_attributes,</td></tr>
+<tr><td class="h"><a name="2529"></a>2529</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::get_vertex_attributes,</td></tr>
+<tr><td class="h"><a name="2530"></a>2530</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::get_edge_attributes,</td></tr>
+<tr><td class="h"><a name="2531"></a>2531</td><td></td><td></td><td></td><td></td><td class="s"> @_);</td></tr>
+<tr><td class="h"><a name="2532"></a>2532</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2533"></a>2533</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2534"></a>2534</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2535"></a>2535</td><td></td><td></td><td></td><td></td><td class="s">sub has_attribute {</td></tr>
+<tr><td class="h"><a name="2536"></a>2536</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2537"></a>2537</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless @_;</td></tr>
+<tr><td class="h"><a name="2538"></a>2538</td><td></td><td></td><td></td><td></td><td class="s"> $g->_attr02_123('has_attribute',</td></tr>
+<tr><td class="h"><a name="2539"></a>2539</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::has_graph_attribute,</td></tr>
+<tr><td class="h"><a name="2540"></a>2540</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::has_vertex_attribute,</td></tr>
+<tr><td class="h"><a name="2541"></a>2541</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::get_edge_attribute,</td></tr>
+<tr><td class="h"><a name="2542"></a>2542</td><td></td><td></td><td></td><td></td><td class="s"> @_);</td></tr>
+<tr><td class="h"><a name="2543"></a>2543</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2544"></a>2544</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2545"></a>2545</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2546"></a>2546</td><td></td><td></td><td></td><td></td><td class="s">sub has_attributes {</td></tr>
+<tr><td class="h"><a name="2547"></a>2547</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2548"></a>2548</td><td></td><td></td><td></td><td></td><td class="s"> $g->_attr02_012('has_attributes',</td></tr>
+<tr><td class="h"><a name="2549"></a>2549</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::has_graph_attributes,</td></tr>
+<tr><td class="h"><a name="2550"></a>2550</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::has_vertex_attributes,</td></tr>
+<tr><td class="h"><a name="2551"></a>2551</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::has_edge_attributes,</td></tr>
+<tr><td class="h"><a name="2552"></a>2552</td><td></td><td></td><td></td><td></td><td class="s"> @_);</td></tr>
+<tr><td class="h"><a name="2553"></a>2553</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2554"></a>2554</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2555"></a>2555</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2556"></a>2556</td><td></td><td></td><td></td><td></td><td class="s">sub delete_attribute {</td></tr>
+<tr><td class="h"><a name="2557"></a>2557</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2558"></a>2558</td><td></td><td></td><td></td><td></td><td class="s"> $g->_attr02_123('delete_attribute',</td></tr>
+<tr><td class="h"><a name="2559"></a>2559</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::delete_graph_attribute,</td></tr>
+<tr><td class="h"><a name="2560"></a>2560</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::delete_vertex_attribute,</td></tr>
+<tr><td class="h"><a name="2561"></a>2561</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::delete_edge_attribute,</td></tr>
+<tr><td class="h"><a name="2562"></a>2562</td><td></td><td></td><td></td><td></td><td class="s"> @_);</td></tr>
+<tr><td class="h"><a name="2563"></a>2563</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2564"></a>2564</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2565"></a>2565</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2566"></a>2566</td><td></td><td></td><td></td><td></td><td class="s">sub delete_attributes {</td></tr>
+<tr><td class="h"><a name="2567"></a>2567</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2568"></a>2568</td><td></td><td></td><td></td><td></td><td class="s"> $g->_attr02_012('delete_attributes',</td></tr>
+<tr><td class="h"><a name="2569"></a>2569</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::delete_graph_attributes,</td></tr>
+<tr><td class="h"><a name="2570"></a>2570</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::delete_vertex_attributes,</td></tr>
+<tr><td class="h"><a name="2571"></a>2571</td><td></td><td></td><td></td><td></td><td class="s"> \&Graph::delete_edge_attributes,</td></tr>
+<tr><td class="h"><a name="2572"></a>2572</td><td></td><td></td><td></td><td></td><td class="s"> @_);</td></tr>
+<tr><td class="h"><a name="2573"></a>2573</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2574"></a>2574</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2575"></a>2575</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2576"></a>2576</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="2577"></a>2577</td><td></td><td></td><td></td><td></td><td class="s"># Simple DFS uses.</td></tr>
+<tr><td class="h"><a name="2578"></a>2578</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="2579"></a>2579</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2580"></a>2580</td><td></td><td></td><td></td><td></td><td class="s">sub topological_sort {</td></tr>
+<tr><td class="h"><a name="2581"></a>2581</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2582"></a>2582</td><td></td><td></td><td></td><td></td><td class="s"> my %opt = _get_options( \@_ );</td></tr>
+<tr><td class="h"><a name="2583"></a>2583</td><td></td><td></td><td></td><td></td><td class="s"> my $eic = $opt{ empty_if_cyclic };</td></tr>
+<tr><td class="h"><a name="2584"></a>2584</td><td></td><td></td><td></td><td></td><td class="s"> my $hac;</td></tr>
+<tr><td class="h"><a name="2585"></a>2585</td><td></td><td></td><td></td><td></td><td class="s"> if ($eic) {</td></tr>
+<tr><td class="h"><a name="2586"></a>2586</td><td></td><td></td><td></td><td></td><td class="s"> $hac = $g->has_a_cycle;</td></tr>
+<tr><td class="h"><a name="2587"></a>2587</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2588"></a>2588</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_dag;</td></tr>
+<tr><td class="h"><a name="2589"></a>2589</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2590"></a>2590</td><td></td><td></td><td></td><td></td><td class="s"> delete $opt{ empty_if_cyclic };</td></tr>
+<tr><td class="h"><a name="2591"></a>2591</td><td></td><td></td><td></td><td></td><td class="s"> my $t = Graph::Traversal::DFS->new($g, %opt);</td></tr>
+<tr><td class="h"><a name="2592"></a>2592</td><td></td><td></td><td></td><td></td><td class="s"> my @s = $t->dfs;</td></tr>
+<tr><td class="h"><a name="2593"></a>2593</td><td></td><td></td><td></td><td></td><td class="s"> $hac ? () : reverse @s;</td></tr>
+<tr><td class="h"><a name="2594"></a>2594</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2595"></a>2595</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2596"></a>2596</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*toposort = \&topological_sort;</td></tr>
+<tr><td class="h"><a name="2597"></a>2597</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2598"></a>2598</td><td></td><td></td><td></td><td></td><td class="s">sub undirected_copy {</td></tr>
+<tr><td class="h"><a name="2599"></a>2599</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2600"></a>2600</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2601"></a>2601</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="2602"></a>2602</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2603"></a>2603</td><td></td><td></td><td></td><td></td><td class="s"> my $c = Graph::Undirected->new;</td></tr>
+<tr><td class="h"><a name="2604"></a>2604</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ($g->isolated_vertices) { # TODO: if iv ...</td></tr>
+<tr><td class="h"><a name="2605"></a>2605</td><td></td><td></td><td></td><td></td><td class="s"> $c->add_vertex($v);</td></tr>
+<tr><td class="h"><a name="2606"></a>2606</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2607"></a>2607</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ($g->edges05) {</td></tr>
+<tr><td class="h"><a name="2608"></a>2608</td><td></td><td></td><td></td><td></td><td class="s"> $c->add_edge(@$e);</td></tr>
+<tr><td class="h"><a name="2609"></a>2609</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2610"></a>2610</td><td></td><td></td><td></td><td></td><td class="s"> return $c;</td></tr>
+<tr><td class="h"><a name="2611"></a>2611</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2612"></a>2612</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2613"></a>2613</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*undirected_copy_graph = \&undirected_copy;</td></tr>
+<tr><td class="h"><a name="2614"></a>2614</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2615"></a>2615</td><td></td><td></td><td></td><td></td><td class="s">sub directed_copy {</td></tr>
+<tr><td class="h"><a name="2616"></a>2616</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2617"></a>2617</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_undirected;</td></tr>
+<tr><td class="h"><a name="2618"></a>2618</td><td></td><td></td><td></td><td></td><td class="s"> my $c = Graph::Directed->new;</td></tr>
+<tr><td class="h"><a name="2619"></a>2619</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ($g->isolated_vertices) { # TODO: if iv ...</td></tr>
+<tr><td class="h"><a name="2620"></a>2620</td><td></td><td></td><td></td><td></td><td class="s"> $c->add_vertex($v);</td></tr>
+<tr><td class="h"><a name="2621"></a>2621</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2622"></a>2622</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ($g->edges05) {</td></tr>
+<tr><td class="h"><a name="2623"></a>2623</td><td></td><td></td><td></td><td></td><td class="s"> my @e = @$e;</td></tr>
+<tr><td class="h"><a name="2624"></a>2624</td><td></td><td></td><td></td><td></td><td class="s"> $c->add_edge(@e);</td></tr>
+<tr><td class="h"><a name="2625"></a>2625</td><td></td><td></td><td></td><td></td><td class="s"> $c->add_edge(reverse @e);</td></tr>
+<tr><td class="h"><a name="2626"></a>2626</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2627"></a>2627</td><td></td><td></td><td></td><td></td><td class="s"> return $c;</td></tr>
+<tr><td class="h"><a name="2628"></a>2628</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2629"></a>2629</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2630"></a>2630</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*directed_copy_graph = \&directed_copy;</td></tr>
+<tr><td class="h"><a name="2631"></a>2631</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2632"></a>2632</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="2633"></a>2633</td><td></td><td></td><td></td><td></td><td class="s"># Cache or not.</td></tr>
+<tr><td class="h"><a name="2634"></a>2634</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="2635"></a>2635</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2636"></a>2636</td><td class="c3">1</td><td class="c3"><span title="Avg 4µs">4µs</span></td><td></td><td></td><td class="s">my %_cache_type =</td></tr>
+<tr><td class="h"><a name="2637"></a>2637</td><td></td><td></td><td></td><td></td><td class="s"> (</td></tr>
+<tr><td class="h"><a name="2638"></a>2638</td><td></td><td></td><td></td><td></td><td class="s"> 'connectivity' => '_ccc',</td></tr>
+<tr><td class="h"><a name="2639"></a>2639</td><td></td><td></td><td></td><td></td><td class="s"> 'strong_connectivity' => '_scc',</td></tr>
+<tr><td class="h"><a name="2640"></a>2640</td><td></td><td></td><td></td><td></td><td class="s"> 'biconnectivity' => '_bcc',</td></tr>
+<tr><td class="h"><a name="2641"></a>2641</td><td></td><td></td><td></td><td></td><td class="s"> 'SPT_Dijkstra' => '_spt_di',</td></tr>
+<tr><td class="h"><a name="2642"></a>2642</td><td></td><td></td><td></td><td></td><td class="s"> 'SPT_Bellman_Ford' => '_spt_bf',</td></tr>
+<tr><td class="h"><a name="2643"></a>2643</td><td></td><td></td><td></td><td></td><td class="s"> );</td></tr>
+<tr><td class="h"><a name="2644"></a>2644</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2645"></a>2645</td><td></td><td></td><td></td><td></td><td class="s">sub _check_cache {</td></tr>
+<tr><td class="h"><a name="2646"></a>2646</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $type, $code) = splice @_, 0, 3;</td></tr>
+<tr><td class="h"><a name="2647"></a>2647</td><td></td><td></td><td></td><td></td><td class="s"> my $c = $_cache_type{$type};</td></tr>
+<tr><td class="h"><a name="2648"></a>2648</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $c) {</td></tr>
+<tr><td class="h"><a name="2649"></a>2649</td><td></td><td></td><td></td><td></td><td class="s"> my $a = $g->get_graph_attribute($c);</td></tr>
+<tr><td class="h"><a name="2650"></a>2650</td><td></td><td></td><td></td><td></td><td class="s"> unless (defined $a && $a->[ 0 ] == $g->[ _G ]) {</td></tr>
+<tr><td class="h"><a name="2651"></a>2651</td><td></td><td></td><td></td><td></td><td class="s"> $a->[ 0 ] = $g->[ _G ];</td></tr>
+<tr><td class="h"><a name="2652"></a>2652</td><td></td><td></td><td></td><td></td><td class="s"> $a->[ 1 ] = $code->( $g, @_ );</td></tr>
+<tr><td class="h"><a name="2653"></a>2653</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_graph_attribute($c, $a);</td></tr>
+<tr><td class="h"><a name="2654"></a>2654</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2655"></a>2655</td><td></td><td></td><td></td><td></td><td class="s"> return $a->[ 1 ];</td></tr>
+<tr><td class="h"><a name="2656"></a>2656</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2657"></a>2657</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("Graph: unknown cache type '$type'");</td></tr>
+<tr><td class="h"><a name="2658"></a>2658</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2659"></a>2659</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2660"></a>2660</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2661"></a>2661</td><td></td><td></td><td></td><td></td><td class="s">sub _clear_cache {</td></tr>
+<tr><td class="h"><a name="2662"></a>2662</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $type) = @_;</td></tr>
+<tr><td class="h"><a name="2663"></a>2663</td><td></td><td></td><td></td><td></td><td class="s"> my $c = $_cache_type{$type};</td></tr>
+<tr><td class="h"><a name="2664"></a>2664</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $c) {</td></tr>
+<tr><td class="h"><a name="2665"></a>2665</td><td></td><td></td><td></td><td></td><td class="s"> $g->delete_graph_attribute($c);</td></tr>
+<tr><td class="h"><a name="2666"></a>2666</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2667"></a>2667</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("Graph: unknown cache type '$type'");</td></tr>
+<tr><td class="h"><a name="2668"></a>2668</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2669"></a>2669</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2670"></a>2670</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2671"></a>2671</td><td></td><td></td><td></td><td></td><td class="s">sub connectivity_clear_cache {</td></tr>
+<tr><td class="h"><a name="2672"></a>2672</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2673"></a>2673</td><td></td><td></td><td></td><td></td><td class="s"> _clear_cache($g, 'connectivity');</td></tr>
+<tr><td class="h"><a name="2674"></a>2674</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2675"></a>2675</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2676"></a>2676</td><td></td><td></td><td></td><td></td><td class="s">sub strong_connectivity_clear_cache {</td></tr>
+<tr><td class="h"><a name="2677"></a>2677</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2678"></a>2678</td><td></td><td></td><td></td><td></td><td class="s"> _clear_cache($g, 'strong_connectivity');</td></tr>
+<tr><td class="h"><a name="2679"></a>2679</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2680"></a>2680</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2681"></a>2681</td><td></td><td></td><td></td><td></td><td class="s">sub biconnectivity_clear_cache {</td></tr>
+<tr><td class="h"><a name="2682"></a>2682</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2683"></a>2683</td><td></td><td></td><td></td><td></td><td class="s"> _clear_cache($g, 'biconnectivity');</td></tr>
+<tr><td class="h"><a name="2684"></a>2684</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2685"></a>2685</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2686"></a>2686</td><td></td><td></td><td></td><td></td><td class="s">sub SPT_Dijkstra_clear_cache {</td></tr>
+<tr><td class="h"><a name="2687"></a>2687</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2688"></a>2688</td><td></td><td></td><td></td><td></td><td class="s"> _clear_cache($g, 'SPT_Dijkstra');</td></tr>
+<tr><td class="h"><a name="2689"></a>2689</td><td></td><td></td><td></td><td></td><td class="s"> $g->delete_graph_attribute('SPT_Dijkstra_first_root');</td></tr>
+<tr><td class="h"><a name="2690"></a>2690</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2691"></a>2691</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2692"></a>2692</td><td></td><td></td><td></td><td></td><td class="s">sub SPT_Bellman_Ford_clear_cache {</td></tr>
+<tr><td class="h"><a name="2693"></a>2693</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2694"></a>2694</td><td></td><td></td><td></td><td></td><td class="s"> _clear_cache($g, 'SPT_Bellman_Ford');</td></tr>
+<tr><td class="h"><a name="2695"></a>2695</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2696"></a>2696</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2697"></a>2697</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="2698"></a>2698</td><td></td><td></td><td></td><td></td><td class="s"># Connected components.</td></tr>
+<tr><td class="h"><a name="2699"></a>2699</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="2700"></a>2700</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2701"></a>2701</td><td></td><td></td><td></td><td></td><td class="s">sub _connected_components_compute {</td></tr>
+<tr><td class="h"><a name="2702"></a>2702</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2703"></a>2703</td><td></td><td></td><td></td><td></td><td class="s"> my %cce;</td></tr>
+<tr><td class="h"><a name="2704"></a>2704</td><td></td><td></td><td></td><td></td><td class="s"> my %cci;</td></tr>
+<tr><td class="h"><a name="2705"></a>2705</td><td></td><td></td><td></td><td></td><td class="s"> my $cc = 0;</td></tr>
+<tr><td class="h"><a name="2706"></a>2706</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->has_union_find) {</td></tr>
+<tr><td class="h"><a name="2707"></a>2707</td><td></td><td></td><td></td><td></td><td class="s"> my $UF = $g->_get_union_find();</td></tr>
+<tr><td class="h"><a name="2708"></a>2708</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="2709"></a>2709</td><td></td><td></td><td></td><td></td><td class="s"> my %icce; # Isolated vertices.</td></tr>
+<tr><td class="h"><a name="2710"></a>2710</td><td></td><td></td><td></td><td></td><td class="s"> my %icci;</td></tr>
+<tr><td class="h"><a name="2711"></a>2711</td><td></td><td></td><td></td><td></td><td class="s"> my $icc = 0;</td></tr>
+<tr><td class="h"><a name="2712"></a>2712</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ( $g->unique_vertices ) {</td></tr>
+<tr><td class="h"><a name="2713"></a>2713</td><td></td><td></td><td></td><td></td><td class="s"> $cc = $UF->find( $V->_get_path_id( $v ) );</td></tr>
+<tr><td class="h"><a name="2714"></a>2714</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $cc) {</td></tr>
+<tr><td class="h"><a name="2715"></a>2715</td><td></td><td></td><td></td><td></td><td class="s"> $cce{ $v } = $cc;</td></tr>
+<tr><td class="h"><a name="2716"></a>2716</td><td></td><td></td><td></td><td></td><td class="s"> push @{ $cci{ $cc } }, $v;</td></tr>
+<tr><td class="h"><a name="2717"></a>2717</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2718"></a>2718</td><td></td><td></td><td></td><td></td><td class="s"> $icce{ $v } = $icc;</td></tr>
+<tr><td class="h"><a name="2719"></a>2719</td><td></td><td></td><td></td><td></td><td class="s"> push @{ $icci{ $icc } }, $v;</td></tr>
+<tr><td class="h"><a name="2720"></a>2720</td><td></td><td></td><td></td><td></td><td class="s"> $icc++;</td></tr>
+<tr><td class="h"><a name="2721"></a>2721</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2722"></a>2722</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2723"></a>2723</td><td></td><td></td><td></td><td></td><td class="s"> if ($icc) {</td></tr>
+<tr><td class="h"><a name="2724"></a>2724</td><td></td><td></td><td></td><td></td><td class="s"> @cce{ keys %icce } = values %icce;</td></tr>
+<tr><td class="h"><a name="2725"></a>2725</td><td></td><td></td><td></td><td></td><td class="s"> @cci{ keys %icci } = values %icci;</td></tr>
+<tr><td class="h"><a name="2726"></a>2726</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2727"></a>2727</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2728"></a>2728</td><td></td><td></td><td></td><td></td><td class="s"> my @u = $g->unique_vertices;</td></tr>
+<tr><td class="h"><a name="2729"></a>2729</td><td></td><td></td><td></td><td></td><td class="s"> my %r; @r{ @u } = @u;</td></tr>
+<tr><td class="h"><a name="2730"></a>2730</td><td></td><td></td><td></td><td></td><td class="s"> my $froot = sub {</td></tr>
+<tr><td class="h"><a name="2731"></a>2731</td><td></td><td></td><td></td><td></td><td class="s"> (each %r)[1];</td></tr>
+<tr><td class="h"><a name="2732"></a>2732</td><td></td><td></td><td></td><td></td><td class="s"> };</td></tr>
+<tr><td class="h"><a name="2733"></a>2733</td><td></td><td></td><td></td><td></td><td class="s"> my $nroot = sub {</td></tr>
+<tr><td class="h"><a name="2734"></a>2734</td><td></td><td></td><td></td><td></td><td class="s"> $cc++ if keys %r;</td></tr>
+<tr><td class="h"><a name="2735"></a>2735</td><td></td><td></td><td></td><td></td><td class="s"> (each %r)[1];</td></tr>
+<tr><td class="h"><a name="2736"></a>2736</td><td></td><td></td><td></td><td></td><td class="s"> };</td></tr>
+<tr><td class="h"><a name="2737"></a>2737</td><td></td><td></td><td></td><td></td><td class="s"> my $t = Graph::Traversal::DFS->new($g,</td></tr>
+<tr><td class="h"><a name="2738"></a>2738</td><td></td><td></td><td></td><td></td><td class="s"> first_root => $froot,</td></tr>
+<tr><td class="h"><a name="2739"></a>2739</td><td></td><td></td><td></td><td></td><td class="s"> next_root => $nroot,</td></tr>
+<tr><td class="h"><a name="2740"></a>2740</td><td></td><td></td><td></td><td></td><td class="s"> pre => sub {</td></tr>
+<tr><td class="h"><a name="2741"></a>2741</td><td></td><td></td><td></td><td></td><td class="s"> my ($v, $t) = @_;</td></tr>
+<tr><td class="h"><a name="2742"></a>2742</td><td></td><td></td><td></td><td></td><td class="s"> $cce{ $v } = $cc;</td></tr>
+<tr><td class="h"><a name="2743"></a>2743</td><td></td><td></td><td></td><td></td><td class="s"> push @{ $cci{ $cc } }, $v;</td></tr>
+<tr><td class="h"><a name="2744"></a>2744</td><td></td><td></td><td></td><td></td><td class="s"> delete $r{ $v };</td></tr>
+<tr><td class="h"><a name="2745"></a>2745</td><td></td><td></td><td></td><td></td><td class="s"> },</td></tr>
+<tr><td class="h"><a name="2746"></a>2746</td><td></td><td></td><td></td><td></td><td class="s"> @_);</td></tr>
+<tr><td class="h"><a name="2747"></a>2747</td><td></td><td></td><td></td><td></td><td class="s"> $t->dfs;</td></tr>
+<tr><td class="h"><a name="2748"></a>2748</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2749"></a>2749</td><td></td><td></td><td></td><td></td><td class="s"> return [ \%cce, \%cci ];</td></tr>
+<tr><td class="h"><a name="2750"></a>2750</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2751"></a>2751</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2752"></a>2752</td><td></td><td></td><td></td><td></td><td class="s">sub _connected_components {</td></tr>
+<tr><td class="h"><a name="2753"></a>2753</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2754"></a>2754</td><td></td><td></td><td></td><td></td><td class="s"> my $ccc = _check_cache($g, 'connectivity',</td></tr>
+<tr><td class="h"><a name="2755"></a>2755</td><td></td><td></td><td></td><td></td><td class="s"> \&_connected_components_compute, @_);</td></tr>
+<tr><td class="h"><a name="2756"></a>2756</td><td></td><td></td><td></td><td></td><td class="s"> return @{ $ccc };</td></tr>
+<tr><td class="h"><a name="2757"></a>2757</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2758"></a>2758</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2759"></a>2759</td><td></td><td></td><td></td><td></td><td class="s">sub connected_component_by_vertex {</td></tr>
+<tr><td class="h"><a name="2760"></a>2760</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $v) = @_;</td></tr>
+<tr><td class="h"><a name="2761"></a>2761</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_undirected;</td></tr>
+<tr><td class="h"><a name="2762"></a>2762</td><td></td><td></td><td></td><td></td><td class="s"> my ($CCE, $CCI) = $g->_connected_components();</td></tr>
+<tr><td class="h"><a name="2763"></a>2763</td><td></td><td></td><td></td><td></td><td class="s"> return $CCE->{ $v };</td></tr>
+<tr><td class="h"><a name="2764"></a>2764</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2765"></a>2765</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2766"></a>2766</td><td></td><td></td><td></td><td></td><td class="s">sub connected_component_by_index {</td></tr>
+<tr><td class="h"><a name="2767"></a>2767</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $i) = @_;</td></tr>
+<tr><td class="h"><a name="2768"></a>2768</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_undirected;</td></tr>
+<tr><td class="h"><a name="2769"></a>2769</td><td></td><td></td><td></td><td></td><td class="s"> my ($CCE, $CCI) = $g->_connected_components();</td></tr>
+<tr><td class="h"><a name="2770"></a>2770</td><td></td><td></td><td></td><td></td><td class="s"> return defined $CCI->{ $i } ? @{ $CCI->{ $i } } : ( );</td></tr>
+<tr><td class="h"><a name="2771"></a>2771</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2772"></a>2772</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2773"></a>2773</td><td></td><td></td><td></td><td></td><td class="s">sub connected_components {</td></tr>
+<tr><td class="h"><a name="2774"></a>2774</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2775"></a>2775</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_undirected;</td></tr>
+<tr><td class="h"><a name="2776"></a>2776</td><td></td><td></td><td></td><td></td><td class="s"> my ($CCE, $CCI) = $g->_connected_components();</td></tr>
+<tr><td class="h"><a name="2777"></a>2777</td><td></td><td></td><td></td><td></td><td class="s"> return values %{ $CCI };</td></tr>
+<tr><td class="h"><a name="2778"></a>2778</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2779"></a>2779</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2780"></a>2780</td><td></td><td></td><td></td><td></td><td class="s">sub same_connected_components {</td></tr>
+<tr><td class="h"><a name="2781"></a>2781</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2782"></a>2782</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_undirected;</td></tr>
+<tr><td class="h"><a name="2783"></a>2783</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->has_union_find) {</td></tr>
+<tr><td class="h"><a name="2784"></a>2784</td><td></td><td></td><td></td><td></td><td class="s"> my $UF = $g->_get_union_find();</td></tr>
+<tr><td class="h"><a name="2785"></a>2785</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="2786"></a>2786</td><td></td><td></td><td></td><td></td><td class="s"> my $u = shift;</td></tr>
+<tr><td class="h"><a name="2787"></a>2787</td><td></td><td></td><td></td><td></td><td class="s"> my $c = $UF->find( $V->_get_path_id ( $u ) );</td></tr>
+<tr><td class="h"><a name="2788"></a>2788</td><td></td><td></td><td></td><td></td><td class="s"> my $d;</td></tr>
+<tr><td class="h"><a name="2789"></a>2789</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ( @_) {</td></tr>
+<tr><td class="h"><a name="2790"></a>2790</td><td></td><td></td><td></td><td></td><td class="s"> return 0</td></tr>
+<tr><td class="h"><a name="2791"></a>2791</td><td></td><td></td><td></td><td></td><td class="s"> unless defined($d = $UF->find( $V->_get_path_id( $v ) )) &&</td></tr>
+<tr><td class="h"><a name="2792"></a>2792</td><td></td><td></td><td></td><td></td><td class="s"> $d eq $c;</td></tr>
+<tr><td class="h"><a name="2793"></a>2793</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2794"></a>2794</td><td></td><td></td><td></td><td></td><td class="s"> return 1;</td></tr>
+<tr><td class="h"><a name="2795"></a>2795</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2796"></a>2796</td><td></td><td></td><td></td><td></td><td class="s"> my ($CCE, $CCI) = $g->_connected_components();</td></tr>
+<tr><td class="h"><a name="2797"></a>2797</td><td></td><td></td><td></td><td></td><td class="s"> my $u = shift;</td></tr>
+<tr><td class="h"><a name="2798"></a>2798</td><td></td><td></td><td></td><td></td><td class="s"> my $c = $CCE->{ $u };</td></tr>
+<tr><td class="h"><a name="2799"></a>2799</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ( @_) {</td></tr>
+<tr><td class="h"><a name="2800"></a>2800</td><td></td><td></td><td></td><td></td><td class="s"> return 0</td></tr>
+<tr><td class="h"><a name="2801"></a>2801</td><td></td><td></td><td></td><td></td><td class="s"> unless defined $CCE->{ $v } &&</td></tr>
+<tr><td class="h"><a name="2802"></a>2802</td><td></td><td></td><td></td><td></td><td class="s"> $CCE->{ $v } eq $c;</td></tr>
+<tr><td class="h"><a name="2803"></a>2803</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2804"></a>2804</td><td></td><td></td><td></td><td></td><td class="s"> return 1;</td></tr>
+<tr><td class="h"><a name="2805"></a>2805</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2806"></a>2806</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2807"></a>2807</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2808"></a>2808</td><td class="c3">1</td><td class="c3"><span title="Avg 2µs">2µs</span></td><td></td><td></td><td class="s">my $super_component = sub { join("+", sort @_) };</td></tr>
+<tr><td class="h"><a name="2809"></a>2809</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2810"></a>2810</td><td></td><td></td><td></td><td></td><td class="s">sub connected_graph {</td></tr>
+<tr><td class="h"><a name="2811"></a>2811</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, %opt) = @_;</td></tr>
+<tr><td class="h"><a name="2812"></a>2812</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_undirected;</td></tr>
+<tr><td class="h"><a name="2813"></a>2813</td><td></td><td></td><td></td><td></td><td class="s"> my $cg = Graph->new(undirected => 1);</td></tr>
+<tr><td class="h"><a name="2814"></a>2814</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->has_union_find && $g->vertices == 1) {</td></tr>
+<tr><td class="h"><a name="2815"></a>2815</td><td></td><td></td><td></td><td></td><td class="s"> # TODO: super_component?</td></tr>
+<tr><td class="h"><a name="2816"></a>2816</td><td></td><td></td><td></td><td></td><td class="s"> $cg->add_vertices($g->vertices);</td></tr>
+<tr><td class="h"><a name="2817"></a>2817</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2818"></a>2818</td><td></td><td></td><td></td><td></td><td class="s"> my $sc_cb =</td></tr>
+<tr><td class="h"><a name="2819"></a>2819</td><td></td><td></td><td></td><td></td><td class="s"> exists $opt{super_component} ?</td></tr>
+<tr><td class="h"><a name="2820"></a>2820</td><td></td><td></td><td></td><td></td><td class="s"> $opt{super_component} : $super_component;</td></tr>
+<tr><td class="h"><a name="2821"></a>2821</td><td></td><td></td><td></td><td></td><td class="s"> for my $cc ( $g->connected_components() ) {</td></tr>
+<tr><td class="h"><a name="2822"></a>2822</td><td></td><td></td><td></td><td></td><td class="s"> my $sc = $sc_cb->(@$cc);</td></tr>
+<tr><td class="h"><a name="2823"></a>2823</td><td></td><td></td><td></td><td></td><td class="s"> $cg->add_vertex($sc);</td></tr>
+<tr><td class="h"><a name="2824"></a>2824</td><td></td><td></td><td></td><td></td><td class="s"> $cg->set_vertex_attribute($sc, 'subvertices', [ @$cc ]);</td></tr>
+<tr><td class="h"><a name="2825"></a>2825</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2826"></a>2826</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2827"></a>2827</td><td></td><td></td><td></td><td></td><td class="s"> return $cg;</td></tr>
+<tr><td class="h"><a name="2828"></a>2828</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2829"></a>2829</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2830"></a>2830</td><td></td><td></td><td></td><td></td><td class="s">sub is_connected {</td></tr>
+<tr><td class="h"><a name="2831"></a>2831</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2832"></a>2832</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_undirected;</td></tr>
+<tr><td class="h"><a name="2833"></a>2833</td><td></td><td></td><td></td><td></td><td class="s"> my ($CCE, $CCI) = $g->_connected_components();</td></tr>
+<tr><td class="h"><a name="2834"></a>2834</td><td></td><td></td><td></td><td></td><td class="s"> return keys %{ $CCI } == 1;</td></tr>
+<tr><td class="h"><a name="2835"></a>2835</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2836"></a>2836</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2837"></a>2837</td><td></td><td></td><td></td><td></td><td class="s">sub is_weakly_connected {</td></tr>
+<tr><td class="h"><a name="2838"></a>2838</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2839"></a>2839</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="2840"></a>2840</td><td></td><td></td><td></td><td></td><td class="s"> $g->undirected_copy->is_connected(@_);</td></tr>
+<tr><td class="h"><a name="2841"></a>2841</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2842"></a>2842</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2843"></a>2843</td><td class="c3">1</td><td class="c3"><span title="Avg 2µs">2µs</span></td><td></td><td></td><td class="s">*weakly_connected = \&is_weakly_connected;</td></tr>
+<tr><td class="h"><a name="2844"></a>2844</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2845"></a>2845</td><td></td><td></td><td></td><td></td><td class="s">sub weakly_connected_components {</td></tr>
+<tr><td class="h"><a name="2846"></a>2846</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2847"></a>2847</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="2848"></a>2848</td><td></td><td></td><td></td><td></td><td class="s"> $g->undirected_copy->connected_components(@_);</td></tr>
+<tr><td class="h"><a name="2849"></a>2849</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2850"></a>2850</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2851"></a>2851</td><td></td><td></td><td></td><td></td><td class="s">sub weakly_connected_component_by_vertex {</td></tr>
+<tr><td class="h"><a name="2852"></a>2852</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2853"></a>2853</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="2854"></a>2854</td><td></td><td></td><td></td><td></td><td class="s"> $g->undirected_copy->connected_component_by_vertex(@_);</td></tr>
+<tr><td class="h"><a name="2855"></a>2855</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2856"></a>2856</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2857"></a>2857</td><td></td><td></td><td></td><td></td><td class="s">sub weakly_connected_component_by_index {</td></tr>
+<tr><td class="h"><a name="2858"></a>2858</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2859"></a>2859</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="2860"></a>2860</td><td></td><td></td><td></td><td></td><td class="s"> $g->undirected_copy->connected_component_by_index(@_);</td></tr>
+<tr><td class="h"><a name="2861"></a>2861</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2862"></a>2862</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2863"></a>2863</td><td></td><td></td><td></td><td></td><td class="s">sub same_weakly_connected_components {</td></tr>
+<tr><td class="h"><a name="2864"></a>2864</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2865"></a>2865</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="2866"></a>2866</td><td></td><td></td><td></td><td></td><td class="s"> $g->undirected_copy->same_connected_components(@_);</td></tr>
+<tr><td class="h"><a name="2867"></a>2867</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2868"></a>2868</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2869"></a>2869</td><td></td><td></td><td></td><td></td><td class="s">sub weakly_connected_graph {</td></tr>
+<tr><td class="h"><a name="2870"></a>2870</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2871"></a>2871</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="2872"></a>2872</td><td></td><td></td><td></td><td></td><td class="s"> $g->undirected_copy->connected_graph(@_);</td></tr>
+<tr><td class="h"><a name="2873"></a>2873</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2874"></a>2874</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2875"></a>2875</td><td></td><td></td><td></td><td></td><td class="s">sub _strongly_connected_components_compute {</td></tr>
+<tr><td class="h"><a name="2876"></a>2876</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2877"></a>2877</td><td></td><td></td><td></td><td></td><td class="s"> my $t = Graph::Traversal::DFS->new($g);</td></tr>
+<tr><td class="h"><a name="2878"></a>2878</td><td></td><td></td><td></td><td></td><td class="s"> my @d = reverse $t->dfs;</td></tr>
+<tr><td class="h"><a name="2879"></a>2879</td><td></td><td></td><td></td><td></td><td class="s"> my @c;</td></tr>
+<tr><td class="h"><a name="2880"></a>2880</td><td></td><td></td><td></td><td></td><td class="s"> my $h = $g->transpose_graph;</td></tr>
+<tr><td class="h"><a name="2881"></a>2881</td><td></td><td></td><td></td><td></td><td class="s"> my $u =</td></tr>
+<tr><td class="h"><a name="2882"></a>2882</td><td></td><td></td><td></td><td></td><td class="s"> Graph::Traversal::DFS->new($h,</td></tr>
+<tr><td class="h"><a name="2883"></a>2883</td><td></td><td></td><td></td><td></td><td class="s"> next_root => sub {</td></tr>
+<tr><td class="h"><a name="2884"></a>2884</td><td></td><td></td><td></td><td></td><td class="s"> my ($t, $u) = @_;</td></tr>
+<tr><td class="h"><a name="2885"></a>2885</td><td></td><td></td><td></td><td></td><td class="s"> my $root;</td></tr>
+<tr><td class="h"><a name="2886"></a>2886</td><td></td><td></td><td></td><td></td><td class="s"> while (defined($root = shift @d)) {</td></tr>
+<tr><td class="h"><a name="2887"></a>2887</td><td></td><td></td><td></td><td></td><td class="s"> last if exists $u->{ $root };</td></tr>
+<tr><td class="h"><a name="2888"></a>2888</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2889"></a>2889</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $root) {</td></tr>
+<tr><td class="h"><a name="2890"></a>2890</td><td></td><td></td><td></td><td></td><td class="s"> push @c, [];</td></tr>
+<tr><td class="h"><a name="2891"></a>2891</td><td></td><td></td><td></td><td></td><td class="s"> return $root;</td></tr>
+<tr><td class="h"><a name="2892"></a>2892</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2893"></a>2893</td><td></td><td></td><td></td><td></td><td class="s"> return;</td></tr>
+<tr><td class="h"><a name="2894"></a>2894</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2895"></a>2895</td><td></td><td></td><td></td><td></td><td class="s"> },</td></tr>
+<tr><td class="h"><a name="2896"></a>2896</td><td></td><td></td><td></td><td></td><td class="s"> pre => sub {</td></tr>
+<tr><td class="h"><a name="2897"></a>2897</td><td></td><td></td><td></td><td></td><td class="s"> my ($v, $t) = @_;</td></tr>
+<tr><td class="h"><a name="2898"></a>2898</td><td></td><td></td><td></td><td></td><td class="s"> push @{ $c[-1] }, $v;</td></tr>
+<tr><td class="h"><a name="2899"></a>2899</td><td></td><td></td><td></td><td></td><td class="s"> },</td></tr>
+<tr><td class="h"><a name="2900"></a>2900</td><td></td><td></td><td></td><td></td><td class="s"> @_);</td></tr>
+<tr><td class="h"><a name="2901"></a>2901</td><td></td><td></td><td></td><td></td><td class="s"> $u->dfs;</td></tr>
+<tr><td class="h"><a name="2902"></a>2902</td><td></td><td></td><td></td><td></td><td class="s"> return \@c;</td></tr>
+<tr><td class="h"><a name="2903"></a>2903</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2904"></a>2904</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2905"></a>2905</td><td></td><td></td><td></td><td></td><td class="s">sub _strongly_connected_components {</td></tr>
+<tr><td class="h"><a name="2906"></a>2906</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2907"></a>2907</td><td></td><td></td><td></td><td></td><td class="s"> my $type = 'strong_connectivity';</td></tr>
+<tr><td class="h"><a name="2908"></a>2908</td><td></td><td></td><td></td><td></td><td class="s"> my $scc = _check_cache($g, $type,</td></tr>
+<tr><td class="h"><a name="2909"></a>2909</td><td></td><td></td><td></td><td></td><td class="s"> \&_strongly_connected_components_compute, @_);</td></tr>
+<tr><td class="h"><a name="2910"></a>2910</td><td></td><td></td><td></td><td></td><td class="s"> return defined $scc ? @$scc : ( );</td></tr>
+<tr><td class="h"><a name="2911"></a>2911</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2912"></a>2912</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2913"></a>2913</td><td></td><td></td><td></td><td></td><td class="s">sub strongly_connected_components {</td></tr>
+<tr><td class="h"><a name="2914"></a>2914</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2915"></a>2915</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="2916"></a>2916</td><td></td><td></td><td></td><td></td><td class="s"> $g->_strongly_connected_components(@_);</td></tr>
+<tr><td class="h"><a name="2917"></a>2917</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2918"></a>2918</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2919"></a>2919</td><td></td><td></td><td></td><td></td><td class="s">sub strongly_connected_component_by_vertex {</td></tr>
+<tr><td class="h"><a name="2920"></a>2920</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2921"></a>2921</td><td></td><td></td><td></td><td></td><td class="s"> my $v = shift;</td></tr>
+<tr><td class="h"><a name="2922"></a>2922</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="2923"></a>2923</td><td></td><td></td><td></td><td></td><td class="s"> my @scc = $g->_strongly_connected_components( next_alphabetic => 1, @_ );</td></tr>
+<tr><td class="h"><a name="2924"></a>2924</td><td></td><td></td><td></td><td></td><td class="s"> for (my $i = 0; $i <= $#scc; $i++) {</td></tr>
+<tr><td class="h"><a name="2925"></a>2925</td><td></td><td></td><td></td><td></td><td class="s"> for (my $j = 0; $j <= $#{ $scc[$i] }; $j++) {</td></tr>
+<tr><td class="h"><a name="2926"></a>2926</td><td></td><td></td><td></td><td></td><td class="s"> return $i if $scc[$i]->[$j] eq $v;</td></tr>
+<tr><td class="h"><a name="2927"></a>2927</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2928"></a>2928</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2929"></a>2929</td><td></td><td></td><td></td><td></td><td class="s"> return;</td></tr>
+<tr><td class="h"><a name="2930"></a>2930</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2931"></a>2931</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2932"></a>2932</td><td></td><td></td><td></td><td></td><td class="s">sub strongly_connected_component_by_index {</td></tr>
+<tr><td class="h"><a name="2933"></a>2933</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2934"></a>2934</td><td></td><td></td><td></td><td></td><td class="s"> my $i = shift;</td></tr>
+<tr><td class="h"><a name="2935"></a>2935</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="2936"></a>2936</td><td></td><td></td><td></td><td></td><td class="s"> my $c = ( $g->_strongly_connected_components(@_) )[ $i ];</td></tr>
+<tr><td class="h"><a name="2937"></a>2937</td><td></td><td></td><td></td><td></td><td class="s"> return defined $c ? @{ $c } : ();</td></tr>
+<tr><td class="h"><a name="2938"></a>2938</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2939"></a>2939</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2940"></a>2940</td><td></td><td></td><td></td><td></td><td class="s">sub same_strongly_connected_components {</td></tr>
+<tr><td class="h"><a name="2941"></a>2941</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2942"></a>2942</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="2943"></a>2943</td><td></td><td></td><td></td><td></td><td class="s"> my @scc = $g->_strongly_connected_components( next_alphabetic => 1, @_ );</td></tr>
+<tr><td class="h"><a name="2944"></a>2944</td><td></td><td></td><td></td><td></td><td class="s"> my @i;</td></tr>
+<tr><td class="h"><a name="2945"></a>2945</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="2946"></a>2946</td><td></td><td></td><td></td><td></td><td class="s"> my $v = shift;</td></tr>
+<tr><td class="h"><a name="2947"></a>2947</td><td></td><td></td><td></td><td></td><td class="s"> for (my $i = 0; $i <= $#scc; $i++) {</td></tr>
+<tr><td class="h"><a name="2948"></a>2948</td><td></td><td></td><td></td><td></td><td class="s"> for (my $j = 0; $j <= $#{ $scc[$i] }; $j++) {</td></tr>
+<tr><td class="h"><a name="2949"></a>2949</td><td></td><td></td><td></td><td></td><td class="s"> if ($scc[$i]->[$j] eq $v) {</td></tr>
+<tr><td class="h"><a name="2950"></a>2950</td><td></td><td></td><td></td><td></td><td class="s"> push @i, $i;</td></tr>
+<tr><td class="h"><a name="2951"></a>2951</td><td></td><td></td><td></td><td></td><td class="s"> return 0 if @i > 1 && $i[-1] ne $i[0];</td></tr>
+<tr><td class="h"><a name="2952"></a>2952</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2953"></a>2953</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2954"></a>2954</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2955"></a>2955</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2956"></a>2956</td><td></td><td></td><td></td><td></td><td class="s"> return 1;</td></tr>
+<tr><td class="h"><a name="2957"></a>2957</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2958"></a>2958</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2959"></a>2959</td><td></td><td></td><td></td><td></td><td class="s">sub is_strongly_connected {</td></tr>
+<tr><td class="h"><a name="2960"></a>2960</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2961"></a>2961</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="2962"></a>2962</td><td></td><td></td><td></td><td></td><td class="s"> my $t = Graph::Traversal::DFS->new($g);</td></tr>
+<tr><td class="h"><a name="2963"></a>2963</td><td></td><td></td><td></td><td></td><td class="s"> my @d = reverse $t->dfs;</td></tr>
+<tr><td class="h"><a name="2964"></a>2964</td><td></td><td></td><td></td><td></td><td class="s"> my @c;</td></tr>
+<tr><td class="h"><a name="2965"></a>2965</td><td></td><td></td><td></td><td></td><td class="s"> my $h = $g->transpose;</td></tr>
+<tr><td class="h"><a name="2966"></a>2966</td><td></td><td></td><td></td><td></td><td class="s"> my $u =</td></tr>
+<tr><td class="h"><a name="2967"></a>2967</td><td></td><td></td><td></td><td></td><td class="s"> Graph::Traversal::DFS->new($h,</td></tr>
+<tr><td class="h"><a name="2968"></a>2968</td><td></td><td></td><td></td><td></td><td class="s"> next_root => sub {</td></tr>
+<tr><td class="h"><a name="2969"></a>2969</td><td></td><td></td><td></td><td></td><td class="s"> my ($t, $u) = @_;</td></tr>
+<tr><td class="h"><a name="2970"></a>2970</td><td></td><td></td><td></td><td></td><td class="s"> my $root;</td></tr>
+<tr><td class="h"><a name="2971"></a>2971</td><td></td><td></td><td></td><td></td><td class="s"> while (defined($root = shift @d)) {</td></tr>
+<tr><td class="h"><a name="2972"></a>2972</td><td></td><td></td><td></td><td></td><td class="s"> last if exists $u->{ $root };</td></tr>
+<tr><td class="h"><a name="2973"></a>2973</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2974"></a>2974</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $root) {</td></tr>
+<tr><td class="h"><a name="2975"></a>2975</td><td></td><td></td><td></td><td></td><td class="s"> unless (@{ $t->{ roots } }) {</td></tr>
+<tr><td class="h"><a name="2976"></a>2976</td><td></td><td></td><td></td><td></td><td class="s"> push @c, [];</td></tr>
+<tr><td class="h"><a name="2977"></a>2977</td><td></td><td></td><td></td><td></td><td class="s"> return $root;</td></tr>
+<tr><td class="h"><a name="2978"></a>2978</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2979"></a>2979</td><td></td><td></td><td></td><td></td><td class="s"> $t->terminate;</td></tr>
+<tr><td class="h"><a name="2980"></a>2980</td><td></td><td></td><td></td><td></td><td class="s"> return;</td></tr>
+<tr><td class="h"><a name="2981"></a>2981</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2982"></a>2982</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="2983"></a>2983</td><td></td><td></td><td></td><td></td><td class="s"> return;</td></tr>
+<tr><td class="h"><a name="2984"></a>2984</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="2985"></a>2985</td><td></td><td></td><td></td><td></td><td class="s"> },</td></tr>
+<tr><td class="h"><a name="2986"></a>2986</td><td></td><td></td><td></td><td></td><td class="s"> pre => sub {</td></tr>
+<tr><td class="h"><a name="2987"></a>2987</td><td></td><td></td><td></td><td></td><td class="s"> my ($v, $t) = @_;</td></tr>
+<tr><td class="h"><a name="2988"></a>2988</td><td></td><td></td><td></td><td></td><td class="s"> push @{ $c[-1] }, $v;</td></tr>
+<tr><td class="h"><a name="2989"></a>2989</td><td></td><td></td><td></td><td></td><td class="s"> },</td></tr>
+<tr><td class="h"><a name="2990"></a>2990</td><td></td><td></td><td></td><td></td><td class="s"> @_);</td></tr>
+<tr><td class="h"><a name="2991"></a>2991</td><td></td><td></td><td></td><td></td><td class="s"> $u->dfs;</td></tr>
+<tr><td class="h"><a name="2992"></a>2992</td><td></td><td></td><td></td><td></td><td class="s"> return @{ $u->{ roots } } == 1 && keys %{ $u->{ unseen } } == 0;</td></tr>
+<tr><td class="h"><a name="2993"></a>2993</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="2994"></a>2994</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2995"></a>2995</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*strongly_connected = \&is_strongly_connected;</td></tr>
+<tr><td class="h"><a name="2996"></a>2996</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="2997"></a>2997</td><td></td><td></td><td></td><td></td><td class="s">sub strongly_connected_graph {</td></tr>
+<tr><td class="h"><a name="2998"></a>2998</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="2999"></a>2999</td><td></td><td></td><td></td><td></td><td class="s"> my %attr = @_;</td></tr>
+<tr><td class="h"><a name="3000"></a>3000</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3001"></a>3001</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_directed;</td></tr>
+<tr><td class="h"><a name="3002"></a>3002</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3003"></a>3003</td><td></td><td></td><td></td><td></td><td class="s"> my $t = Graph::Traversal::DFS->new($g);</td></tr>
+<tr><td class="h"><a name="3004"></a>3004</td><td></td><td></td><td></td><td></td><td class="s"> my @d = reverse $t->dfs;</td></tr>
+<tr><td class="h"><a name="3005"></a>3005</td><td></td><td></td><td></td><td></td><td class="s"> my @c;</td></tr>
+<tr><td class="h"><a name="3006"></a>3006</td><td></td><td></td><td></td><td></td><td class="s"> my $h = $g->transpose;</td></tr>
+<tr><td class="h"><a name="3007"></a>3007</td><td></td><td></td><td></td><td></td><td class="s"> my $u =</td></tr>
+<tr><td class="h"><a name="3008"></a>3008</td><td></td><td></td><td></td><td></td><td class="s"> Graph::Traversal::DFS->new($h,</td></tr>
+<tr><td class="h"><a name="3009"></a>3009</td><td></td><td></td><td></td><td></td><td class="s"> next_root => sub {</td></tr>
+<tr><td class="h"><a name="3010"></a>3010</td><td></td><td></td><td></td><td></td><td class="s"> my ($t, $u) = @_;</td></tr>
+<tr><td class="h"><a name="3011"></a>3011</td><td></td><td></td><td></td><td></td><td class="s"> my $root;</td></tr>
+<tr><td class="h"><a name="3012"></a>3012</td><td></td><td></td><td></td><td></td><td class="s"> while (defined($root = shift @d)) {</td></tr>
+<tr><td class="h"><a name="3013"></a>3013</td><td></td><td></td><td></td><td></td><td class="s"> last if exists $u->{ $root };</td></tr>
+<tr><td class="h"><a name="3014"></a>3014</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3015"></a>3015</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $root) {</td></tr>
+<tr><td class="h"><a name="3016"></a>3016</td><td></td><td></td><td></td><td></td><td class="s"> push @c, [];</td></tr>
+<tr><td class="h"><a name="3017"></a>3017</td><td></td><td></td><td></td><td></td><td class="s"> return $root;</td></tr>
+<tr><td class="h"><a name="3018"></a>3018</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3019"></a>3019</td><td></td><td></td><td></td><td></td><td class="s"> return;</td></tr>
+<tr><td class="h"><a name="3020"></a>3020</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3021"></a>3021</td><td></td><td></td><td></td><td></td><td class="s"> },</td></tr>
+<tr><td class="h"><a name="3022"></a>3022</td><td></td><td></td><td></td><td></td><td class="s"> pre => sub {</td></tr>
+<tr><td class="h"><a name="3023"></a>3023</td><td></td><td></td><td></td><td></td><td class="s"> my ($v, $t) = @_;</td></tr>
+<tr><td class="h"><a name="3024"></a>3024</td><td></td><td></td><td></td><td></td><td class="s"> push @{ $c[-1] }, $v;</td></tr>
+<tr><td class="h"><a name="3025"></a>3025</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3026"></a>3026</td><td></td><td></td><td></td><td></td><td class="s"> );</td></tr>
+<tr><td class="h"><a name="3027"></a>3027</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3028"></a>3028</td><td></td><td></td><td></td><td></td><td class="s"> $u->dfs;</td></tr>
+<tr><td class="h"><a name="3029"></a>3029</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3030"></a>3030</td><td></td><td></td><td></td><td></td><td class="s"> my $sc_cb;</td></tr>
+<tr><td class="h"><a name="3031"></a>3031</td><td></td><td></td><td></td><td></td><td class="s"> my $hv_cb;</td></tr>
+<tr><td class="h"><a name="3032"></a>3032</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3033"></a>3033</td><td></td><td></td><td></td><td></td><td class="s"> _opt_get(\%attr, super_component => \$sc_cb);</td></tr>
+<tr><td class="h"><a name="3034"></a>3034</td><td></td><td></td><td></td><td></td><td class="s"> _opt_get(\%attr, hypervertex => \$hv_cb);</td></tr>
+<tr><td class="h"><a name="3035"></a>3035</td><td></td><td></td><td></td><td></td><td class="s"> _opt_unknown(\%attr);</td></tr>
+<tr><td class="h"><a name="3036"></a>3036</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3037"></a>3037</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $hv_cb && !defined $sc_cb) {</td></tr>
+<tr><td class="h"><a name="3038"></a>3038</td><td></td><td></td><td></td><td></td><td class="s"> $sc_cb = sub { $hv_cb->( [ @_ ] ) };</td></tr>
+<tr><td class="h"><a name="3039"></a>3039</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3040"></a>3040</td><td></td><td></td><td></td><td></td><td class="s"> unless (defined $sc_cb) {</td></tr>
+<tr><td class="h"><a name="3041"></a>3041</td><td></td><td></td><td></td><td></td><td class="s"> $sc_cb = $super_component;</td></tr>
+<tr><td class="h"><a name="3042"></a>3042</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3043"></a>3043</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3044"></a>3044</td><td></td><td></td><td></td><td></td><td class="s"> my $s = Graph->new;</td></tr>
+<tr><td class="h"><a name="3045"></a>3045</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3046"></a>3046</td><td></td><td></td><td></td><td></td><td class="s"> my %c;</td></tr>
+<tr><td class="h"><a name="3047"></a>3047</td><td></td><td></td><td></td><td></td><td class="s"> my @s;</td></tr>
+<tr><td class="h"><a name="3048"></a>3048</td><td></td><td></td><td></td><td></td><td class="s"> for (my $i = 0; $i < @c; $i++) {</td></tr>
+<tr><td class="h"><a name="3049"></a>3049</td><td></td><td></td><td></td><td></td><td class="s"> my $c = $c[$i];</td></tr>
+<tr><td class="h"><a name="3050"></a>3050</td><td></td><td></td><td></td><td></td><td class="s"> $s->add_vertex( $s[$i] = $sc_cb->(@$c) );</td></tr>
+<tr><td class="h"><a name="3051"></a>3051</td><td></td><td></td><td></td><td></td><td class="s"> $s->set_vertex_attribute($s[$i], 'subvertices', [ @$c ]);</td></tr>
+<tr><td class="h"><a name="3052"></a>3052</td><td></td><td></td><td></td><td></td><td class="s"> for my $v (@$c) {</td></tr>
+<tr><td class="h"><a name="3053"></a>3053</td><td></td><td></td><td></td><td></td><td class="s"> $c{$v} = $i;</td></tr>
+<tr><td class="h"><a name="3054"></a>3054</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3055"></a>3055</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3056"></a>3056</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3057"></a>3057</td><td></td><td></td><td></td><td></td><td class="s"> my $n = @c;</td></tr>
+<tr><td class="h"><a name="3058"></a>3058</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ($g->vertices) {</td></tr>
+<tr><td class="h"><a name="3059"></a>3059</td><td></td><td></td><td></td><td></td><td class="s"> unless (exists $c{$v}) {</td></tr>
+<tr><td class="h"><a name="3060"></a>3060</td><td></td><td></td><td></td><td></td><td class="s"> $c{$v} = $n;</td></tr>
+<tr><td class="h"><a name="3061"></a>3061</td><td></td><td></td><td></td><td></td><td class="s"> $s[$n] = $v;</td></tr>
+<tr><td class="h"><a name="3062"></a>3062</td><td></td><td></td><td></td><td></td><td class="s"> $n++;</td></tr>
+<tr><td class="h"><a name="3063"></a>3063</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3064"></a>3064</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3065"></a>3065</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3066"></a>3066</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ($g->edges05) {</td></tr>
+<tr><td class="h"><a name="3067"></a>3067</td><td></td><td></td><td></td><td></td><td class="s"> my ($u, $v) = @$e; # @TODO: hyperedges</td></tr>
+<tr><td class="h"><a name="3068"></a>3068</td><td></td><td></td><td></td><td></td><td class="s"> unless ($c{$u} == $c{$v}) {</td></tr>
+<tr><td class="h"><a name="3069"></a>3069</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, $q) = ( $s[ $c{ $u } ], $s[ $c{ $v } ] );</td></tr>
+<tr><td class="h"><a name="3070"></a>3070</td><td></td><td></td><td></td><td></td><td class="s"> $s->add_edge($p, $q) unless $s->has_edge($p, $q);</td></tr>
+<tr><td class="h"><a name="3071"></a>3071</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3072"></a>3072</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3073"></a>3073</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3074"></a>3074</td><td></td><td></td><td></td><td></td><td class="s"> if (my @i = $g->isolated_vertices) {</td></tr>
+<tr><td class="h"><a name="3075"></a>3075</td><td></td><td></td><td></td><td></td><td class="s"> $s->add_vertices(map { $s[ $c{ $_ } ] } @i);</td></tr>
+<tr><td class="h"><a name="3076"></a>3076</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3077"></a>3077</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3078"></a>3078</td><td></td><td></td><td></td><td></td><td class="s"> return $s;</td></tr>
+<tr><td class="h"><a name="3079"></a>3079</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3080"></a>3080</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3081"></a>3081</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="3082"></a>3082</td><td></td><td></td><td></td><td></td><td class="s"># Biconnectivity.</td></tr>
+<tr><td class="h"><a name="3083"></a>3083</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="3084"></a>3084</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3085"></a>3085</td><td></td><td></td><td></td><td></td><td class="s">sub _make_bcc {</td></tr>
+<tr><td class="h"><a name="3086"></a>3086</td><td></td><td></td><td></td><td></td><td class="s"> my ($S, $v, $c) = @_;</td></tr>
+<tr><td class="h"><a name="3087"></a>3087</td><td></td><td></td><td></td><td></td><td class="s"> my %b;</td></tr>
+<tr><td class="h"><a name="3088"></a>3088</td><td></td><td></td><td></td><td></td><td class="s"> while (@$S) {</td></tr>
+<tr><td class="h"><a name="3089"></a>3089</td><td></td><td></td><td></td><td></td><td class="s"> my $t = pop @$S;</td></tr>
+<tr><td class="h"><a name="3090"></a>3090</td><td></td><td></td><td></td><td></td><td class="s"> $b{ $t } = $t;</td></tr>
+<tr><td class="h"><a name="3091"></a>3091</td><td></td><td></td><td></td><td></td><td class="s"> last if $t eq $v;</td></tr>
+<tr><td class="h"><a name="3092"></a>3092</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3093"></a>3093</td><td></td><td></td><td></td><td></td><td class="s"> return [ values %b, $c ];</td></tr>
+<tr><td class="h"><a name="3094"></a>3094</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3095"></a>3095</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3096"></a>3096</td><td></td><td></td><td></td><td></td><td class="s">sub _biconnectivity_compute {</td></tr>
+<tr><td class="h"><a name="3097"></a>3097</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3098"></a>3098</td><td></td><td></td><td></td><td></td><td class="s"> my ($opt, $unseenh, $unseena, $r, $next, $code, $attr) =</td></tr>
+<tr><td class="h"><a name="3099"></a>3099</td><td></td><td></td><td></td><td></td><td class="s"> $g->_root_opt(@_);</td></tr>
+<tr><td class="h"><a name="3100"></a>3100</td><td></td><td></td><td></td><td></td><td class="s"> return () unless defined $r;</td></tr>
+<tr><td class="h"><a name="3101"></a>3101</td><td></td><td></td><td></td><td></td><td class="s"> my %P;</td></tr>
+<tr><td class="h"><a name="3102"></a>3102</td><td></td><td></td><td></td><td></td><td class="s"> my %I;</td></tr>
+<tr><td class="h"><a name="3103"></a>3103</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ($g->vertices) {</td></tr>
+<tr><td class="h"><a name="3104"></a>3104</td><td></td><td></td><td></td><td></td><td class="s"> $I{ $v } = 0;</td></tr>
+<tr><td class="h"><a name="3105"></a>3105</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3106"></a>3106</td><td></td><td></td><td></td><td></td><td class="s"> $I{ $r } = 1;</td></tr>
+<tr><td class="h"><a name="3107"></a>3107</td><td></td><td></td><td></td><td></td><td class="s"> my %U;</td></tr>
+<tr><td class="h"><a name="3108"></a>3108</td><td></td><td></td><td></td><td></td><td class="s"> my %S; # Self-loops.</td></tr>
+<tr><td class="h"><a name="3109"></a>3109</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ($g->edges) {</td></tr>
+<tr><td class="h"><a name="3110"></a>3110</td><td></td><td></td><td></td><td></td><td class="s"> my ($u, $v) = @$e;</td></tr>
+<tr><td class="h"><a name="3111"></a>3111</td><td></td><td></td><td></td><td></td><td class="s"> $U{ $u }{ $v } = 0;</td></tr>
+<tr><td class="h"><a name="3112"></a>3112</td><td></td><td></td><td></td><td></td><td class="s"> $U{ $v }{ $u } = 0;</td></tr>
+<tr><td class="h"><a name="3113"></a>3113</td><td></td><td></td><td></td><td></td><td class="s"> $S{ $u } = 1 if $u eq $v;</td></tr>
+<tr><td class="h"><a name="3114"></a>3114</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3115"></a>3115</td><td></td><td></td><td></td><td></td><td class="s"> my $i = 1;</td></tr>
+<tr><td class="h"><a name="3116"></a>3116</td><td></td><td></td><td></td><td></td><td class="s"> my $v = $r;</td></tr>
+<tr><td class="h"><a name="3117"></a>3117</td><td></td><td></td><td></td><td></td><td class="s"> my %AP;</td></tr>
+<tr><td class="h"><a name="3118"></a>3118</td><td></td><td></td><td></td><td></td><td class="s"> my %L = ( $r => 1 );</td></tr>
+<tr><td class="h"><a name="3119"></a>3119</td><td></td><td></td><td></td><td></td><td class="s"> my @S = ( $r );</td></tr>
+<tr><td class="h"><a name="3120"></a>3120</td><td></td><td></td><td></td><td></td><td class="s"> my %A;</td></tr>
+<tr><td class="h"><a name="3121"></a>3121</td><td></td><td></td><td></td><td></td><td class="s"> my @V = $g->vertices;</td></tr>
+<tr><td class="h"><a name="3122"></a>3122</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3123"></a>3123</td><td></td><td></td><td></td><td></td><td class="s"> # print "V : @V\n";</td></tr>
+<tr><td class="h"><a name="3124"></a>3124</td><td></td><td></td><td></td><td></td><td class="s"> # print "r : $r\n";</td></tr>
+<tr><td class="h"><a name="3125"></a>3125</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3126"></a>3126</td><td></td><td></td><td></td><td></td><td class="s"> my %T; @T{ @V } = @V;</td></tr>
+<tr><td class="h"><a name="3127"></a>3127</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3128"></a>3128</td><td></td><td></td><td></td><td></td><td class="s"> for my $w (@V) {</td></tr>
+<tr><td class="h"><a name="3129"></a>3129</td><td></td><td></td><td></td><td></td><td class="s"> my @s = $g->successors( $w );</td></tr>
+<tr><td class="h"><a name="3130"></a>3130</td><td></td><td></td><td></td><td></td><td class="s"> if (@s) {</td></tr>
+<tr><td class="h"><a name="3131"></a>3131</td><td></td><td></td><td></td><td></td><td class="s"> @s = grep { $_ eq $w ? ( delete $T{ $w }, 0 ) : 1 } @s;</td></tr>
+<tr><td class="h"><a name="3132"></a>3132</td><td></td><td></td><td></td><td></td><td class="s"> @{ $A{ $w } }{ @s } = @s;</td></tr>
+<tr><td class="h"><a name="3133"></a>3133</td><td></td><td></td><td></td><td></td><td class="s"> } elsif ($g->predecessors( $w ) == 0) {</td></tr>
+<tr><td class="h"><a name="3134"></a>3134</td><td></td><td></td><td></td><td></td><td class="s"> delete $T{ $w };</td></tr>
+<tr><td class="h"><a name="3135"></a>3135</td><td></td><td></td><td></td><td></td><td class="s"> if ($w eq $r) {</td></tr>
+<tr><td class="h"><a name="3136"></a>3136</td><td></td><td></td><td></td><td></td><td class="s"> delete $I { $r };</td></tr>
+<tr><td class="h"><a name="3137"></a>3137</td><td></td><td></td><td></td><td></td><td class="s"> $r = $v = each %T;</td></tr>
+<tr><td class="h"><a name="3138"></a>3138</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $r) {</td></tr>
+<tr><td class="h"><a name="3139"></a>3139</td><td></td><td></td><td></td><td></td><td class="s"> %L = ( $r => 1 );</td></tr>
+<tr><td class="h"><a name="3140"></a>3140</td><td></td><td></td><td></td><td></td><td class="s"> @S = ( $r );</td></tr>
+<tr><td class="h"><a name="3141"></a>3141</td><td></td><td></td><td></td><td></td><td class="s"> $I{ $r } = 1;</td></tr>
+<tr><td class="h"><a name="3142"></a>3142</td><td></td><td></td><td></td><td></td><td class="s"> # print "r : $r\n";</td></tr>
+<tr><td class="h"><a name="3143"></a>3143</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3144"></a>3144</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3145"></a>3145</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3146"></a>3146</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3147"></a>3147</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3148"></a>3148</td><td></td><td></td><td></td><td></td><td class="s"> # use Data::Dumper;</td></tr>
+<tr><td class="h"><a name="3149"></a>3149</td><td></td><td></td><td></td><td></td><td class="s"> # print "T : ", Dumper(\%T);</td></tr>
+<tr><td class="h"><a name="3150"></a>3150</td><td></td><td></td><td></td><td></td><td class="s"> # print "A : ", Dumper(\%A);</td></tr>
+<tr><td class="h"><a name="3151"></a>3151</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3152"></a>3152</td><td></td><td></td><td></td><td></td><td class="s"> my %V2BC;</td></tr>
+<tr><td class="h"><a name="3153"></a>3153</td><td></td><td></td><td></td><td></td><td class="s"> my @BR;</td></tr>
+<tr><td class="h"><a name="3154"></a>3154</td><td></td><td></td><td></td><td></td><td class="s"> my @BC;</td></tr>
+<tr><td class="h"><a name="3155"></a>3155</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3156"></a>3156</td><td></td><td></td><td></td><td></td><td class="s"> my @C;</td></tr>
+<tr><td class="h"><a name="3157"></a>3157</td><td></td><td></td><td></td><td></td><td class="s"> my $Avok;</td></tr>
+<tr><td class="h"><a name="3158"></a>3158</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3159"></a>3159</td><td></td><td></td><td></td><td></td><td class="s"> while (keys %T) {</td></tr>
+<tr><td class="h"><a name="3160"></a>3160</td><td></td><td></td><td></td><td></td><td class="s"> # print "T = ", Dumper(\%T);</td></tr>
+<tr><td class="h"><a name="3161"></a>3161</td><td></td><td></td><td></td><td></td><td class="s"> do {</td></tr>
+<tr><td class="h"><a name="3162"></a>3162</td><td></td><td></td><td></td><td></td><td class="s"> my $w;</td></tr>
+<tr><td class="h"><a name="3163"></a>3163</td><td></td><td></td><td></td><td></td><td class="s"> do {</td></tr>
+<tr><td class="h"><a name="3164"></a>3164</td><td></td><td></td><td></td><td></td><td class="s"> my @w = _shuffle values %{ $A{ $v } };</td></tr>
+<tr><td class="h"><a name="3165"></a>3165</td><td></td><td></td><td></td><td></td><td class="s"> # print "w = @w\n";</td></tr>
+<tr><td class="h"><a name="3166"></a>3166</td><td></td><td></td><td></td><td></td><td class="s"> $w = first { !$U{ $v }{ $_ } } @w;</td></tr>
+<tr><td class="h"><a name="3167"></a>3167</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $w) {</td></tr>
+<tr><td class="h"><a name="3168"></a>3168</td><td></td><td></td><td></td><td></td><td class="s"> # print "w = $w\n";</td></tr>
+<tr><td class="h"><a name="3169"></a>3169</td><td></td><td></td><td></td><td></td><td class="s"> $U{ $v }{ $w }++;</td></tr>
+<tr><td class="h"><a name="3170"></a>3170</td><td></td><td></td><td></td><td></td><td class="s"> $U{ $w }{ $v }++;</td></tr>
+<tr><td class="h"><a name="3171"></a>3171</td><td></td><td></td><td></td><td></td><td class="s"> if ($I{ $w } == 0) {</td></tr>
+<tr><td class="h"><a name="3172"></a>3172</td><td></td><td></td><td></td><td></td><td class="s"> $P{ $w } = $v;</td></tr>
+<tr><td class="h"><a name="3173"></a>3173</td><td></td><td></td><td></td><td></td><td class="s"> $i++;</td></tr>
+<tr><td class="h"><a name="3174"></a>3174</td><td></td><td></td><td></td><td></td><td class="s"> $I{ $w } = $i;</td></tr>
+<tr><td class="h"><a name="3175"></a>3175</td><td></td><td></td><td></td><td></td><td class="s"> $L{ $w } = $i;</td></tr>
+<tr><td class="h"><a name="3176"></a>3176</td><td></td><td></td><td></td><td></td><td class="s"> push @S, $w;</td></tr>
+<tr><td class="h"><a name="3177"></a>3177</td><td></td><td></td><td></td><td></td><td class="s"> $v = $w;</td></tr>
+<tr><td class="h"><a name="3178"></a>3178</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3179"></a>3179</td><td></td><td></td><td></td><td></td><td class="s"> $L{ $v } = $I{ $w } if $I{ $w } < $L{ $v };</td></tr>
+<tr><td class="h"><a name="3180"></a>3180</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3181"></a>3181</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3182"></a>3182</td><td></td><td></td><td></td><td></td><td class="s"> } while (defined $w);</td></tr>
+<tr><td class="h"><a name="3183"></a>3183</td><td></td><td></td><td></td><td></td><td class="s"> # print "U = ", Dumper(\%U);</td></tr>
+<tr><td class="h"><a name="3184"></a>3184</td><td></td><td></td><td></td><td></td><td class="s"> # print "P = ", Dumper(\%P);</td></tr>
+<tr><td class="h"><a name="3185"></a>3185</td><td></td><td></td><td></td><td></td><td class="s"> # print "L = ", Dumper(\%L);</td></tr>
+<tr><td class="h"><a name="3186"></a>3186</td><td></td><td></td><td></td><td></td><td class="s"> if (!defined $P{ $v }) {</td></tr>
+<tr><td class="h"><a name="3187"></a>3187</td><td></td><td></td><td></td><td></td><td class="s"> # Do nothing.</td></tr>
+<tr><td class="h"><a name="3188"></a>3188</td><td></td><td></td><td></td><td></td><td class="s"> } elsif ($P{ $v } ne $r) {</td></tr>
+<tr><td class="h"><a name="3189"></a>3189</td><td></td><td></td><td></td><td></td><td class="s"> if ($L{ $v } < $I{ $P{ $v } }) {</td></tr>
+<tr><td class="h"><a name="3190"></a>3190</td><td></td><td></td><td></td><td></td><td class="s"> $L{ $P{ $v } } = $L{ $v } if $L{ $v } < $L{ $P{ $v } };</td></tr>
+<tr><td class="h"><a name="3191"></a>3191</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3192"></a>3192</td><td></td><td></td><td></td><td></td><td class="s"> $AP{ $P{ $v } } = $P{ $v };</td></tr>
+<tr><td class="h"><a name="3193"></a>3193</td><td></td><td></td><td></td><td></td><td class="s"> push @C, _make_bcc(\@S, $v, $P{ $v } );</td></tr>
+<tr><td class="h"><a name="3194"></a>3194</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3195"></a>3195</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3196"></a>3196</td><td></td><td></td><td></td><td></td><td class="s"> my $e;</td></tr>
+<tr><td class="h"><a name="3197"></a>3197</td><td></td><td></td><td></td><td></td><td class="s"> for my $w (_shuffle keys %{ $A{ $r } }) {</td></tr>
+<tr><td class="h"><a name="3198"></a>3198</td><td></td><td></td><td></td><td></td><td class="s"> # print "w = $w\n";</td></tr>
+<tr><td class="h"><a name="3199"></a>3199</td><td></td><td></td><td></td><td></td><td class="s"> unless ($U{ $r }{ $w }) {</td></tr>
+<tr><td class="h"><a name="3200"></a>3200</td><td></td><td></td><td></td><td></td><td class="s"> $e = $r;</td></tr>
+<tr><td class="h"><a name="3201"></a>3201</td><td></td><td></td><td></td><td></td><td class="s"> # print "e = $e\n";</td></tr>
+<tr><td class="h"><a name="3202"></a>3202</td><td></td><td></td><td></td><td></td><td class="s"> last;</td></tr>
+<tr><td class="h"><a name="3203"></a>3203</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3204"></a>3204</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3205"></a>3205</td><td></td><td></td><td></td><td></td><td class="s"> $AP{ $e } = $e if defined $e;</td></tr>
+<tr><td class="h"><a name="3206"></a>3206</td><td></td><td></td><td></td><td></td><td class="s"> push @C, _make_bcc(\@S, $v, $r);</td></tr>
+<tr><td class="h"><a name="3207"></a>3207</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3208"></a>3208</td><td></td><td></td><td></td><td></td><td class="s"> # print "AP = ", Dumper(\%AP);</td></tr>
+<tr><td class="h"><a name="3209"></a>3209</td><td></td><td></td><td></td><td></td><td class="s"> # print "C = ", Dumper(\@C);</td></tr>
+<tr><td class="h"><a name="3210"></a>3210</td><td></td><td></td><td></td><td></td><td class="s"> # print "L = ", Dumper(\%L);</td></tr>
+<tr><td class="h"><a name="3211"></a>3211</td><td></td><td></td><td></td><td></td><td class="s"> $v = defined $P{ $v } ? $P{ $v } : $r;</td></tr>
+<tr><td class="h"><a name="3212"></a>3212</td><td></td><td></td><td></td><td></td><td class="s"> # print "v = $v\n";</td></tr>
+<tr><td class="h"><a name="3213"></a>3213</td><td></td><td></td><td></td><td></td><td class="s"> $Avok = 0;</td></tr>
+<tr><td class="h"><a name="3214"></a>3214</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $v) {</td></tr>
+<tr><td class="h"><a name="3215"></a>3215</td><td></td><td></td><td></td><td></td><td class="s"> if (keys %{ $A{ $v } }) {</td></tr>
+<tr><td class="h"><a name="3216"></a>3216</td><td></td><td></td><td></td><td></td><td class="s"> if (!exists $P{ $v }) {</td></tr>
+<tr><td class="h"><a name="3217"></a>3217</td><td></td><td></td><td></td><td></td><td class="s"> for my $w (keys %{ $A{ $v } }) {</td></tr>
+<tr><td class="h"><a name="3218"></a>3218</td><td></td><td></td><td></td><td></td><td class="s"> $Avok++ if $U{ $v }{ $w };</td></tr>
+<tr><td class="h"><a name="3219"></a>3219</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3220"></a>3220</td><td></td><td></td><td></td><td></td><td class="s"> # print "Avok/1 = $Avok\n";</td></tr>
+<tr><td class="h"><a name="3221"></a>3221</td><td></td><td></td><td></td><td></td><td class="s"> $Avok = 0 unless $Avok == keys %{ $A{ $v } };</td></tr>
+<tr><td class="h"><a name="3222"></a>3222</td><td></td><td></td><td></td><td></td><td class="s"> # print "Avok/2 = $Avok\n";</td></tr>
+<tr><td class="h"><a name="3223"></a>3223</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3224"></a>3224</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3225"></a>3225</td><td></td><td></td><td></td><td></td><td class="s"> $Avok = 1;</td></tr>
+<tr><td class="h"><a name="3226"></a>3226</td><td></td><td></td><td></td><td></td><td class="s"> # print "Avok/3 = $Avok\n";</td></tr>
+<tr><td class="h"><a name="3227"></a>3227</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3228"></a>3228</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3229"></a>3229</td><td></td><td></td><td></td><td></td><td class="s"> } until ($Avok);</td></tr>
+<tr><td class="h"><a name="3230"></a>3230</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3231"></a>3231</td><td></td><td></td><td></td><td></td><td class="s"> last if @C == 0 && !exists $S{$v};</td></tr>
+<tr><td class="h"><a name="3232"></a>3232</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3233"></a>3233</td><td></td><td></td><td></td><td></td><td class="s"> for (my $i = 0; $i < @C; $i++) {</td></tr>
+<tr><td class="h"><a name="3234"></a>3234</td><td></td><td></td><td></td><td></td><td class="s"> for my $v (@{ $C[ $i ]}) {</td></tr>
+<tr><td class="h"><a name="3235"></a>3235</td><td></td><td></td><td></td><td></td><td class="s"> $V2BC{ $v }{ $i }++;</td></tr>
+<tr><td class="h"><a name="3236"></a>3236</td><td></td><td></td><td></td><td></td><td class="s"> delete $T{ $v };</td></tr>
+<tr><td class="h"><a name="3237"></a>3237</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3238"></a>3238</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3239"></a>3239</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3240"></a>3240</td><td></td><td></td><td></td><td></td><td class="s"> for (my $i = 0; $i < @C; $i++) {</td></tr>
+<tr><td class="h"><a name="3241"></a>3241</td><td></td><td></td><td></td><td></td><td class="s"> if (@{ $C[ $i ] } == 2) {</td></tr>
+<tr><td class="h"><a name="3242"></a>3242</td><td></td><td></td><td></td><td></td><td class="s"> push @BR, $C[ $i ];</td></tr>
+<tr><td class="h"><a name="3243"></a>3243</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3244"></a>3244</td><td></td><td></td><td></td><td></td><td class="s"> push @BC, $C[ $i ];</td></tr>
+<tr><td class="h"><a name="3245"></a>3245</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3246"></a>3246</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3247"></a>3247</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3248"></a>3248</td><td></td><td></td><td></td><td></td><td class="s"> if (keys %T) {</td></tr>
+<tr><td class="h"><a name="3249"></a>3249</td><td></td><td></td><td></td><td></td><td class="s"> $r = $v = each %T;</td></tr>
+<tr><td class="h"><a name="3250"></a>3250</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3251"></a>3251</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3252"></a>3252</td><td></td><td></td><td></td><td></td><td class="s"> </td></tr>
+<tr><td class="h"><a name="3253"></a>3253</td><td></td><td></td><td></td><td></td><td class="s"> return [ [values %AP], \@BC, \@BR, \%V2BC ];</td></tr>
+<tr><td class="h"><a name="3254"></a>3254</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3255"></a>3255</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3256"></a>3256</td><td></td><td></td><td></td><td></td><td class="s">sub biconnectivity {</td></tr>
+<tr><td class="h"><a name="3257"></a>3257</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3258"></a>3258</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_undirected;</td></tr>
+<tr><td class="h"><a name="3259"></a>3259</td><td></td><td></td><td></td><td></td><td class="s"> my $bcc = _check_cache($g, 'biconnectivity',</td></tr>
+<tr><td class="h"><a name="3260"></a>3260</td><td></td><td></td><td></td><td></td><td class="s"> \&_biconnectivity_compute, @_);</td></tr>
+<tr><td class="h"><a name="3261"></a>3261</td><td></td><td></td><td></td><td></td><td class="s"> return defined $bcc ? @$bcc : ( );</td></tr>
+<tr><td class="h"><a name="3262"></a>3262</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3263"></a>3263</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3264"></a>3264</td><td></td><td></td><td></td><td></td><td class="s">sub is_biconnected {</td></tr>
+<tr><td class="h"><a name="3265"></a>3265</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3266"></a>3266</td><td></td><td></td><td></td><td></td><td class="s"> my ($ap, $bc) = ($g->biconnectivity(@_))[0, 1];</td></tr>
+<tr><td class="h"><a name="3267"></a>3267</td><td></td><td></td><td></td><td></td><td class="s"> return defined $ap ? @$ap == 0 && $g->vertices >= 3 : undef;</td></tr>
+<tr><td class="h"><a name="3268"></a>3268</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3269"></a>3269</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3270"></a>3270</td><td></td><td></td><td></td><td></td><td class="s">sub is_edge_connected {</td></tr>
+<tr><td class="h"><a name="3271"></a>3271</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3272"></a>3272</td><td></td><td></td><td></td><td></td><td class="s"> my ($br) = ($g->biconnectivity(@_))[2];</td></tr>
+<tr><td class="h"><a name="3273"></a>3273</td><td></td><td></td><td></td><td></td><td class="s"> return defined $br ? @$br == 0 && $g->edges : undef;</td></tr>
+<tr><td class="h"><a name="3274"></a>3274</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3275"></a>3275</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3276"></a>3276</td><td></td><td></td><td></td><td></td><td class="s">sub is_edge_separable {</td></tr>
+<tr><td class="h"><a name="3277"></a>3277</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3278"></a>3278</td><td></td><td></td><td></td><td></td><td class="s"> my $c = $g->is_edge_connected;</td></tr>
+<tr><td class="h"><a name="3279"></a>3279</td><td></td><td></td><td></td><td></td><td class="s"> defined $c ? !$c && $g->edges : undef;</td></tr>
+<tr><td class="h"><a name="3280"></a>3280</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3281"></a>3281</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3282"></a>3282</td><td></td><td></td><td></td><td></td><td class="s">sub articulation_points {</td></tr>
+<tr><td class="h"><a name="3283"></a>3283</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3284"></a>3284</td><td></td><td></td><td></td><td></td><td class="s"> my ($ap) = ($g->biconnectivity(@_))[0];</td></tr>
+<tr><td class="h"><a name="3285"></a>3285</td><td></td><td></td><td></td><td></td><td class="s"> return defined $ap ? @$ap : ();</td></tr>
+<tr><td class="h"><a name="3286"></a>3286</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3287"></a>3287</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3288"></a>3288</td><td class="c3">1</td><td class="c3"><span title="Avg 2µs">2µs</span></td><td></td><td></td><td class="s">*cut_vertices = \&articulation_points;</td></tr>
+<tr><td class="h"><a name="3289"></a>3289</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3290"></a>3290</td><td></td><td></td><td></td><td></td><td class="s">sub biconnected_components {</td></tr>
+<tr><td class="h"><a name="3291"></a>3291</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3292"></a>3292</td><td></td><td></td><td></td><td></td><td class="s"> my ($bc) = ($g->biconnectivity(@_))[1];</td></tr>
+<tr><td class="h"><a name="3293"></a>3293</td><td></td><td></td><td></td><td></td><td class="s"> return defined $bc ? @$bc : ();</td></tr>
+<tr><td class="h"><a name="3294"></a>3294</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3295"></a>3295</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3296"></a>3296</td><td></td><td></td><td></td><td></td><td class="s">sub biconnected_component_by_index {</td></tr>
+<tr><td class="h"><a name="3297"></a>3297</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3298"></a>3298</td><td></td><td></td><td></td><td></td><td class="s"> my $i = shift;</td></tr>
+<tr><td class="h"><a name="3299"></a>3299</td><td></td><td></td><td></td><td></td><td class="s"> my ($bc) = ($g->biconnectivity(@_))[1];</td></tr>
+<tr><td class="h"><a name="3300"></a>3300</td><td></td><td></td><td></td><td></td><td class="s"> return defined $bc ? $bc->[ $i ] : undef;</td></tr>
+<tr><td class="h"><a name="3301"></a>3301</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3302"></a>3302</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3303"></a>3303</td><td></td><td></td><td></td><td></td><td class="s">sub biconnected_component_by_vertex {</td></tr>
+<tr><td class="h"><a name="3304"></a>3304</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3305"></a>3305</td><td></td><td></td><td></td><td></td><td class="s"> my $v = shift;</td></tr>
+<tr><td class="h"><a name="3306"></a>3306</td><td></td><td></td><td></td><td></td><td class="s"> my ($v2bc) = ($g->biconnectivity(@_))[3];</td></tr>
+<tr><td class="h"><a name="3307"></a>3307</td><td></td><td></td><td></td><td></td><td class="s"> return defined $v2bc->{ $v } ? keys %{ $v2bc->{ $v } } : ();</td></tr>
+<tr><td class="h"><a name="3308"></a>3308</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3309"></a>3309</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3310"></a>3310</td><td></td><td></td><td></td><td></td><td class="s">sub same_biconnected_components {</td></tr>
+<tr><td class="h"><a name="3311"></a>3311</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3312"></a>3312</td><td></td><td></td><td></td><td></td><td class="s"> my $u = shift;</td></tr>
+<tr><td class="h"><a name="3313"></a>3313</td><td></td><td></td><td></td><td></td><td class="s"> my @u = $g->biconnected_component_by_vertex($u, @_);</td></tr>
+<tr><td class="h"><a name="3314"></a>3314</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless @u;</td></tr>
+<tr><td class="h"><a name="3315"></a>3315</td><td></td><td></td><td></td><td></td><td class="s"> my %ubc; @ubc{ @u } = ();</td></tr>
+<tr><td class="h"><a name="3316"></a>3316</td><td></td><td></td><td></td><td></td><td class="s"> while (@_) {</td></tr>
+<tr><td class="h"><a name="3317"></a>3317</td><td></td><td></td><td></td><td></td><td class="s"> my $v = shift;</td></tr>
+<tr><td class="h"><a name="3318"></a>3318</td><td></td><td></td><td></td><td></td><td class="s"> my @v = $g->biconnected_component_by_vertex($v);</td></tr>
+<tr><td class="h"><a name="3319"></a>3319</td><td></td><td></td><td></td><td></td><td class="s"> if (@v) {</td></tr>
+<tr><td class="h"><a name="3320"></a>3320</td><td></td><td></td><td></td><td></td><td class="s"> my %vbc; @vbc{ @v } = ();</td></tr>
+<tr><td class="h"><a name="3321"></a>3321</td><td></td><td></td><td></td><td></td><td class="s"> my $vi;</td></tr>
+<tr><td class="h"><a name="3322"></a>3322</td><td></td><td></td><td></td><td></td><td class="s"> for my $ui (keys %ubc) {</td></tr>
+<tr><td class="h"><a name="3323"></a>3323</td><td></td><td></td><td></td><td></td><td class="s"> if (exists $vbc{ $ui }) {</td></tr>
+<tr><td class="h"><a name="3324"></a>3324</td><td></td><td></td><td></td><td></td><td class="s"> $vi = $ui;</td></tr>
+<tr><td class="h"><a name="3325"></a>3325</td><td></td><td></td><td></td><td></td><td class="s"> last;</td></tr>
+<tr><td class="h"><a name="3326"></a>3326</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3327"></a>3327</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3328"></a>3328</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless defined $vi;</td></tr>
+<tr><td class="h"><a name="3329"></a>3329</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3330"></a>3330</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3331"></a>3331</td><td></td><td></td><td></td><td></td><td class="s"> return 1;</td></tr>
+<tr><td class="h"><a name="3332"></a>3332</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3333"></a>3333</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3334"></a>3334</td><td></td><td></td><td></td><td></td><td class="s">sub biconnected_graph {</td></tr>
+<tr><td class="h"><a name="3335"></a>3335</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, %opt) = @_;</td></tr>
+<tr><td class="h"><a name="3336"></a>3336</td><td></td><td></td><td></td><td></td><td class="s"> my ($bc, $v2bc) = ($g->biconnectivity, %opt)[1, 3];</td></tr>
+<tr><td class="h"><a name="3337"></a>3337</td><td></td><td></td><td></td><td></td><td class="s"> my $bcg = Graph::Undirected->new;</td></tr>
+<tr><td class="h"><a name="3338"></a>3338</td><td></td><td></td><td></td><td></td><td class="s"> my $sc_cb =</td></tr>
+<tr><td class="h"><a name="3339"></a>3339</td><td></td><td></td><td></td><td></td><td class="s"> exists $opt{super_component} ?</td></tr>
+<tr><td class="h"><a name="3340"></a>3340</td><td></td><td></td><td></td><td></td><td class="s"> $opt{super_component} : $super_component;</td></tr>
+<tr><td class="h"><a name="3341"></a>3341</td><td></td><td></td><td></td><td></td><td class="s"> for my $c (@$bc) {</td></tr>
+<tr><td class="h"><a name="3342"></a>3342</td><td></td><td></td><td></td><td></td><td class="s"> $bcg->add_vertex(my $s = $sc_cb->(@$c));</td></tr>
+<tr><td class="h"><a name="3343"></a>3343</td><td></td><td></td><td></td><td></td><td class="s"> $bcg->set_vertex_attribute($s, 'subvertices', [ @$c ]);</td></tr>
+<tr><td class="h"><a name="3344"></a>3344</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3345"></a>3345</td><td></td><td></td><td></td><td></td><td class="s"> my %k;</td></tr>
+<tr><td class="h"><a name="3346"></a>3346</td><td></td><td></td><td></td><td></td><td class="s"> for my $i (0..$#$bc) {</td></tr>
+<tr><td class="h"><a name="3347"></a>3347</td><td></td><td></td><td></td><td></td><td class="s"> my @u = @{ $bc->[ $i ] };</td></tr>
+<tr><td class="h"><a name="3348"></a>3348</td><td></td><td></td><td></td><td></td><td class="s"> my %i; @i{ @u } = ();</td></tr>
+<tr><td class="h"><a name="3349"></a>3349</td><td></td><td></td><td></td><td></td><td class="s"> for my $j (0..$#$bc) {</td></tr>
+<tr><td class="h"><a name="3350"></a>3350</td><td></td><td></td><td></td><td></td><td class="s"> if ($i > $j) {</td></tr>
+<tr><td class="h"><a name="3351"></a>3351</td><td></td><td></td><td></td><td></td><td class="s"> my @v = @{ $bc->[ $j ] };</td></tr>
+<tr><td class="h"><a name="3352"></a>3352</td><td></td><td></td><td></td><td></td><td class="s"> my %j; @j{ @v } = ();</td></tr>
+<tr><td class="h"><a name="3353"></a>3353</td><td></td><td></td><td></td><td></td><td class="s"> for my $u (@u) {</td></tr>
+<tr><td class="h"><a name="3354"></a>3354</td><td></td><td></td><td></td><td></td><td class="s"> if (exists $j{ $u }) {</td></tr>
+<tr><td class="h"><a name="3355"></a>3355</td><td></td><td></td><td></td><td></td><td class="s"> unless ($k{ $i }{ $j }++) {</td></tr>
+<tr><td class="h"><a name="3356"></a>3356</td><td></td><td></td><td></td><td></td><td class="s"> $bcg->add_edge($sc_cb->(@{$bc->[$i]}),</td></tr>
+<tr><td class="h"><a name="3357"></a>3357</td><td></td><td></td><td></td><td></td><td class="s"> $sc_cb->(@{$bc->[$j]}));</td></tr>
+<tr><td class="h"><a name="3358"></a>3358</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3359"></a>3359</td><td></td><td></td><td></td><td></td><td class="s"> last;</td></tr>
+<tr><td class="h"><a name="3360"></a>3360</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3361"></a>3361</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3362"></a>3362</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3363"></a>3363</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3364"></a>3364</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3365"></a>3365</td><td></td><td></td><td></td><td></td><td class="s"> return $bcg;</td></tr>
+<tr><td class="h"><a name="3366"></a>3366</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3367"></a>3367</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3368"></a>3368</td><td></td><td></td><td></td><td></td><td class="s">sub bridges {</td></tr>
+<tr><td class="h"><a name="3369"></a>3369</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3370"></a>3370</td><td></td><td></td><td></td><td></td><td class="s"> my ($br) = ($g->biconnectivity(@_))[2];</td></tr>
+<tr><td class="h"><a name="3371"></a>3371</td><td></td><td></td><td></td><td></td><td class="s"> return defined $br ? @$br : ();</td></tr>
+<tr><td class="h"><a name="3372"></a>3372</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3373"></a>3373</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3374"></a>3374</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="3375"></a>3375</td><td></td><td></td><td></td><td></td><td class="s"># SPT.</td></tr>
+<tr><td class="h"><a name="3376"></a>3376</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="3377"></a>3377</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3378"></a>3378</td><td></td><td></td><td></td><td></td><td class="s">sub _SPT_add {</td></tr>
+<tr><td class="h"><a name="3379"></a>3379</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $h, $HF, $r, $attr, $unseen, $etc) = @_;</td></tr>
+<tr><td class="h"><a name="3380"></a>3380</td><td></td><td></td><td></td><td></td><td class="s"> my $etc_r = $etc->{ $r } || 0;</td></tr>
+<tr><td class="h"><a name="3381"></a>3381</td><td></td><td></td><td></td><td></td><td class="s"> for my $s ( grep { exists $unseen->{ $_ } } $g->successors( $r ) ) {</td></tr>
+<tr><td class="h"><a name="3382"></a>3382</td><td></td><td></td><td></td><td></td><td class="s"> my $t = $g->get_edge_attribute( $r, $s, $attr );</td></tr>
+<tr><td class="h"><a name="3383"></a>3383</td><td></td><td></td><td></td><td></td><td class="s"> $t = 1 unless defined $t;</td></tr>
+<tr><td class="h"><a name="3384"></a>3384</td><td></td><td></td><td></td><td></td><td class="s"> if ($t < 0) {</td></tr>
+<tr><td class="h"><a name="3385"></a>3385</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="3386"></a>3386</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("Graph::SPT_Dijkstra: edge $r-$s is negative ($t)");</td></tr>
+<tr><td class="h"><a name="3387"></a>3387</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3388"></a>3388</td><td></td><td></td><td></td><td></td><td class="s"> if (!defined($etc->{ $s }) || ($etc_r + $t) < $etc->{ $s }) {</td></tr>
+<tr><td class="h"><a name="3389"></a>3389</td><td></td><td></td><td></td><td></td><td class="s"> my $etc_s = $etc->{ $s } || 0;</td></tr>
+<tr><td class="h"><a name="3390"></a>3390</td><td></td><td></td><td></td><td></td><td class="s"> $etc->{ $s } = $etc_r + $t;</td></tr>
+<tr><td class="h"><a name="3391"></a>3391</td><td></td><td></td><td></td><td></td><td class="s"> # print "$r - $s : setting $s to $etc->{ $s } ($etc_r, $etc_s)\n";</td></tr>
+<tr><td class="h"><a name="3392"></a>3392</td><td></td><td></td><td></td><td></td><td class="s"> $h->set_vertex_attribute( $s, $attr, $etc->{ $s });</td></tr>
+<tr><td class="h"><a name="3393"></a>3393</td><td></td><td></td><td></td><td></td><td class="s"> $h->set_vertex_attribute( $s, 'p', $r );</td></tr>
+<tr><td class="h"><a name="3394"></a>3394</td><td></td><td></td><td></td><td></td><td class="s"> $HF->add( Graph::SPTHeapElem->new($r, $s, $etc->{ $s }) );</td></tr>
+<tr><td class="h"><a name="3395"></a>3395</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3396"></a>3396</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3397"></a>3397</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3398"></a>3398</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3399"></a>3399</td><td></td><td></td><td></td><td></td><td class="s">sub _SPT_Dijkstra_compute {</td></tr>
+<tr><td class="h"><a name="3400"></a>3400</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3401"></a>3401</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3402"></a>3402</td><td></td><td></td><td></td><td></td><td class="s">sub SPT_Dijkstra {</td></tr>
+<tr><td class="h"><a name="3403"></a>3403</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3404"></a>3404</td><td></td><td></td><td></td><td></td><td class="s"> my %opt = @_ == 1 ? (first_root => $_[0]) : @_;</td></tr>
+<tr><td class="h"><a name="3405"></a>3405</td><td></td><td></td><td></td><td></td><td class="s"> my $first_root = $opt{ first_root };</td></tr>
+<tr><td class="h"><a name="3406"></a>3406</td><td></td><td></td><td></td><td></td><td class="s"> unless (defined $first_root) {</td></tr>
+<tr><td class="h"><a name="3407"></a>3407</td><td></td><td></td><td></td><td></td><td class="s"> $opt{ first_root } = $first_root = $g->random_vertex();</td></tr>
+<tr><td class="h"><a name="3408"></a>3408</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3409"></a>3409</td><td></td><td></td><td></td><td></td><td class="s"> my $spt_di = $g->get_graph_attribute('_spt_di');</td></tr>
+<tr><td class="h"><a name="3410"></a>3410</td><td></td><td></td><td></td><td></td><td class="s"> unless (defined $spt_di && exists $spt_di->{ $first_root } && $spt_di->{ $first_root }->[ 0 ] == $g->[ _G ]) {</td></tr>
+<tr><td class="h"><a name="3411"></a>3411</td><td></td><td></td><td></td><td></td><td class="s"> my %etc;</td></tr>
+<tr><td class="h"><a name="3412"></a>3412</td><td></td><td></td><td></td><td></td><td class="s"> my $sptg = $g->_heap_walk($g->new, \&_SPT_add, \%etc, %opt);</td></tr>
+<tr><td class="h"><a name="3413"></a>3413</td><td></td><td></td><td></td><td></td><td class="s"> $spt_di->{ $first_root } = [ $g->[ _G ], $sptg ];</td></tr>
+<tr><td class="h"><a name="3414"></a>3414</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_graph_attribute('_spt_di', $spt_di);</td></tr>
+<tr><td class="h"><a name="3415"></a>3415</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3416"></a>3416</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3417"></a>3417</td><td></td><td></td><td></td><td></td><td class="s"> my $spt = $spt_di->{ $first_root }->[ 1 ];</td></tr>
+<tr><td class="h"><a name="3418"></a>3418</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3419"></a>3419</td><td></td><td></td><td></td><td></td><td class="s"> $spt->set_graph_attribute('SPT_Dijkstra_root', $first_root);</td></tr>
+<tr><td class="h"><a name="3420"></a>3420</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3421"></a>3421</td><td></td><td></td><td></td><td></td><td class="s"> return $spt;</td></tr>
+<tr><td class="h"><a name="3422"></a>3422</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3423"></a>3423</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3424"></a>3424</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*SSSP_Dijkstra = \&SPT_Dijkstra;</td></tr>
+<tr><td class="h"><a name="3425"></a>3425</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3426"></a>3426</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*single_source_shortest_paths = \&SPT_Dijkstra;</td></tr>
+<tr><td class="h"><a name="3427"></a>3427</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3428"></a>3428</td><td></td><td></td><td></td><td></td><td class="s">sub SP_Dijkstra {</td></tr>
+<tr><td class="h"><a name="3429"></a>3429</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $u, $v) = @_;</td></tr>
+<tr><td class="h"><a name="3430"></a>3430</td><td></td><td></td><td></td><td></td><td class="s"> my $sptg = $g->SPT_Dijkstra(first_root => $u);</td></tr>
+<tr><td class="h"><a name="3431"></a>3431</td><td></td><td></td><td></td><td></td><td class="s"> my @path = ($v);</td></tr>
+<tr><td class="h"><a name="3432"></a>3432</td><td></td><td></td><td></td><td></td><td class="s"> my %seen;</td></tr>
+<tr><td class="h"><a name="3433"></a>3433</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->vertices;</td></tr>
+<tr><td class="h"><a name="3434"></a>3434</td><td></td><td></td><td></td><td></td><td class="s"> my $p;</td></tr>
+<tr><td class="h"><a name="3435"></a>3435</td><td></td><td></td><td></td><td></td><td class="s"> while (defined($p = $sptg->get_vertex_attribute($v, 'p'))) {</td></tr>
+<tr><td class="h"><a name="3436"></a>3436</td><td></td><td></td><td></td><td></td><td class="s"> last if exists $seen{$p};</td></tr>
+<tr><td class="h"><a name="3437"></a>3437</td><td></td><td></td><td></td><td></td><td class="s"> push @path, $p;</td></tr>
+<tr><td class="h"><a name="3438"></a>3438</td><td></td><td></td><td></td><td></td><td class="s"> $v = $p;</td></tr>
+<tr><td class="h"><a name="3439"></a>3439</td><td></td><td></td><td></td><td></td><td class="s"> $seen{$p}++;</td></tr>
+<tr><td class="h"><a name="3440"></a>3440</td><td></td><td></td><td></td><td></td><td class="s"> last if keys %seen == $V || $u eq $v;</td></tr>
+<tr><td class="h"><a name="3441"></a>3441</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3442"></a>3442</td><td></td><td></td><td></td><td></td><td class="s"> @path = () if @path && $path[-1] ne $u;</td></tr>
+<tr><td class="h"><a name="3443"></a>3443</td><td></td><td></td><td></td><td></td><td class="s"> return reverse @path;</td></tr>
+<tr><td class="h"><a name="3444"></a>3444</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3445"></a>3445</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3446"></a>3446</td><td></td><td></td><td></td><td></td><td class="s">sub __SPT_Bellman_Ford {</td></tr>
+<tr><td class="h"><a name="3447"></a>3447</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $u, $v, $attr, $d, $p, $c0, $c1) = @_;</td></tr>
+<tr><td class="h"><a name="3448"></a>3448</td><td></td><td></td><td></td><td></td><td class="s"> return unless $c0->{ $u };</td></tr>
+<tr><td class="h"><a name="3449"></a>3449</td><td></td><td></td><td></td><td></td><td class="s"> my $w = $g->get_edge_attribute($u, $v, $attr);</td></tr>
+<tr><td class="h"><a name="3450"></a>3450</td><td></td><td></td><td></td><td></td><td class="s"> $w = 1 unless defined $w;</td></tr>
+<tr><td class="h"><a name="3451"></a>3451</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $d->{ $v }) {</td></tr>
+<tr><td class="h"><a name="3452"></a>3452</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $d->{ $u }) {</td></tr>
+<tr><td class="h"><a name="3453"></a>3453</td><td></td><td></td><td></td><td></td><td class="s"> if ($d->{ $v } > $d->{ $u } + $w) {</td></tr>
+<tr><td class="h"><a name="3454"></a>3454</td><td></td><td></td><td></td><td></td><td class="s"> $d->{ $v } = $d->{ $u } + $w;</td></tr>
+<tr><td class="h"><a name="3455"></a>3455</td><td></td><td></td><td></td><td></td><td class="s"> $p->{ $v } = $u;</td></tr>
+<tr><td class="h"><a name="3456"></a>3456</td><td></td><td></td><td></td><td></td><td class="s"> $c1->{ $v }++;</td></tr>
+<tr><td class="h"><a name="3457"></a>3457</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3458"></a>3458</td><td></td><td></td><td></td><td></td><td class="s"> } # else !defined $d->{ $u } && defined $d->{ $v }</td></tr>
+<tr><td class="h"><a name="3459"></a>3459</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3460"></a>3460</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $d->{ $u }) {</td></tr>
+<tr><td class="h"><a name="3461"></a>3461</td><td></td><td></td><td></td><td></td><td class="s"> # defined $d->{ $u } && !defined $d->{ $v }</td></tr>
+<tr><td class="h"><a name="3462"></a>3462</td><td></td><td></td><td></td><td></td><td class="s"> $d->{ $v } = $d->{ $u } + $w;</td></tr>
+<tr><td class="h"><a name="3463"></a>3463</td><td></td><td></td><td></td><td></td><td class="s"> $p->{ $v } = $u;</td></tr>
+<tr><td class="h"><a name="3464"></a>3464</td><td></td><td></td><td></td><td></td><td class="s"> $c1->{ $v }++;</td></tr>
+<tr><td class="h"><a name="3465"></a>3465</td><td></td><td></td><td></td><td></td><td class="s"> } # else !defined $d->{ $u } && !defined $d->{ $v }</td></tr>
+<tr><td class="h"><a name="3466"></a>3466</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3467"></a>3467</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3468"></a>3468</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3469"></a>3469</td><td></td><td></td><td></td><td></td><td class="s">sub _SPT_Bellman_Ford {</td></tr>
+<tr><td class="h"><a name="3470"></a>3470</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $opt, $unseenh, $unseena, $r, $next, $code, $attr) = @_;</td></tr>
+<tr><td class="h"><a name="3471"></a>3471</td><td></td><td></td><td></td><td></td><td class="s"> my %d;</td></tr>
+<tr><td class="h"><a name="3472"></a>3472</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $r;</td></tr>
+<tr><td class="h"><a name="3473"></a>3473</td><td></td><td></td><td></td><td></td><td class="s"> $d{ $r } = 0;</td></tr>
+<tr><td class="h"><a name="3474"></a>3474</td><td></td><td></td><td></td><td></td><td class="s"> my %p;</td></tr>
+<tr><td class="h"><a name="3475"></a>3475</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->vertices;</td></tr>
+<tr><td class="h"><a name="3476"></a>3476</td><td></td><td></td><td></td><td></td><td class="s"> my %c0; # Changed during the last iteration?</td></tr>
+<tr><td class="h"><a name="3477"></a>3477</td><td></td><td></td><td></td><td></td><td class="s"> $c0{ $r }++;</td></tr>
+<tr><td class="h"><a name="3478"></a>3478</td><td></td><td></td><td></td><td></td><td class="s"> for (my $i = 0; $i < $V; $i++) {</td></tr>
+<tr><td class="h"><a name="3479"></a>3479</td><td></td><td></td><td></td><td></td><td class="s"> my %c1;</td></tr>
+<tr><td class="h"><a name="3480"></a>3480</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ($g->edges) {</td></tr>
+<tr><td class="h"><a name="3481"></a>3481</td><td></td><td></td><td></td><td></td><td class="s"> my ($u, $v) = @$e;</td></tr>
+<tr><td class="h"><a name="3482"></a>3482</td><td></td><td></td><td></td><td></td><td class="s"> __SPT_Bellman_Ford($g, $u, $v, $attr, \%d, \%p, \%c0, \%c1);</td></tr>
+<tr><td class="h"><a name="3483"></a>3483</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->undirected) {</td></tr>
+<tr><td class="h"><a name="3484"></a>3484</td><td></td><td></td><td></td><td></td><td class="s"> __SPT_Bellman_Ford($g, $v, $u, $attr, \%d, \%p, \%c0, \%c1);</td></tr>
+<tr><td class="h"><a name="3485"></a>3485</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3486"></a>3486</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3487"></a>3487</td><td></td><td></td><td></td><td></td><td class="s"> %c0 = %c1 unless $i == $V - 1;</td></tr>
+<tr><td class="h"><a name="3488"></a>3488</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3489"></a>3489</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3490"></a>3490</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ($g->edges) {</td></tr>
+<tr><td class="h"><a name="3491"></a>3491</td><td></td><td></td><td></td><td></td><td class="s"> my ($u, $v) = @$e;</td></tr>
+<tr><td class="h"><a name="3492"></a>3492</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $d{ $u } && defined $d{ $v }) {</td></tr>
+<tr><td class="h"><a name="3493"></a>3493</td><td></td><td></td><td></td><td></td><td class="s"> my $d = $g->get_edge_attribute($u, $v, $attr);</td></tr>
+<tr><td class="h"><a name="3494"></a>3494</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $d && $d{ $v } > $d{ $u } + $d) {</td></tr>
+<tr><td class="h"><a name="3495"></a>3495</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="3496"></a>3496</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("Graph::SPT_Bellman_Ford: negative cycle exists");</td></tr>
+<tr><td class="h"><a name="3497"></a>3497</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3498"></a>3498</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3499"></a>3499</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3500"></a>3500</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3501"></a>3501</td><td></td><td></td><td></td><td></td><td class="s"> return (\%p, \%d);</td></tr>
+<tr><td class="h"><a name="3502"></a>3502</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3503"></a>3503</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3504"></a>3504</td><td></td><td></td><td></td><td></td><td class="s">sub _SPT_Bellman_Ford_compute {</td></tr>
+<tr><td class="h"><a name="3505"></a>3505</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3506"></a>3506</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3507"></a>3507</td><td></td><td></td><td></td><td></td><td class="s">sub SPT_Bellman_Ford {</td></tr>
+<tr><td class="h"><a name="3508"></a>3508</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3509"></a>3509</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3510"></a>3510</td><td></td><td></td><td></td><td></td><td class="s"> my ($opt, $unseenh, $unseena, $r, $next, $code, $attr) = $g->_root_opt(@_);</td></tr>
+<tr><td class="h"><a name="3511"></a>3511</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3512"></a>3512</td><td></td><td></td><td></td><td></td><td class="s"> unless (defined $r) {</td></tr>
+<tr><td class="h"><a name="3513"></a>3513</td><td></td><td></td><td></td><td></td><td class="s"> $r = $g->random_vertex();</td></tr>
+<tr><td class="h"><a name="3514"></a>3514</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $r;</td></tr>
+<tr><td class="h"><a name="3515"></a>3515</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3516"></a>3516</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3517"></a>3517</td><td></td><td></td><td></td><td></td><td class="s"> my $spt_bf = $g->get_graph_attribute('_spt_bf');</td></tr>
+<tr><td class="h"><a name="3518"></a>3518</td><td></td><td></td><td></td><td></td><td class="s"> unless (defined $spt_bf &&</td></tr>
+<tr><td class="h"><a name="3519"></a>3519</td><td></td><td></td><td></td><td></td><td class="s"> exists $spt_bf->{ $r } && $spt_bf->{ $r }->[ 0 ] == $g->[ _G ]) {</td></tr>
+<tr><td class="h"><a name="3520"></a>3520</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, $d) =</td></tr>
+<tr><td class="h"><a name="3521"></a>3521</td><td></td><td></td><td></td><td></td><td class="s"> $g->_SPT_Bellman_Ford($opt, $unseenh, $unseena,</td></tr>
+<tr><td class="h"><a name="3522"></a>3522</td><td></td><td></td><td></td><td></td><td class="s"> $r, $next, $code, $attr);</td></tr>
+<tr><td class="h"><a name="3523"></a>3523</td><td></td><td></td><td></td><td></td><td class="s"> my $h = $g->new;</td></tr>
+<tr><td class="h"><a name="3524"></a>3524</td><td></td><td></td><td></td><td></td><td class="s"> for my $v (keys %$p) {</td></tr>
+<tr><td class="h"><a name="3525"></a>3525</td><td></td><td></td><td></td><td></td><td class="s"> my $u = $p->{ $v };</td></tr>
+<tr><td class="h"><a name="3526"></a>3526</td><td></td><td></td><td></td><td></td><td class="s"> $h->add_edge( $u, $v );</td></tr>
+<tr><td class="h"><a name="3527"></a>3527</td><td></td><td></td><td></td><td></td><td class="s"> $h->set_edge_attribute( $u, $v, $attr,</td></tr>
+<tr><td class="h"><a name="3528"></a>3528</td><td></td><td></td><td></td><td></td><td class="s"> $g->get_edge_attribute($u, $v, $attr));</td></tr>
+<tr><td class="h"><a name="3529"></a>3529</td><td></td><td></td><td></td><td></td><td class="s"> $h->set_vertex_attribute( $v, $attr, $d->{ $v } );</td></tr>
+<tr><td class="h"><a name="3530"></a>3530</td><td></td><td></td><td></td><td></td><td class="s"> $h->set_vertex_attribute( $v, 'p', $u );</td></tr>
+<tr><td class="h"><a name="3531"></a>3531</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3532"></a>3532</td><td></td><td></td><td></td><td></td><td class="s"> $spt_bf->{ $r } = [ $g->[ _G ], $h ];</td></tr>
+<tr><td class="h"><a name="3533"></a>3533</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_graph_attribute('_spt_bf', $spt_bf);</td></tr>
+<tr><td class="h"><a name="3534"></a>3534</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3535"></a>3535</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3536"></a>3536</td><td></td><td></td><td></td><td></td><td class="s"> my $spt = $spt_bf->{ $r }->[ 1 ];</td></tr>
+<tr><td class="h"><a name="3537"></a>3537</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3538"></a>3538</td><td></td><td></td><td></td><td></td><td class="s"> $spt->set_graph_attribute('SPT_Bellman_Ford_root', $r);</td></tr>
+<tr><td class="h"><a name="3539"></a>3539</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3540"></a>3540</td><td></td><td></td><td></td><td></td><td class="s"> return $spt;</td></tr>
+<tr><td class="h"><a name="3541"></a>3541</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3542"></a>3542</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3543"></a>3543</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*SSSP_Bellman_Ford = \&SPT_Bellman_Ford;</td></tr>
+<tr><td class="h"><a name="3544"></a>3544</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3545"></a>3545</td><td></td><td></td><td></td><td></td><td class="s">sub SP_Bellman_Ford {</td></tr>
+<tr><td class="h"><a name="3546"></a>3546</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $u, $v) = @_;</td></tr>
+<tr><td class="h"><a name="3547"></a>3547</td><td></td><td></td><td></td><td></td><td class="s"> my $sptg = $g->SPT_Bellman_Ford(first_root => $u);</td></tr>
+<tr><td class="h"><a name="3548"></a>3548</td><td></td><td></td><td></td><td></td><td class="s"> my @path = ($v);</td></tr>
+<tr><td class="h"><a name="3549"></a>3549</td><td></td><td></td><td></td><td></td><td class="s"> my %seen;</td></tr>
+<tr><td class="h"><a name="3550"></a>3550</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->vertices;</td></tr>
+<tr><td class="h"><a name="3551"></a>3551</td><td></td><td></td><td></td><td></td><td class="s"> my $p;</td></tr>
+<tr><td class="h"><a name="3552"></a>3552</td><td></td><td></td><td></td><td></td><td class="s"> while (defined($p = $sptg->get_vertex_attribute($v, 'p'))) {</td></tr>
+<tr><td class="h"><a name="3553"></a>3553</td><td></td><td></td><td></td><td></td><td class="s"> last if exists $seen{$p};</td></tr>
+<tr><td class="h"><a name="3554"></a>3554</td><td></td><td></td><td></td><td></td><td class="s"> push @path, $p;</td></tr>
+<tr><td class="h"><a name="3555"></a>3555</td><td></td><td></td><td></td><td></td><td class="s"> $v = $p;</td></tr>
+<tr><td class="h"><a name="3556"></a>3556</td><td></td><td></td><td></td><td></td><td class="s"> $seen{$p}++;</td></tr>
+<tr><td class="h"><a name="3557"></a>3557</td><td></td><td></td><td></td><td></td><td class="s"> last if keys %seen == $V;</td></tr>
+<tr><td class="h"><a name="3558"></a>3558</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3559"></a>3559</td><td></td><td></td><td></td><td></td><td class="s"> # @path = () if @path && "$path[-1]" ne "$u";</td></tr>
+<tr><td class="h"><a name="3560"></a>3560</td><td></td><td></td><td></td><td></td><td class="s"> return reverse @path;</td></tr>
+<tr><td class="h"><a name="3561"></a>3561</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3562"></a>3562</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3563"></a>3563</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="3564"></a>3564</td><td></td><td></td><td></td><td></td><td class="s"># Transitive Closure.</td></tr>
+<tr><td class="h"><a name="3565"></a>3565</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="3566"></a>3566</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3567"></a>3567</td><td></td><td></td><td></td><td></td><td class="s">sub TransitiveClosure_Floyd_Warshall {</td></tr>
+<tr><td class="h"><a name="3568"></a>3568</td><td></td><td></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="3569"></a>3569</td><td></td><td></td><td></td><td></td><td class="s"> my $class = ref $self || $self;</td></tr>
+<tr><td class="h"><a name="3570"></a>3570</td><td></td><td></td><td></td><td></td><td class="s"> $self = shift unless ref $self;</td></tr>
+<tr><td class="h"><a name="3571"></a>3571</td><td></td><td></td><td></td><td></td><td class="s"> bless Graph::TransitiveClosure->new($self, @_), $class;</td></tr>
+<tr><td class="h"><a name="3572"></a>3572</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3573"></a>3573</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3574"></a>3574</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*transitive_closure = \&TransitiveClosure_Floyd_Warshall;</td></tr>
+<tr><td class="h"><a name="3575"></a>3575</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3576"></a>3576</td><td></td><td></td><td></td><td></td><td class="s">sub APSP_Floyd_Warshall {</td></tr>
+<tr><td class="h"><a name="3577"></a>3577</td><td></td><td></td><td></td><td></td><td class="s"> my $self = shift;</td></tr>
+<tr><td class="h"><a name="3578"></a>3578</td><td></td><td></td><td></td><td></td><td class="s"> my $class = ref $self || $self;</td></tr>
+<tr><td class="h"><a name="3579"></a>3579</td><td></td><td></td><td></td><td></td><td class="s"> $self = shift unless ref $self;</td></tr>
+<tr><td class="h"><a name="3580"></a>3580</td><td></td><td></td><td></td><td></td><td class="s"> bless Graph::TransitiveClosure->new($self, path => 1, @_), $class;</td></tr>
+<tr><td class="h"><a name="3581"></a>3581</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3582"></a>3582</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3583"></a>3583</td><td class="c3">1</td><td class="c3"><span title="Avg 2µs">2µs</span></td><td></td><td></td><td class="s">*all_pairs_shortest_paths = \&APSP_Floyd_Warshall;</td></tr>
+<tr><td class="h"><a name="3584"></a>3584</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3585"></a>3585</td><td></td><td></td><td></td><td></td><td class="s">sub _transitive_closure_matrix_compute {</td></tr>
+<tr><td class="h"><a name="3586"></a>3586</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3587"></a>3587</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3588"></a>3588</td><td></td><td></td><td></td><td></td><td class="s">sub transitive_closure_matrix {</td></tr>
+<tr><td class="h"><a name="3589"></a>3589</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3590"></a>3590</td><td></td><td></td><td></td><td></td><td class="s"> my $tcm = $g->get_graph_attribute('_tcm');</td></tr>
+<tr><td class="h"><a name="3591"></a>3591</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $tcm) {</td></tr>
+<tr><td class="h"><a name="3592"></a>3592</td><td></td><td></td><td></td><td></td><td class="s"> if (ref $tcm eq 'ARRAY') { # YECHHH!</td></tr>
+<tr><td class="h"><a name="3593"></a>3593</td><td></td><td></td><td></td><td></td><td class="s"> if ($tcm->[ 0 ] == $g->[ _G ]) {</td></tr>
+<tr><td class="h"><a name="3594"></a>3594</td><td></td><td></td><td></td><td></td><td class="s"> $tcm = $tcm->[ 1 ];</td></tr>
+<tr><td class="h"><a name="3595"></a>3595</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3596"></a>3596</td><td></td><td></td><td></td><td></td><td class="s"> undef $tcm;</td></tr>
+<tr><td class="h"><a name="3597"></a>3597</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3598"></a>3598</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3599"></a>3599</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3600"></a>3600</td><td></td><td></td><td></td><td></td><td class="s"> unless (defined $tcm) {</td></tr>
+<tr><td class="h"><a name="3601"></a>3601</td><td></td><td></td><td></td><td></td><td class="s"> my $apsp = $g->APSP_Floyd_Warshall(@_);</td></tr>
+<tr><td class="h"><a name="3602"></a>3602</td><td></td><td></td><td></td><td></td><td class="s"> $tcm = $apsp->get_graph_attribute('_tcm');</td></tr>
+<tr><td class="h"><a name="3603"></a>3603</td><td></td><td></td><td></td><td></td><td class="s"> $g->set_graph_attribute('_tcm', [ $g->[ _G ], $tcm ]);</td></tr>
+<tr><td class="h"><a name="3604"></a>3604</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3605"></a>3605</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3606"></a>3606</td><td></td><td></td><td></td><td></td><td class="s"> return $tcm;</td></tr>
+<tr><td class="h"><a name="3607"></a>3607</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3608"></a>3608</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3609"></a>3609</td><td></td><td></td><td></td><td></td><td class="s">sub path_length {</td></tr>
+<tr><td class="h"><a name="3610"></a>3610</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3611"></a>3611</td><td></td><td></td><td></td><td></td><td class="s"> my $tcm = $g->transitive_closure_matrix;</td></tr>
+<tr><td class="h"><a name="3612"></a>3612</td><td></td><td></td><td></td><td></td><td class="s"> $tcm->path_length(@_);</td></tr>
+<tr><td class="h"><a name="3613"></a>3613</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3614"></a>3614</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3615"></a>3615</td><td></td><td></td><td></td><td></td><td class="s">sub path_predecessor {</td></tr>
+<tr><td class="h"><a name="3616"></a>3616</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3617"></a>3617</td><td></td><td></td><td></td><td></td><td class="s"> my $tcm = $g->transitive_closure_matrix;</td></tr>
+<tr><td class="h"><a name="3618"></a>3618</td><td></td><td></td><td></td><td></td><td class="s"> $tcm->path_predecessor(@_);</td></tr>
+<tr><td class="h"><a name="3619"></a>3619</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3620"></a>3620</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3621"></a>3621</td><td></td><td></td><td></td><td></td><td class="s">sub path_vertices {</td></tr>
+<tr><td class="h"><a name="3622"></a>3622</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3623"></a>3623</td><td></td><td></td><td></td><td></td><td class="s"> my $tcm = $g->transitive_closure_matrix;</td></tr>
+<tr><td class="h"><a name="3624"></a>3624</td><td></td><td></td><td></td><td></td><td class="s"> $tcm->path_vertices(@_);</td></tr>
+<tr><td class="h"><a name="3625"></a>3625</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3626"></a>3626</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3627"></a>3627</td><td></td><td></td><td></td><td></td><td class="s">sub is_reachable {</td></tr>
+<tr><td class="h"><a name="3628"></a>3628</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3629"></a>3629</td><td></td><td></td><td></td><td></td><td class="s"> my $tcm = $g->transitive_closure_matrix;</td></tr>
+<tr><td class="h"><a name="3630"></a>3630</td><td></td><td></td><td></td><td></td><td class="s"> $tcm->is_reachable(@_);</td></tr>
+<tr><td class="h"><a name="3631"></a>3631</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3632"></a>3632</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3633"></a>3633</td><td></td><td></td><td></td><td></td><td class="s">sub for_shortest_paths {</td></tr>
+<tr><td class="h"><a name="3634"></a>3634</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3635"></a>3635</td><td></td><td></td><td></td><td></td><td class="s"> my $c = shift;</td></tr>
+<tr><td class="h"><a name="3636"></a>3636</td><td></td><td></td><td></td><td></td><td class="s"> my $t = $g->transitive_closure_matrix;</td></tr>
+<tr><td class="h"><a name="3637"></a>3637</td><td></td><td></td><td></td><td></td><td class="s"> my @v = $g->vertices;</td></tr>
+<tr><td class="h"><a name="3638"></a>3638</td><td></td><td></td><td></td><td></td><td class="s"> my $n = 0;</td></tr>
+<tr><td class="h"><a name="3639"></a>3639</td><td></td><td></td><td></td><td></td><td class="s"> for my $u (@v) {</td></tr>
+<tr><td class="h"><a name="3640"></a>3640</td><td></td><td></td><td></td><td></td><td class="s"> for my $v (@v) {</td></tr>
+<tr><td class="h"><a name="3641"></a>3641</td><td></td><td></td><td></td><td></td><td class="s"> next unless $t->is_reachable($u, $v);</td></tr>
+<tr><td class="h"><a name="3642"></a>3642</td><td></td><td></td><td></td><td></td><td class="s"> $n++;</td></tr>
+<tr><td class="h"><a name="3643"></a>3643</td><td></td><td></td><td></td><td></td><td class="s"> $c->($t, $u, $v, $n);</td></tr>
+<tr><td class="h"><a name="3644"></a>3644</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3645"></a>3645</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3646"></a>3646</td><td></td><td></td><td></td><td></td><td class="s"> return $n;</td></tr>
+<tr><td class="h"><a name="3647"></a>3647</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3648"></a>3648</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3649"></a>3649</td><td></td><td></td><td></td><td></td><td class="s">sub _minmax_path {</td></tr>
+<tr><td class="h"><a name="3650"></a>3650</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3651"></a>3651</td><td></td><td></td><td></td><td></td><td class="s"> my $min;</td></tr>
+<tr><td class="h"><a name="3652"></a>3652</td><td></td><td></td><td></td><td></td><td class="s"> my $max;</td></tr>
+<tr><td class="h"><a name="3653"></a>3653</td><td></td><td></td><td></td><td></td><td class="s"> my $minp;</td></tr>
+<tr><td class="h"><a name="3654"></a>3654</td><td></td><td></td><td></td><td></td><td class="s"> my $maxp;</td></tr>
+<tr><td class="h"><a name="3655"></a>3655</td><td></td><td></td><td></td><td></td><td class="s"> $g->for_shortest_paths(sub {</td></tr>
+<tr><td class="h"><a name="3656"></a>3656</td><td></td><td></td><td></td><td></td><td class="s"> my ($t, $u, $v, $n) = @_;</td></tr>
+<tr><td class="h"><a name="3657"></a>3657</td><td></td><td></td><td></td><td></td><td class="s"> my $l = $t->path_length($u, $v);</td></tr>
+<tr><td class="h"><a name="3658"></a>3658</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $l;</td></tr>
+<tr><td class="h"><a name="3659"></a>3659</td><td></td><td></td><td></td><td></td><td class="s"> my $p;</td></tr>
+<tr><td class="h"><a name="3660"></a>3660</td><td></td><td></td><td></td><td></td><td class="s"> if ($u ne $v && (!defined $max || $l > $max)) {</td></tr>
+<tr><td class="h"><a name="3661"></a>3661</td><td></td><td></td><td></td><td></td><td class="s"> $max = $l;</td></tr>
+<tr><td class="h"><a name="3662"></a>3662</td><td></td><td></td><td></td><td></td><td class="s"> $maxp = $p = [ $t->path_vertices($u, $v) ];</td></tr>
+<tr><td class="h"><a name="3663"></a>3663</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3664"></a>3664</td><td></td><td></td><td></td><td></td><td class="s"> if ($u ne $v && (!defined $min || $l < $min)) {</td></tr>
+<tr><td class="h"><a name="3665"></a>3665</td><td></td><td></td><td></td><td></td><td class="s"> $min = $l;</td></tr>
+<tr><td class="h"><a name="3666"></a>3666</td><td></td><td></td><td></td><td></td><td class="s"> $minp = $p || [ $t->path_vertices($u, $v) ];</td></tr>
+<tr><td class="h"><a name="3667"></a>3667</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3668"></a>3668</td><td></td><td></td><td></td><td></td><td class="s"> });</td></tr>
+<tr><td class="h"><a name="3669"></a>3669</td><td></td><td></td><td></td><td></td><td class="s"> return ($min, $max, $minp, $maxp);</td></tr>
+<tr><td class="h"><a name="3670"></a>3670</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3671"></a>3671</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3672"></a>3672</td><td></td><td></td><td></td><td></td><td class="s">sub diameter {</td></tr>
+<tr><td class="h"><a name="3673"></a>3673</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3674"></a>3674</td><td></td><td></td><td></td><td></td><td class="s"> my ($min, $max, $minp, $maxp) = $g->_minmax_path(@_);</td></tr>
+<tr><td class="h"><a name="3675"></a>3675</td><td></td><td></td><td></td><td></td><td class="s"> return defined $maxp ? (wantarray ? @$maxp : $max) : undef;</td></tr>
+<tr><td class="h"><a name="3676"></a>3676</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3677"></a>3677</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3678"></a>3678</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*graph_diameter = \&diameter;</td></tr>
+<tr><td class="h"><a name="3679"></a>3679</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3680"></a>3680</td><td></td><td></td><td></td><td></td><td class="s">sub longest_path {</td></tr>
+<tr><td class="h"><a name="3681"></a>3681</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $u, $v) = @_;</td></tr>
+<tr><td class="h"><a name="3682"></a>3682</td><td></td><td></td><td></td><td></td><td class="s"> my $t = $g->transitive_closure_matrix;</td></tr>
+<tr><td class="h"><a name="3683"></a>3683</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $u) {</td></tr>
+<tr><td class="h"><a name="3684"></a>3684</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $v) {</td></tr>
+<tr><td class="h"><a name="3685"></a>3685</td><td></td><td></td><td></td><td></td><td class="s"> return wantarray ?</td></tr>
+<tr><td class="h"><a name="3686"></a>3686</td><td></td><td></td><td></td><td></td><td class="s"> $t->path_vertices($u, $v) : $t->path_length($u, $v);</td></tr>
+<tr><td class="h"><a name="3687"></a>3687</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3688"></a>3688</td><td></td><td></td><td></td><td></td><td class="s"> my $max;</td></tr>
+<tr><td class="h"><a name="3689"></a>3689</td><td></td><td></td><td></td><td></td><td class="s"> my @max;</td></tr>
+<tr><td class="h"><a name="3690"></a>3690</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ($g->vertices) {</td></tr>
+<tr><td class="h"><a name="3691"></a>3691</td><td></td><td></td><td></td><td></td><td class="s"> next if $u eq $v;</td></tr>
+<tr><td class="h"><a name="3692"></a>3692</td><td></td><td></td><td></td><td></td><td class="s"> my $l = $t->path_length($u, $v);</td></tr>
+<tr><td class="h"><a name="3693"></a>3693</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $l && (!defined $max || $l > $max)) {</td></tr>
+<tr><td class="h"><a name="3694"></a>3694</td><td></td><td></td><td></td><td></td><td class="s"> $max = $l;</td></tr>
+<tr><td class="h"><a name="3695"></a>3695</td><td></td><td></td><td></td><td></td><td class="s"> @max = $t->path_vertices($u, $v);</td></tr>
+<tr><td class="h"><a name="3696"></a>3696</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3697"></a>3697</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3698"></a>3698</td><td></td><td></td><td></td><td></td><td class="s"> return wantarray ? @max : $max;</td></tr>
+<tr><td class="h"><a name="3699"></a>3699</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3700"></a>3700</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3701"></a>3701</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $v) {</td></tr>
+<tr><td class="h"><a name="3702"></a>3702</td><td></td><td></td><td></td><td></td><td class="s"> my $max;</td></tr>
+<tr><td class="h"><a name="3703"></a>3703</td><td></td><td></td><td></td><td></td><td class="s"> my @max;</td></tr>
+<tr><td class="h"><a name="3704"></a>3704</td><td></td><td></td><td></td><td></td><td class="s"> for my $u ($g->vertices) {</td></tr>
+<tr><td class="h"><a name="3705"></a>3705</td><td></td><td></td><td></td><td></td><td class="s"> next if $u eq $v;</td></tr>
+<tr><td class="h"><a name="3706"></a>3706</td><td></td><td></td><td></td><td></td><td class="s"> my $l = $t->path_length($u, $v);</td></tr>
+<tr><td class="h"><a name="3707"></a>3707</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $l && (!defined $max || $l > $max)) {</td></tr>
+<tr><td class="h"><a name="3708"></a>3708</td><td></td><td></td><td></td><td></td><td class="s"> $max = $l;</td></tr>
+<tr><td class="h"><a name="3709"></a>3709</td><td></td><td></td><td></td><td></td><td class="s"> @max = $t->path_vertices($u, $v);</td></tr>
+<tr><td class="h"><a name="3710"></a>3710</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3711"></a>3711</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3712"></a>3712</td><td></td><td></td><td></td><td></td><td class="s"> return wantarray ? @max : @max - 1;</td></tr>
+<tr><td class="h"><a name="3713"></a>3713</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3714"></a>3714</td><td></td><td></td><td></td><td></td><td class="s"> my ($min, $max, $minp, $maxp) = $g->_minmax_path(@_);</td></tr>
+<tr><td class="h"><a name="3715"></a>3715</td><td></td><td></td><td></td><td></td><td class="s"> return defined $maxp ? (wantarray ? @$maxp : $max) : undef;</td></tr>
+<tr><td class="h"><a name="3716"></a>3716</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3717"></a>3717</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3718"></a>3718</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3719"></a>3719</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3720"></a>3720</td><td></td><td></td><td></td><td></td><td class="s">sub vertex_eccentricity {</td></tr>
+<tr><td class="h"><a name="3721"></a>3721</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $u) = @_;</td></tr>
+<tr><td class="h"><a name="3722"></a>3722</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_undirected;</td></tr>
+<tr><td class="h"><a name="3723"></a>3723</td><td></td><td></td><td></td><td></td><td class="s"> if ($g->is_connected) {</td></tr>
+<tr><td class="h"><a name="3724"></a>3724</td><td></td><td></td><td></td><td></td><td class="s"> my $max;</td></tr>
+<tr><td class="h"><a name="3725"></a>3725</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ($g->vertices) {</td></tr>
+<tr><td class="h"><a name="3726"></a>3726</td><td></td><td></td><td></td><td></td><td class="s"> next if $u eq $v;</td></tr>
+<tr><td class="h"><a name="3727"></a>3727</td><td></td><td></td><td></td><td></td><td class="s"> my $l = $g->path_length($u, $v);</td></tr>
+<tr><td class="h"><a name="3728"></a>3728</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $l && (!defined $max || $l > $max)) {</td></tr>
+<tr><td class="h"><a name="3729"></a>3729</td><td></td><td></td><td></td><td></td><td class="s"> $max = $l;</td></tr>
+<tr><td class="h"><a name="3730"></a>3730</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3731"></a>3731</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3732"></a>3732</td><td></td><td></td><td></td><td></td><td class="s"> return $max;</td></tr>
+<tr><td class="h"><a name="3733"></a>3733</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3734"></a>3734</td><td></td><td></td><td></td><td></td><td class="s"> return Infinity();</td></tr>
+<tr><td class="h"><a name="3735"></a>3735</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3736"></a>3736</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3737"></a>3737</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3738"></a>3738</td><td></td><td></td><td></td><td></td><td class="s">sub shortest_path {</td></tr>
+<tr><td class="h"><a name="3739"></a>3739</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $u, $v) = @_;</td></tr>
+<tr><td class="h"><a name="3740"></a>3740</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_undirected;</td></tr>
+<tr><td class="h"><a name="3741"></a>3741</td><td></td><td></td><td></td><td></td><td class="s"> my $t = $g->transitive_closure_matrix;</td></tr>
+<tr><td class="h"><a name="3742"></a>3742</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $u) {</td></tr>
+<tr><td class="h"><a name="3743"></a>3743</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $v) {</td></tr>
+<tr><td class="h"><a name="3744"></a>3744</td><td></td><td></td><td></td><td></td><td class="s"> return wantarray ?</td></tr>
+<tr><td class="h"><a name="3745"></a>3745</td><td></td><td></td><td></td><td></td><td class="s"> $t->path_vertices($u, $v) : $t->path_length($u, $v);</td></tr>
+<tr><td class="h"><a name="3746"></a>3746</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3747"></a>3747</td><td></td><td></td><td></td><td></td><td class="s"> my $min;</td></tr>
+<tr><td class="h"><a name="3748"></a>3748</td><td></td><td></td><td></td><td></td><td class="s"> my @min;</td></tr>
+<tr><td class="h"><a name="3749"></a>3749</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ($g->vertices) {</td></tr>
+<tr><td class="h"><a name="3750"></a>3750</td><td></td><td></td><td></td><td></td><td class="s"> next if $u eq $v;</td></tr>
+<tr><td class="h"><a name="3751"></a>3751</td><td></td><td></td><td></td><td></td><td class="s"> my $l = $t->path_length($u, $v);</td></tr>
+<tr><td class="h"><a name="3752"></a>3752</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $l && (!defined $min || $l < $min)) {</td></tr>
+<tr><td class="h"><a name="3753"></a>3753</td><td></td><td></td><td></td><td></td><td class="s"> $min = $l;</td></tr>
+<tr><td class="h"><a name="3754"></a>3754</td><td></td><td></td><td></td><td></td><td class="s"> @min = $t->path_vertices($u, $v);</td></tr>
+<tr><td class="h"><a name="3755"></a>3755</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3756"></a>3756</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3757"></a>3757</td><td></td><td></td><td></td><td></td><td class="s"> return wantarray ? @min : $min;</td></tr>
+<tr><td class="h"><a name="3758"></a>3758</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3759"></a>3759</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3760"></a>3760</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $v) {</td></tr>
+<tr><td class="h"><a name="3761"></a>3761</td><td></td><td></td><td></td><td></td><td class="s"> my $min;</td></tr>
+<tr><td class="h"><a name="3762"></a>3762</td><td></td><td></td><td></td><td></td><td class="s"> my @min;</td></tr>
+<tr><td class="h"><a name="3763"></a>3763</td><td></td><td></td><td></td><td></td><td class="s"> for my $u ($g->vertices) {</td></tr>
+<tr><td class="h"><a name="3764"></a>3764</td><td></td><td></td><td></td><td></td><td class="s"> next if $u eq $v;</td></tr>
+<tr><td class="h"><a name="3765"></a>3765</td><td></td><td></td><td></td><td></td><td class="s"> my $l = $t->path_length($u, $v);</td></tr>
+<tr><td class="h"><a name="3766"></a>3766</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $l && (!defined $min || $l < $min)) {</td></tr>
+<tr><td class="h"><a name="3767"></a>3767</td><td></td><td></td><td></td><td></td><td class="s"> $min = $l;</td></tr>
+<tr><td class="h"><a name="3768"></a>3768</td><td></td><td></td><td></td><td></td><td class="s"> @min = $t->path_vertices($u, $v);</td></tr>
+<tr><td class="h"><a name="3769"></a>3769</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3770"></a>3770</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3771"></a>3771</td><td></td><td></td><td></td><td></td><td class="s"> return wantarray ? @min : $min;</td></tr>
+<tr><td class="h"><a name="3772"></a>3772</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3773"></a>3773</td><td></td><td></td><td></td><td></td><td class="s"> my ($min, $max, $minp, $maxp) = $g->_minmax_path(@_);</td></tr>
+<tr><td class="h"><a name="3774"></a>3774</td><td></td><td></td><td></td><td></td><td class="s"> return defined $minp ? (wantarray ? @$minp : $min) : undef;</td></tr>
+<tr><td class="h"><a name="3775"></a>3775</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3776"></a>3776</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3777"></a>3777</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3778"></a>3778</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3779"></a>3779</td><td></td><td></td><td></td><td></td><td class="s">sub radius {</td></tr>
+<tr><td class="h"><a name="3780"></a>3780</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3781"></a>3781</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_undirected;</td></tr>
+<tr><td class="h"><a name="3782"></a>3782</td><td></td><td></td><td></td><td></td><td class="s"> my ($center, $radius) = (undef, Infinity());</td></tr>
+<tr><td class="h"><a name="3783"></a>3783</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ($g->vertices) {</td></tr>
+<tr><td class="h"><a name="3784"></a>3784</td><td></td><td></td><td></td><td></td><td class="s"> my $x = $g->vertex_eccentricity($v);</td></tr>
+<tr><td class="h"><a name="3785"></a>3785</td><td></td><td></td><td></td><td></td><td class="s"> ($center, $radius) = ($v, $x) if defined $x && $x < $radius;</td></tr>
+<tr><td class="h"><a name="3786"></a>3786</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3787"></a>3787</td><td></td><td></td><td></td><td></td><td class="s"> return $radius;</td></tr>
+<tr><td class="h"><a name="3788"></a>3788</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3789"></a>3789</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3790"></a>3790</td><td></td><td></td><td></td><td></td><td class="s">sub center_vertices {</td></tr>
+<tr><td class="h"><a name="3791"></a>3791</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $delta) = @_;</td></tr>
+<tr><td class="h"><a name="3792"></a>3792</td><td></td><td></td><td></td><td></td><td class="s"> $g->expect_undirected;</td></tr>
+<tr><td class="h"><a name="3793"></a>3793</td><td></td><td></td><td></td><td></td><td class="s"> $delta = 0 unless defined $delta;</td></tr>
+<tr><td class="h"><a name="3794"></a>3794</td><td></td><td></td><td></td><td></td><td class="s"> $delta = abs($delta);</td></tr>
+<tr><td class="h"><a name="3795"></a>3795</td><td></td><td></td><td></td><td></td><td class="s"> my @c;</td></tr>
+<tr><td class="h"><a name="3796"></a>3796</td><td></td><td></td><td></td><td></td><td class="s"> my $r = $g->radius;</td></tr>
+<tr><td class="h"><a name="3797"></a>3797</td><td></td><td></td><td></td><td></td><td class="s"> if (defined $r) {</td></tr>
+<tr><td class="h"><a name="3798"></a>3798</td><td></td><td></td><td></td><td></td><td class="s"> for my $v ($g->vertices) {</td></tr>
+<tr><td class="h"><a name="3799"></a>3799</td><td></td><td></td><td></td><td></td><td class="s"> my $e = $g->vertex_eccentricity($v);</td></tr>
+<tr><td class="h"><a name="3800"></a>3800</td><td></td><td></td><td></td><td></td><td class="s"> next unless defined $e;</td></tr>
+<tr><td class="h"><a name="3801"></a>3801</td><td></td><td></td><td></td><td></td><td class="s"> push @c, $v if abs($e - $r) <= $delta;</td></tr>
+<tr><td class="h"><a name="3802"></a>3802</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3803"></a>3803</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3804"></a>3804</td><td></td><td></td><td></td><td></td><td class="s"> return @c;</td></tr>
+<tr><td class="h"><a name="3805"></a>3805</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3806"></a>3806</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3807"></a>3807</td><td class="c3">1</td><td class="c3"><span title="Avg 1µs">1µs</span></td><td></td><td></td><td class="s">*centre_vertices = \&center_vertices;</td></tr>
+<tr><td class="h"><a name="3808"></a>3808</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3809"></a>3809</td><td></td><td></td><td></td><td></td><td class="s">sub average_path_length {</td></tr>
+<tr><td class="h"><a name="3810"></a>3810</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3811"></a>3811</td><td></td><td></td><td></td><td></td><td class="s"> my @A = @_;</td></tr>
+<tr><td class="h"><a name="3812"></a>3812</td><td></td><td></td><td></td><td></td><td class="s"> my $d = 0;</td></tr>
+<tr><td class="h"><a name="3813"></a>3813</td><td></td><td></td><td></td><td></td><td class="s"> my $m = 0;</td></tr>
+<tr><td class="h"><a name="3814"></a>3814</td><td></td><td></td><td></td><td></td><td class="s"> my $n = $g->for_shortest_paths(sub {</td></tr>
+<tr><td class="h"><a name="3815"></a>3815</td><td></td><td></td><td></td><td></td><td class="s"> my ($t, $u, $v, $n) = @_;</td></tr>
+<tr><td class="h"><a name="3816"></a>3816</td><td></td><td></td><td></td><td></td><td class="s"> my $l = $t->path_length($u, $v);</td></tr>
+<tr><td class="h"><a name="3817"></a>3817</td><td></td><td></td><td></td><td></td><td class="s"> if ($l) {</td></tr>
+<tr><td class="h"><a name="3818"></a>3818</td><td></td><td></td><td></td><td></td><td class="s"> my $c = @A == 0 ||</td></tr>
+<tr><td class="h"><a name="3819"></a>3819</td><td></td><td></td><td></td><td></td><td class="s"> (@A == 1 && $u eq $A[0]) ||</td></tr>
+<tr><td class="h"><a name="3820"></a>3820</td><td></td><td></td><td></td><td></td><td class="s"> ((@A == 2) &&</td></tr>
+<tr><td class="h"><a name="3821"></a>3821</td><td></td><td></td><td></td><td></td><td class="s"> (defined $A[0] &&</td></tr>
+<tr><td class="h"><a name="3822"></a>3822</td><td></td><td></td><td></td><td></td><td class="s"> $u eq $A[0]) ||</td></tr>
+<tr><td class="h"><a name="3823"></a>3823</td><td></td><td></td><td></td><td></td><td class="s"> (defined $A[1] &&</td></tr>
+<tr><td class="h"><a name="3824"></a>3824</td><td></td><td></td><td></td><td></td><td class="s"> $v eq $A[1]));</td></tr>
+<tr><td class="h"><a name="3825"></a>3825</td><td></td><td></td><td></td><td></td><td class="s"> if ($c) {</td></tr>
+<tr><td class="h"><a name="3826"></a>3826</td><td></td><td></td><td></td><td></td><td class="s"> $d += $l;</td></tr>
+<tr><td class="h"><a name="3827"></a>3827</td><td></td><td></td><td></td><td></td><td class="s"> $m++;</td></tr>
+<tr><td class="h"><a name="3828"></a>3828</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3829"></a>3829</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3830"></a>3830</td><td></td><td></td><td></td><td></td><td class="s"> });</td></tr>
+<tr><td class="h"><a name="3831"></a>3831</td><td></td><td></td><td></td><td></td><td class="s"> return $m ? $d / $m : undef;</td></tr>
+<tr><td class="h"><a name="3832"></a>3832</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3833"></a>3833</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3834"></a>3834</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="3835"></a>3835</td><td></td><td></td><td></td><td></td><td class="s"># Simple tests.</td></tr>
+<tr><td class="h"><a name="3836"></a>3836</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="3837"></a>3837</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3838"></a>3838</td><td></td><td></td><td></td><td></td><td class="s">sub is_multi_graph {</td></tr>
+<tr><td class="h"><a name="3839"></a>3839</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3840"></a>3840</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless $g->is_multiedged || $g->is_countedged;</td></tr>
+<tr><td class="h"><a name="3841"></a>3841</td><td></td><td></td><td></td><td></td><td class="s"> my $multiedges = 0;</td></tr>
+<tr><td class="h"><a name="3842"></a>3842</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ($g->edges05) {</td></tr>
+<tr><td class="h"><a name="3843"></a>3843</td><td></td><td></td><td></td><td></td><td class="s"> my ($u, @v) = @$e;</td></tr>
+<tr><td class="h"><a name="3844"></a>3844</td><td></td><td></td><td></td><td></td><td class="s"> for my $v (@v) {</td></tr>
+<tr><td class="h"><a name="3845"></a>3845</td><td></td><td></td><td></td><td></td><td class="s"> return 0 if $u eq $v;</td></tr>
+<tr><td class="h"><a name="3846"></a>3846</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3847"></a>3847</td><td></td><td></td><td></td><td></td><td class="s"> $multiedges++ if $g->get_edge_count(@$e) > 1;</td></tr>
+<tr><td class="h"><a name="3848"></a>3848</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3849"></a>3849</td><td></td><td></td><td></td><td></td><td class="s"> return $multiedges;</td></tr>
+<tr><td class="h"><a name="3850"></a>3850</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3851"></a>3851</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3852"></a>3852</td><td></td><td></td><td></td><td></td><td class="s">sub is_simple_graph {</td></tr>
+<tr><td class="h"><a name="3853"></a>3853</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3854"></a>3854</td><td></td><td></td><td></td><td></td><td class="s"> return 1 unless $g->is_countedged || $g->is_multiedged;</td></tr>
+<tr><td class="h"><a name="3855"></a>3855</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ($g->edges05) {</td></tr>
+<tr><td class="h"><a name="3856"></a>3856</td><td></td><td></td><td></td><td></td><td class="s"> return 0 if $g->get_edge_count(@$e) > 1;</td></tr>
+<tr><td class="h"><a name="3857"></a>3857</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3858"></a>3858</td><td></td><td></td><td></td><td></td><td class="s"> return 1;</td></tr>
+<tr><td class="h"><a name="3859"></a>3859</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3860"></a>3860</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3861"></a>3861</td><td></td><td></td><td></td><td></td><td class="s">sub is_pseudo_graph {</td></tr>
+<tr><td class="h"><a name="3862"></a>3862</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="3863"></a>3863</td><td></td><td></td><td></td><td></td><td class="s"> my $m = $g->is_countedged || $g->is_multiedged;</td></tr>
+<tr><td class="h"><a name="3864"></a>3864</td><td></td><td></td><td></td><td></td><td class="s"> for my $e ($g->edges05) {</td></tr>
+<tr><td class="h"><a name="3865"></a>3865</td><td></td><td></td><td></td><td></td><td class="s"> my ($u, @v) = @$e;</td></tr>
+<tr><td class="h"><a name="3866"></a>3866</td><td></td><td></td><td></td><td></td><td class="s"> for my $v (@v) {</td></tr>
+<tr><td class="h"><a name="3867"></a>3867</td><td></td><td></td><td></td><td></td><td class="s"> return 1 if $u eq $v;</td></tr>
+<tr><td class="h"><a name="3868"></a>3868</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3869"></a>3869</td><td></td><td></td><td></td><td></td><td class="s"> return 1 if $m && $g->get_edge_count($u, @v) > 1;</td></tr>
+<tr><td class="h"><a name="3870"></a>3870</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3871"></a>3871</td><td></td><td></td><td></td><td></td><td class="s"> return 0;</td></tr>
+<tr><td class="h"><a name="3872"></a>3872</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3873"></a>3873</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3874"></a>3874</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="3875"></a>3875</td><td></td><td></td><td></td><td></td><td class="s"># Rough isomorphism guess.</td></tr>
+<tr><td class="h"><a name="3876"></a>3876</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="3877"></a>3877</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3878"></a>3878</td><td class="c3">1</td><td class="c3"><span title="Avg 2µs">2µs</span></td><td></td><td></td><td class="s">my %_factorial = (0 => 1, 1 => 1);</td></tr>
+<tr><td class="h"><a name="3879"></a>3879</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3880"></a>3880</td><td></td><td></td><td></td><td></td><td class="s">sub __factorial {</td></tr>
+<tr><td class="h"><a name="3881"></a>3881</td><td></td><td></td><td></td><td></td><td class="s"> my $n = shift;</td></tr>
+<tr><td class="h"><a name="3882"></a>3882</td><td></td><td></td><td></td><td></td><td class="s"> for (my $i = 2; $i <= $n; $i++) {</td></tr>
+<tr><td class="h"><a name="3883"></a>3883</td><td></td><td></td><td></td><td></td><td class="s"> next if exists $_factorial{$i};</td></tr>
+<tr><td class="h"><a name="3884"></a>3884</td><td></td><td></td><td></td><td></td><td class="s"> $_factorial{$i} = $i * $_factorial{$i - 1};</td></tr>
+<tr><td class="h"><a name="3885"></a>3885</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3886"></a>3886</td><td></td><td></td><td></td><td></td><td class="s"> $_factorial{$n};</td></tr>
+<tr><td class="h"><a name="3887"></a>3887</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3888"></a>3888</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3889"></a>3889</td><td></td><td></td><td></td><td></td><td class="s">sub _factorial {</td></tr>
+<tr><td class="h"><a name="3890"></a>3890</td><td></td><td></td><td></td><td></td><td class="s"> my $n = int(shift);</td></tr>
+<tr><td class="h"><a name="3891"></a>3891</td><td></td><td></td><td></td><td></td><td class="s"> if ($n < 0) {</td></tr>
+<tr><td class="h"><a name="3892"></a>3892</td><td></td><td></td><td></td><td></td><td class="s"> require Carp;</td></tr>
+<tr><td class="h"><a name="3893"></a>3893</td><td></td><td></td><td></td><td></td><td class="s"> Carp::croak("factorial of a negative number");</td></tr>
+<tr><td class="h"><a name="3894"></a>3894</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3895"></a>3895</td><td></td><td></td><td></td><td></td><td class="s"> __factorial($n) unless exists $_factorial{$n};</td></tr>
+<tr><td class="h"><a name="3896"></a>3896</td><td></td><td></td><td></td><td></td><td class="s"> return $_factorial{$n};</td></tr>
+<tr><td class="h"><a name="3897"></a>3897</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3898"></a>3898</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3899"></a>3899</td><td></td><td></td><td></td><td></td><td class="s">sub could_be_isomorphic {</td></tr>
+<tr><td class="h"><a name="3900"></a>3900</td><td></td><td></td><td></td><td></td><td class="s"> my ($g0, $g1) = @_;</td></tr>
+<tr><td class="h"><a name="3901"></a>3901</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless $g0->vertices == $g1->vertices;</td></tr>
+<tr><td class="h"><a name="3902"></a>3902</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless $g0->edges05 == $g1->edges05;</td></tr>
+<tr><td class="h"><a name="3903"></a>3903</td><td></td><td></td><td></td><td></td><td class="s"> my %d0;</td></tr>
+<tr><td class="h"><a name="3904"></a>3904</td><td></td><td></td><td></td><td></td><td class="s"> for my $v0 ($g0->vertices) {</td></tr>
+<tr><td class="h"><a name="3905"></a>3905</td><td></td><td></td><td></td><td></td><td class="s"> $d0{ $g0->in_degree($v0) }{ $g0->out_degree($v0) }++</td></tr>
+<tr><td class="h"><a name="3906"></a>3906</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3907"></a>3907</td><td></td><td></td><td></td><td></td><td class="s"> my %d1;</td></tr>
+<tr><td class="h"><a name="3908"></a>3908</td><td></td><td></td><td></td><td></td><td class="s"> for my $v1 ($g1->vertices) {</td></tr>
+<tr><td class="h"><a name="3909"></a>3909</td><td></td><td></td><td></td><td></td><td class="s"> $d1{ $g1->in_degree($v1) }{ $g1->out_degree($v1) }++</td></tr>
+<tr><td class="h"><a name="3910"></a>3910</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3911"></a>3911</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless keys %d0 == keys %d1;</td></tr>
+<tr><td class="h"><a name="3912"></a>3912</td><td></td><td></td><td></td><td></td><td class="s"> for my $da (keys %d0) {</td></tr>
+<tr><td class="h"><a name="3913"></a>3913</td><td></td><td></td><td></td><td></td><td class="s"> return 0</td></tr>
+<tr><td class="h"><a name="3914"></a>3914</td><td></td><td></td><td></td><td></td><td class="s"> unless exists $d1{$da} &&</td></tr>
+<tr><td class="h"><a name="3915"></a>3915</td><td></td><td></td><td></td><td></td><td class="s"> keys %{ $d0{$da} } == keys %{ $d1{$da} };</td></tr>
+<tr><td class="h"><a name="3916"></a>3916</td><td></td><td></td><td></td><td></td><td class="s"> for my $db (keys %{ $d0{$da} }) {</td></tr>
+<tr><td class="h"><a name="3917"></a>3917</td><td></td><td></td><td></td><td></td><td class="s"> return 0</td></tr>
+<tr><td class="h"><a name="3918"></a>3918</td><td></td><td></td><td></td><td></td><td class="s"> unless exists $d1{$da}{$db} && </td></tr>
+<tr><td class="h"><a name="3919"></a>3919</td><td></td><td></td><td></td><td></td><td class="s"> $d0{$da}{$db} == $d1{$da}{$db};</td></tr>
+<tr><td class="h"><a name="3920"></a>3920</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3921"></a>3921</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3922"></a>3922</td><td></td><td></td><td></td><td></td><td class="s"> for my $da (keys %d0) {</td></tr>
+<tr><td class="h"><a name="3923"></a>3923</td><td></td><td></td><td></td><td></td><td class="s"> for my $db (keys %{ $d0{$da} }) {</td></tr>
+<tr><td class="h"><a name="3924"></a>3924</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless $d1{$da}{$db} == $d0{$da}{$db};</td></tr>
+<tr><td class="h"><a name="3925"></a>3925</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3926"></a>3926</td><td></td><td></td><td></td><td></td><td class="s"> delete $d1{$da};</td></tr>
+<tr><td class="h"><a name="3927"></a>3927</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3928"></a>3928</td><td></td><td></td><td></td><td></td><td class="s"> return 0 unless keys %d1 == 0;</td></tr>
+<tr><td class="h"><a name="3929"></a>3929</td><td></td><td></td><td></td><td></td><td class="s"> my $f = 1;</td></tr>
+<tr><td class="h"><a name="3930"></a>3930</td><td></td><td></td><td></td><td></td><td class="s"> for my $da (keys %d0) {</td></tr>
+<tr><td class="h"><a name="3931"></a>3931</td><td></td><td></td><td></td><td></td><td class="s"> for my $db (keys %{ $d0{$da} }) {</td></tr>
+<tr><td class="h"><a name="3932"></a>3932</td><td></td><td></td><td></td><td></td><td class="s"> $f *= _factorial(abs($d0{$da}{$db}));</td></tr>
+<tr><td class="h"><a name="3933"></a>3933</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3934"></a>3934</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3935"></a>3935</td><td></td><td></td><td></td><td></td><td class="s"> return $f;</td></tr>
+<tr><td class="h"><a name="3936"></a>3936</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3937"></a>3937</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3938"></a>3938</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="3939"></a>3939</td><td></td><td></td><td></td><td></td><td class="s"># Analysis functions.</td></tr>
+<tr><td class="h"><a name="3940"></a>3940</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3941"></a>3941</td><td></td><td></td><td></td><td></td><td class="s">sub subgraph_by_radius</td></tr>
+<tr><td class="h"><a name="3942"></a>3942</td><td></td><td></td><td></td><td></td><td class="s">{</td></tr>
+<tr><td class="h"><a name="3943"></a>3943</td><td></td><td></td><td></td><td></td><td class="s"> my ($g, $n, $rad) = @_;</td></tr>
+<tr><td class="h"><a name="3944"></a>3944</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3945"></a>3945</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $n && defined $rad && $rad >= 0;</td></tr>
+<tr><td class="h"><a name="3946"></a>3946</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3947"></a>3947</td><td></td><td></td><td></td><td></td><td class="s"> my $r = (ref $g)->new;</td></tr>
+<tr><td class="h"><a name="3948"></a>3948</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3949"></a>3949</td><td></td><td></td><td></td><td></td><td class="s"> if ($rad == 0) {</td></tr>
+<tr><td class="h"><a name="3950"></a>3950</td><td></td><td></td><td></td><td></td><td class="s"> return $r->add_vertex($n);</td></tr>
+<tr><td class="h"><a name="3951"></a>3951</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3952"></a>3952</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3953"></a>3953</td><td></td><td></td><td></td><td></td><td class="s"> my %h;</td></tr>
+<tr><td class="h"><a name="3954"></a>3954</td><td></td><td></td><td></td><td></td><td class="s"> $h{1} = [ [ $n, $g->successors($n) ] ];</td></tr>
+<tr><td class="h"><a name="3955"></a>3955</td><td></td><td></td><td></td><td></td><td class="s"> for my $i (1..$rad) {</td></tr>
+<tr><td class="h"><a name="3956"></a>3956</td><td></td><td></td><td></td><td></td><td class="s"> $h{$i+1} = [];</td></tr>
+<tr><td class="h"><a name="3957"></a>3957</td><td></td><td></td><td></td><td></td><td class="s"> for my $arr (@{ $h{$i} }) {</td></tr>
+<tr><td class="h"><a name="3958"></a>3958</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, @succ) = @{ $arr };</td></tr>
+<tr><td class="h"><a name="3959"></a>3959</td><td></td><td></td><td></td><td></td><td class="s"> for my $s (@succ) {</td></tr>
+<tr><td class="h"><a name="3960"></a>3960</td><td></td><td></td><td></td><td></td><td class="s"> $r->add_edge($p, $s);</td></tr>
+<tr><td class="h"><a name="3961"></a>3961</td><td></td><td></td><td></td><td></td><td class="s"> push(@{ $h{$i+1} }, [$s, $g->successors($s)]) if $i < $rad;</td></tr>
+<tr><td class="h"><a name="3962"></a>3962</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3963"></a>3963</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3964"></a>3964</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3965"></a>3965</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3966"></a>3966</td><td></td><td></td><td></td><td></td><td class="s"> return $r;</td></tr>
+<tr><td class="h"><a name="3967"></a>3967</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="3968"></a>3968</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3969"></a>3969</td><td></td><td></td><td></td><td></td><td class="s">sub clustering_coefficient {</td></tr>
+<tr><td class="h"><a name="3970"></a>3970</td><td></td><td></td><td></td><td></td><td class="s"> my ($g) = @_;</td></tr>
+<tr><td class="h"><a name="3971"></a>3971</td><td></td><td></td><td></td><td></td><td class="s"> my %clustering;</td></tr>
+<tr><td class="h"><a name="3972"></a>3972</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3973"></a>3973</td><td></td><td></td><td></td><td></td><td class="s"> my $gamma = 0;</td></tr>
+<tr><td class="h"><a name="3974"></a>3974</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3975"></a>3975</td><td></td><td></td><td></td><td></td><td class="s"> for my $n ($g->vertices()) {</td></tr>
+<tr><td class="h"><a name="3976"></a>3976</td><td></td><td></td><td></td><td></td><td class="s"> my $gamma_v = 0;</td></tr>
+<tr><td class="h"><a name="3977"></a>3977</td><td></td><td></td><td></td><td></td><td class="s"> my @neigh = $g->successors($n);</td></tr>
+<tr><td class="h"><a name="3978"></a>3978</td><td></td><td></td><td></td><td></td><td class="s"> my %c;</td></tr>
+<tr><td class="h"><a name="3979"></a>3979</td><td></td><td></td><td></td><td></td><td class="s"> for my $u (@neigh) {</td></tr>
+<tr><td class="h"><a name="3980"></a>3980</td><td></td><td></td><td></td><td></td><td class="s"> for my $v (@neigh) {</td></tr>
+<tr><td class="h"><a name="3981"></a>3981</td><td></td><td></td><td></td><td></td><td class="s"> if (!$c{"$u-$v"} && $g->has_edge($u, $v)) {</td></tr>
+<tr><td class="h"><a name="3982"></a>3982</td><td></td><td></td><td></td><td></td><td class="s"> $gamma_v++;</td></tr>
+<tr><td class="h"><a name="3983"></a>3983</td><td></td><td></td><td></td><td></td><td class="s"> $c{"$u-$v"} = 1;</td></tr>
+<tr><td class="h"><a name="3984"></a>3984</td><td></td><td></td><td></td><td></td><td class="s"> $c{"$v-$u"} = 1;</td></tr>
+<tr><td class="h"><a name="3985"></a>3985</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3986"></a>3986</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3987"></a>3987</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3988"></a>3988</td><td></td><td></td><td></td><td></td><td class="s"> if (@neigh > 1) {</td></tr>
+<tr><td class="h"><a name="3989"></a>3989</td><td></td><td></td><td></td><td></td><td class="s"> $clustering{$n} = $gamma_v/(@neigh * (@neigh - 1) / 2);</td></tr>
+<tr><td class="h"><a name="3990"></a>3990</td><td></td><td></td><td></td><td></td><td class="s"> $gamma += $gamma_v/(@neigh * (@neigh - 1) / 2);</td></tr>
+<tr><td class="h"><a name="3991"></a>3991</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="3992"></a>3992</td><td></td><td></td><td></td><td></td><td class="s"> $clustering{$n} = 0;</td></tr>
+<tr><td class="h"><a name="3993"></a>3993</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3994"></a>3994</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="3995"></a>3995</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3996"></a>3996</td><td></td><td></td><td></td><td></td><td class="s"> $gamma /= $g->vertices();</td></tr>
+<tr><td class="h"><a name="3997"></a>3997</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="3998"></a>3998</td><td></td><td></td><td></td><td></td><td class="s"> return wantarray ? ($gamma, %clustering) : $gamma;</td></tr>
+<tr><td class="h"><a name="3999"></a>3999</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="4000"></a>4000</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4001"></a>4001</td><td></td><td></td><td></td><td></td><td class="s">sub betweenness {</td></tr>
+<tr><td class="h"><a name="4002"></a>4002</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="4003"></a>4003</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4004"></a>4004</td><td></td><td></td><td></td><td></td><td class="s"> my @V = $g->vertices();</td></tr>
+<tr><td class="h"><a name="4005"></a>4005</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4006"></a>4006</td><td></td><td></td><td></td><td></td><td class="s"> my %Cb; # C_b{w} = 0</td></tr>
+<tr><td class="h"><a name="4007"></a>4007</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4008"></a>4008</td><td></td><td></td><td></td><td></td><td class="s"> $Cb{$_} = 0 for @V;</td></tr>
+<tr><td class="h"><a name="4009"></a>4009</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4010"></a>4010</td><td></td><td></td><td></td><td></td><td class="s"> for my $s (@V) {</td></tr>
+<tr><td class="h"><a name="4011"></a>4011</td><td></td><td></td><td></td><td></td><td class="s"> my @S; # stack (unshift, shift)</td></tr>
+<tr><td class="h"><a name="4012"></a>4012</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4013"></a>4013</td><td></td><td></td><td></td><td></td><td class="s"> my %P; # P{w} = empty list</td></tr>
+<tr><td class="h"><a name="4014"></a>4014</td><td></td><td></td><td></td><td></td><td class="s"> $P{$_} = [] for @V;</td></tr>
+<tr><td class="h"><a name="4015"></a>4015</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4016"></a>4016</td><td></td><td></td><td></td><td></td><td class="s"> my %sigma; # \sigma{t} = 0</td></tr>
+<tr><td class="h"><a name="4017"></a>4017</td><td></td><td></td><td></td><td></td><td class="s"> $sigma{$_} = 0 for @V;</td></tr>
+<tr><td class="h"><a name="4018"></a>4018</td><td></td><td></td><td></td><td></td><td class="s"> $sigma{$s} = 1;</td></tr>
+<tr><td class="h"><a name="4019"></a>4019</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4020"></a>4020</td><td></td><td></td><td></td><td></td><td class="s"> my %d; # d{t} = -1;</td></tr>
+<tr><td class="h"><a name="4021"></a>4021</td><td></td><td></td><td></td><td></td><td class="s"> $d{$_} = -1 for @V;</td></tr>
+<tr><td class="h"><a name="4022"></a>4022</td><td></td><td></td><td></td><td></td><td class="s"> $d{$s} = 0;</td></tr>
+<tr><td class="h"><a name="4023"></a>4023</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4024"></a>4024</td><td></td><td></td><td></td><td></td><td class="s"> my @Q; # queue (push, shift)</td></tr>
+<tr><td class="h"><a name="4025"></a>4025</td><td></td><td></td><td></td><td></td><td class="s"> push @Q, $s;</td></tr>
+<tr><td class="h"><a name="4026"></a>4026</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4027"></a>4027</td><td></td><td></td><td></td><td></td><td class="s"> while (@Q) {</td></tr>
+<tr><td class="h"><a name="4028"></a>4028</td><td></td><td></td><td></td><td></td><td class="s"> my $v = shift @Q;</td></tr>
+<tr><td class="h"><a name="4029"></a>4029</td><td></td><td></td><td></td><td></td><td class="s"> unshift @S, $v;</td></tr>
+<tr><td class="h"><a name="4030"></a>4030</td><td></td><td></td><td></td><td></td><td class="s"> for my $w ($g->successors($v)) {</td></tr>
+<tr><td class="h"><a name="4031"></a>4031</td><td></td><td></td><td></td><td></td><td class="s"> # w found for first time</td></tr>
+<tr><td class="h"><a name="4032"></a>4032</td><td></td><td></td><td></td><td></td><td class="s"> if ($d{$w} < 0) {</td></tr>
+<tr><td class="h"><a name="4033"></a>4033</td><td></td><td></td><td></td><td></td><td class="s"> push @Q, $w;</td></tr>
+<tr><td class="h"><a name="4034"></a>4034</td><td></td><td></td><td></td><td></td><td class="s"> $d{$w} = $d{$v} + 1;</td></tr>
+<tr><td class="h"><a name="4035"></a>4035</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="4036"></a>4036</td><td></td><td></td><td></td><td></td><td class="s"> # Shortest path to w via v</td></tr>
+<tr><td class="h"><a name="4037"></a>4037</td><td></td><td></td><td></td><td></td><td class="s"> if ($d{$w} == $d{$v} + 1) {</td></tr>
+<tr><td class="h"><a name="4038"></a>4038</td><td></td><td></td><td></td><td></td><td class="s"> $sigma{$w} += $sigma{$v};</td></tr>
+<tr><td class="h"><a name="4039"></a>4039</td><td></td><td></td><td></td><td></td><td class="s"> push @{ $P{$w} }, $v;</td></tr>
+<tr><td class="h"><a name="4040"></a>4040</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="4041"></a>4041</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="4042"></a>4042</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="4043"></a>4043</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4044"></a>4044</td><td></td><td></td><td></td><td></td><td class="s"> my %delta;</td></tr>
+<tr><td class="h"><a name="4045"></a>4045</td><td></td><td></td><td></td><td></td><td class="s"> $delta{$_} = 0 for @V;</td></tr>
+<tr><td class="h"><a name="4046"></a>4046</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4047"></a>4047</td><td></td><td></td><td></td><td></td><td class="s"> while (@S) {</td></tr>
+<tr><td class="h"><a name="4048"></a>4048</td><td></td><td></td><td></td><td></td><td class="s"> my $w = shift @S;</td></tr>
+<tr><td class="h"><a name="4049"></a>4049</td><td></td><td></td><td></td><td></td><td class="s"> for my $v (@{ $P{$w} }) {</td></tr>
+<tr><td class="h"><a name="4050"></a>4050</td><td></td><td></td><td></td><td></td><td class="s"> $delta{$v} += $sigma{$v}/$sigma{$w} * (1 + $delta{$w});</td></tr>
+<tr><td class="h"><a name="4051"></a>4051</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="4052"></a>4052</td><td></td><td></td><td></td><td></td><td class="s"> if ($w ne $s) {</td></tr>
+<tr><td class="h"><a name="4053"></a>4053</td><td></td><td></td><td></td><td></td><td class="s"> $Cb{$w} += $delta{$w};</td></tr>
+<tr><td class="h"><a name="4054"></a>4054</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="4055"></a>4055</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="4056"></a>4056</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="4057"></a>4057</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4058"></a>4058</td><td></td><td></td><td></td><td></td><td class="s"> return %Cb;</td></tr>
+<tr><td class="h"><a name="4059"></a>4059</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="4060"></a>4060</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4061"></a>4061</td><td></td><td></td><td></td><td></td><td class="s">###</td></tr>
+<tr><td class="h"><a name="4062"></a>4062</td><td></td><td></td><td></td><td></td><td class="s"># Debugging.</td></tr>
+<tr><td class="h"><a name="4063"></a>4063</td><td></td><td></td><td></td><td></td><td class="s">#</td></tr>
+<tr><td class="h"><a name="4064"></a>4064</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4065"></a>4065</td><td></td><td></td><td></td><td></td><td class="s">sub _dump {</td></tr>
+<tr><td class="h"><a name="4066"></a>4066</td><td></td><td></td><td></td><td></td><td class="s"> require Data::Dumper;</td></tr>
+<tr><td class="h"><a name="4067"></a>4067</td><td></td><td></td><td></td><td></td><td class="s"> my $d = Data::Dumper->new([$_[0]],[ref $_[0]]);</td></tr>
+<tr><td class="h"><a name="4068"></a>4068</td><td></td><td></td><td></td><td></td><td class="s"> defined wantarray ? $d->Dump : print $d->Dump;</td></tr>
+<tr><td class="h"><a name="4069"></a>4069</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="4070"></a>4070</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="4071"></a>4071</td><td class="c3">1</td><td class="c3"><span title="Avg 80µs">80µs</span></td><td></td><td></td><td class="s">1;</td></tr>
+<tr><td class="s"><a name=""></a> </td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="Graph__CORE_sort"></a></td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 168ms within Graph::CORE:sort which was called 440 times, avg 383µs/call:
+# 236 times (482µs+0s) by Graph::has_edge at <a href="Graph-pm-695-block.html#546">line 546</a>, avg 2µs/call
+# 102 times (168ms+0s) by Graph::stringify at <a href="Graph-pm-695-block.html#102">line 102</a>, avg 1.64ms/call
+# 102 times (184µs+0s) by Graph::stringify at <a href="Graph-pm-695-block.html#103">line 103</a>, avg 2µs/call</div></div>sub Graph::CORE:sort; # opcode<br /> </td></tr>
+</tbody></table></div>
+
+ <script type="text/javascript"> $(document).ready(function() {
+
+ $("#subs_table").tablesorter({
+ sortList: [[3,1]],
+ headers: {
+ 3: { sorter: 'fmt_time' },
+ 4: { sorter: 'fmt_time' }
+ }
+ });
+
+ } ); </script>
+
+ <div class="footer">Report produced by the
+ <a href="http://search.cpan.org/dist/Devel-NYTProf/">NYTProf 4.06</a>
+ Perl profiler, developed by
+ <a href="http://www.linkedin.com/in/timbunce">Tim Bunce</a> and
+ <a href="http://code.nytimes.com">Adam Kaplan</a>.
+ </div>
+ <br /><br /><br /><br /><br /><br /><br /><br /><br /><br />
+ </body></html>
\ No newline at end of file
projects / scpubgit/stemmatology.git / blobdiff