--- /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/AdjacencyMap.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"><a href="Graph-AdjacencyMap-pm-696-block.html">block view</a></span> • <span class="mode_btn"><a href="Graph-AdjacencyMap-pm-696-line.html">line view</a></span> • <span class="mode_btn mode_btn_selected">sub view</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:35:01 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/AdjacencyMap.pm">/Users/edenc/perl5/lib/perl5/Graph/AdjacencyMap.pm</a></td></tr>
+<tr><td class="h">Statements</td><td align="left">Executed 918759 statements in 728ms</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="c0">28776</td><td class="c0">3</td><td class="c3">1</td><td class="c0"><span title="0.4%">212ms</span></td><td class="c0"><span title="0.4%">212ms</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::__get_path_node</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#108">__get_path_node</a></span></td></tr>
+<tr><td class="c0">12664</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.3%">173ms</span></td><td class="c0"><span title="0.4%">214ms</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_set_path_attr</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#199">_set_path_attr</a></span></td></tr>
+<tr><td class="c0">15571</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.3%">155ms</span></td><td class="c0"><span title="0.6%">319ms</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_get_path_attrs</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#230">_get_path_attrs</a></span></td></tr>
+<tr><td class="c0">13196</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.3%">154ms</span></td><td class="c0"><span title="0.6%">300ms</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_has_path_attr</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#180">_has_path_attr</a></span></td></tr>
+<tr><td class="c0">42844</td><td class="c3">1</td><td class="c3">1</td><td class="c0"><span title="0.1%">48.1ms</span></td><td class="c0"><span title="0.1%">48.1ms</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_is_MULTI</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#362">_is_MULTI</a></span></td></tr>
+<tr><td class="c0">12817</td><td class="c1">2</td><td class="c3">1</td><td class="c0"><span title="0.0%">16.5ms</span></td><td class="c0"><span title="0.0%">16.5ms</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_is_UNORD</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#364">_is_UNORD</a></span></td></tr>
+<tr><td class="c0">1249</td><td class="c3">1</td><td class="c3">1</td><td class="c2"><span title="0.0%">4.93ms</span></td><td class="c3"><span title="0.0%">4.93ms</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_new_node</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#77">_new_node</a></span></td></tr>
+<tr><td class="c3">232</td><td class="c1">2</td><td class="c3">1</td><td class="c3"><span title="0.0%">2.51ms</span></td><td class="c3"><span title="0.0%">6.16ms</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_del_id</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#71">_del_id</a></span></td></tr>
+<tr><td class="c3">111</td><td class="c1">2</td><td class="c3">1</td><td class="c3"><span title="0.0%">288µs</span></td><td class="c3"><span title="0.0%">288µs</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_ids</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#56">_ids</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%">134µs</span></td><td class="c3"><span title="0.0%">292µs</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_get_path_attr</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#249">_get_path_attr</a></span></td></tr>
+<tr><td class="c3">154</td><td class="c0">5</td><td class="c3">1</td><td class="c3"><span title="0.0%">97µs</span></td><td class="c3"><span title="0.0%">97µs</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::CORE:sort</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#Graph__AdjacencyMap__CORE_sort">CORE:sort</a> (opcode)</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%">19µs</span></td><td class="c3"><span title="0.0%">19µs</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_new</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#50">_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%">12µs</span></td><td class="c3"><span title="0.0%">14µs</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::BEGIN@3</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.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%">7µs</span></td><td class="c3"><span title="0.0%">51µs</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::BEGIN@6</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#6">BEGIN@6</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µs</span></td><td class="c3"><span title="0.0%">2µs</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_is_COUNT</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#361">_is_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::AdjacencyMap::::_GEN_ID</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#33">_GEN_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::AdjacencyMap::::__arg</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#369">__arg</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_del_path_attr</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#335">_del_path_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::AdjacencyMap::::_del_path_attrs</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#306">_del_path_attrs</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_dump</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#66">_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::AdjacencyMap::::_get_path_attr_names</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#268">_get_path_attr_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::AdjacencyMap::::_get_path_attr_values</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#287">_get_path_attr_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::AdjacencyMap::::_has_path_attrs</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#141">_has_path_attrs</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_inc_node</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#92">_inc_node</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_is_HYPER</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#363">_is_HYPER</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_is_REF</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#366">_is_REF</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_is_STR</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#367">_is_STR</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_is_UNIQ</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#365">_is_UNIQ</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_predecessors</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#399">_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::AdjacencyMap::::_set_path_attrs</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#159">_set_path_attrs</a></span></td></tr>
+<tr><td class="c3">0</td><td class="c3">0</td><td class="c3">0</td><td class="c3"><span title="0.0%">0s</span></td><td class="c3"><span title="0.0%">0s</span></td><td class="sub_name"><span style="display: none;">Graph::AdjacencyMap::::_successors</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#390">_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::AdjacencyMap::::get_multi_ids</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#133">get_multi_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::AdjacencyMap::::has_paths</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#61">has_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::AdjacencyMap::::set_path_by_multi_id</span>Graph::AdjacencyMap::<a href="Graph-AdjacencyMap-pm-696-sub.html#125">set_path_by_multi_id</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-AdjacencyMap-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::AdjacencyMap;</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 15µs">30µs</span></td><td class="c3">2</td><td class="c3">17µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 14µs (12+3) within Graph::AdjacencyMap::BEGIN@3 which was called:
+# once (12µs+3µs) by Graph::BEGIN@13 at <a href="Graph-AdjacencyMap-pm-696-sub.html#3">line 3</a></div></div>use strict;<div class="calls"><div class="calls_out"># spent 14µs making 1 call to <a href="Graph-AdjacencyMap-pm-696-sub.html#3">Graph::AdjacencyMap::BEGIN@3</a>
+# spent 3µs making 1 call to <a href="strict-pm-3-sub.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 class="c3">1</td><td class="c3"><span title="Avg 700ns">700ns</span></td><td></td><td></td><td class="s">require Exporter;</td></tr>
+<tr><td class="h"><a name="6"></a>6</td><td class="c3">2</td><td class="c0"><span title="Avg 1.32ms">2.63ms</span></td><td class="c3">2</td><td class="c3">94µs</td><td class="s"><div class="calls"><div class="calls_in"># spent 51µs (7+44) within Graph::AdjacencyMap::BEGIN@6 which was called:
+# once (7µs+44µs) by Graph::BEGIN@13 at <a href="Graph-AdjacencyMap-pm-696-sub.html#6">line 6</a></div></div>use vars qw(@ISA @EXPORT_OK %EXPORT_TAGS);<div class="calls"><div class="calls_out"># spent 51µs making 1 call to <a href="Graph-AdjacencyMap-pm-696-sub.html#6">Graph::AdjacencyMap::BEGIN@6</a>
+# spent 44µs making 1 call to <a href="vars-pm-6-sub.html#10">vars::import</a></div></div></td></tr>
+<tr><td class="h"><a name="7"></a>7</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">@ISA = qw(Exporter);</td></tr>
+<tr><td class="h"><a name="8"></a>8</td><td class="c3">1</td><td class="c3"><span title="Avg 5µs">5µs</span></td><td></td><td></td><td class="s">@EXPORT_OK = qw(_COUNT _MULTI _COUNTMULTI _GEN_ID</td></tr>
+<tr><td class="h"><a name="9"></a>9</td><td></td><td></td><td></td><td></td><td class="s"> _HYPER _UNORD _UNIQ _REF _UNORDUNIQ _UNIONFIND _LIGHT</td></tr>
+<tr><td class="h"><a name="10"></a>10</td><td></td><td></td><td></td><td></td><td class="s"> _STR _REFSTR</td></tr>
+<tr><td class="h"><a name="11"></a>11</td><td></td><td></td><td></td><td></td><td class="s"> _n _f _a _i _s _p _g _u _ni _nc _na _nm);</td></tr>
+<tr><td class="h"><a name="12"></a>12</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">%EXPORT_TAGS =</td></tr>
+<tr><td class="h"><a name="13"></a>13</td><td></td><td></td><td></td><td></td><td class="s"> (flags => [qw(_COUNT _MULTI _COUNTMULTI _GEN_ID</td></tr>
+<tr><td class="h"><a name="14"></a>14</td><td></td><td></td><td></td><td></td><td class="s"> _HYPER _UNORD _UNIQ _REF _UNORDUNIQ _UNIONFIND _LIGHT</td></tr>
+<tr><td class="h"><a name="15"></a>15</td><td></td><td></td><td></td><td></td><td class="s"> _STR _REFSTR)],</td></tr>
+<tr><td class="h"><a name="16"></a>16</td><td></td><td></td><td></td><td></td><td class="s"> fields => [qw(_n _f _a _i _s _p _g _u _ni _nc _na _nm)]);</td></tr>
+<tr><td class="h"><a name="17"></a>17</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="18"></a>18</td><td></td><td></td><td></td><td></td><td class="s">sub _COUNT () { 0x00000001 }</td></tr>
+<tr><td class="h"><a name="19"></a>19</td><td></td><td></td><td></td><td></td><td class="s">sub _MULTI () { 0x00000002 }</td></tr>
+<tr><td class="h"><a name="20"></a>20</td><td></td><td></td><td></td><td></td><td class="s">sub _COUNTMULTI () { _COUNT|_MULTI }</td></tr>
+<tr><td class="h"><a name="21"></a>21</td><td></td><td></td><td></td><td></td><td class="s">sub _HYPER () { 0x00000004 }</td></tr>
+<tr><td class="h"><a name="22"></a>22</td><td></td><td></td><td></td><td></td><td class="s">sub _UNORD () { 0x00000008 }</td></tr>
+<tr><td class="h"><a name="23"></a>23</td><td></td><td></td><td></td><td></td><td class="s">sub _UNIQ () { 0x00000010 }</td></tr>
+<tr><td class="h"><a name="24"></a>24</td><td></td><td></td><td></td><td></td><td class="s">sub _REF () { 0x00000020 }</td></tr>
+<tr><td class="h"><a name="25"></a>25</td><td></td><td></td><td></td><td></td><td class="s">sub _UNORDUNIQ () { _UNORD|_UNIQ }</td></tr>
+<tr><td class="h"><a name="26"></a>26</td><td></td><td></td><td></td><td></td><td class="s">sub _UNIONFIND () { 0x00000040 }</td></tr>
+<tr><td class="h"><a name="27"></a>27</td><td></td><td></td><td></td><td></td><td class="s">sub _LIGHT () { 0x00000080 }</td></tr>
+<tr><td class="h"><a name="28"></a>28</td><td></td><td></td><td></td><td></td><td class="s">sub _STR () { 0x00000100 }</td></tr>
+<tr><td class="h"><a name="29"></a>29</td><td></td><td></td><td></td><td></td><td class="s">sub _REFSTR () { _REF|_STR }</td></tr>
+<tr><td class="h"><a name="30"></a>30</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="31"></a>31</td><td class="c3">1</td><td class="c3"><span title="Avg 300ns">300ns</span></td><td></td><td></td><td class="s">my $_GEN_ID = 0;</td></tr>
+<tr><td class="h"><a name="32"></a>32</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="33"></a>33</td><td></td><td></td><td></td><td></td><td class="s">sub _GEN_ID () { \$_GEN_ID }</td></tr>
+<tr><td class="h"><a name="34"></a>34</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="35"></a>35</td><td></td><td></td><td></td><td></td><td class="s">sub _ni () { 0 } # Node index.</td></tr>
+<tr><td class="h"><a name="36"></a>36</td><td></td><td></td><td></td><td></td><td class="s">sub _nc () { 1 } # Node count.</td></tr>
+<tr><td class="h"><a name="37"></a>37</td><td></td><td></td><td></td><td></td><td class="s">sub _na () { 2 } # Node attributes.</td></tr>
+<tr><td class="h"><a name="38"></a>38</td><td></td><td></td><td></td><td></td><td class="s">sub _nm () { 3 } # Node map.</td></tr>
+<tr><td class="h"><a name="39"></a>39</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="40"></a>40</td><td></td><td></td><td></td><td></td><td class="s">sub _n () { 0 } # Next id.</td></tr>
+<tr><td class="h"><a name="41"></a>41</td><td></td><td></td><td></td><td></td><td class="s">sub _f () { 1 } # Flags.</td></tr>
+<tr><td class="h"><a name="42"></a>42</td><td></td><td></td><td></td><td></td><td class="s">sub _a () { 2 } # Arity.</td></tr>
+<tr><td class="h"><a name="43"></a>43</td><td></td><td></td><td></td><td></td><td class="s">sub _i () { 3 } # Index to path.</td></tr>
+<tr><td class="h"><a name="44"></a>44</td><td></td><td></td><td></td><td></td><td class="s">sub _s () { 4 } # Successors / Path to Index.</td></tr>
+<tr><td class="h"><a name="45"></a>45</td><td></td><td></td><td></td><td></td><td class="s">sub _p () { 5 } # Predecessors.</td></tr>
+<tr><td class="h"><a name="46"></a>46</td><td></td><td></td><td></td><td></td><td class="s">sub _g () { 6 } # Graph (AdjacencyMap::Light)</td></tr>
+<tr><td class="h"><a name="47"></a>47</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="48"></a>48</td><td></td><td></td><td></td><td></td><td class="s">sub _V () { 2 } # Graph::_V()</td></tr>
+<tr><td class="h"><a name="49"></a>49</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="50"></a>50</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 19µs within Graph::AdjacencyMap::_new which was called 2 times, avg 10µs/call:
+# 2 times (19µs+0s) by Graph::AdjacencyMap::Light::__attr at <a href="Graph-AdjacencyMap-Light-pm-700-sub.html#226">line 226 of Graph/AdjacencyMap/Light.pm</a>, avg 10µs/call</div></div>sub _new {</td></tr>
+<tr><td class="h"><a name="51"></a>51</td><td class="c3">6</td><td class="c3"><span title="Avg 4µs">21µs</span></td><td></td><td></td><td class="s"> my $class = shift;</td></tr>
+<tr><td class="h"><a name="52"></a>52</td><td></td><td></td><td></td><td></td><td class="s"> my $map = bless [ 0, @_ ], $class;</td></tr>
+<tr><td class="h"><a name="53"></a>53</td><td></td><td></td><td></td><td></td><td class="s"> return $map;</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"></td></tr>
+<tr><td class="h"><a name="56"></a>56</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 288µs within Graph::AdjacencyMap::_ids which was called 111 times, avg 3µs/call:
+# 107 times (280µs+0s) by Graph::_edges_at at <a href="Graph-pm-695-sub.html#765">line 765 of Graph.pm</a>, avg 3µs/call
+# 4 times (9µs+0s) by Graph::_edges at <a href="Graph-pm-695-sub.html#794">line 794 of Graph.pm</a>, avg 2µs/call</div></div>sub _ids {</td></tr>
+<tr><td class="h"><a name="57"></a>57</td><td class="c1">222</td><td class="c3"><span title="Avg 1µs">325µs</span></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="58"></a>58</td><td></td><td></td><td></td><td></td><td class="s"> return $m->[ _i ];</td></tr>
+<tr><td class="h"><a name="59"></a>59</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="60"></a>60</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="61"></a>61</td><td></td><td></td><td></td><td></td><td class="s">sub has_paths {</td></tr>
+<tr><td class="h"><a name="62"></a>62</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="63"></a>63</td><td></td><td></td><td></td><td></td><td class="s"> return defined $m->[ _i ] && keys %{ $m->[ _i ] };</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"></td></tr>
+<tr><td class="h"><a name="66"></a>66</td><td></td><td></td><td></td><td></td><td class="s">sub _dump {</td></tr>
+<tr><td class="h"><a name="67"></a>67</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="68"></a>68</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="69"></a>69</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="70"></a>70</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="71"></a>71</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 6.16ms (2.51+3.65) within Graph::AdjacencyMap::_del_id which was called 232 times, avg 27µs/call:
+# 222 times (2.41ms+3.48ms) by Graph::delete_vertex at <a href="Graph-pm-695-sub.html#996">line 996 of Graph.pm</a>, avg 27µs/call
+# 10 times (100µs+167µs) by Graph::delete_edge at <a href="Graph-pm-695-sub.html#984">line 984 of Graph.pm</a>, avg 27µs/call</div></div>sub _del_id {</td></tr>
+<tr><td class="h"><a name="72"></a>72</td><td class="c0">696</td><td class="c0"><span title="Avg 3µs">1.75ms</span></td><td></td><td></td><td class="s"> my ($m, $i) = @_;</td></tr>
+<tr><td class="h"><a name="73"></a>73</td><td></td><td></td><td class="c0">232</td><td class="c0">1.17ms</td><td class="s"> my @p = $m->_get_id_path( $i );<div class="calls"><div class="calls_out"> # spent 1.17ms making 232 calls to <a href="Graph-AdjacencyMap-Light-pm-700-sub.html#124">Graph::AdjacencyMap::Light::_get_id_path</a>, avg 5µs/call</div></div></td></tr>
+<tr><td class="h"><a name="74"></a>74</td><td></td><td></td><td class="c0">232</td><td class="c0">2.48ms</td><td class="s"> $m->del_path( @p ) if @p;<div class="calls"><div class="calls_out"> # spent 2.48ms making 232 calls to <a href="Graph-AdjacencyMap-Light-pm-700-sub.html#131">Graph::AdjacencyMap::Light::del_path</a>, avg 11µs/call</div></div></td></tr>
+<tr><td class="h"><a name="75"></a>75</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="76"></a>76</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="77"></a>77</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 4.93ms within Graph::AdjacencyMap::_new_node which was called 1249 times, avg 4µs/call:
+# 1249 times (4.93ms+0s) by Graph::AdjacencyMap::Heavy::__set_path_node at <a href="Graph-AdjacencyMap-Heavy-pm-697-sub.html#52">line 52 of Graph/AdjacencyMap/Heavy.pm</a>, avg 4µs/call</div></div>sub _new_node {</td></tr>
+<tr><td class="h"><a name="78"></a>78</td><td class="c0">7494</td><td class="c0"><span title="Avg 709ns">5.31ms</span></td><td></td><td></td><td class="s"> my ($m, $n, $id) = @_;</td></tr>
+<tr><td class="h"><a name="79"></a>79</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="80"></a>80</td><td></td><td></td><td></td><td></td><td class="s"> my $i = $m->[ _n ]++;</td></tr>
+<tr><td class="h"><a name="81"></a>81</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _MULTI)) {</td></tr>
+<tr><td class="h"><a name="82"></a>82</td><td></td><td></td><td></td><td></td><td class="s"> $id = 0 if $id eq _GEN_ID;</td></tr>
+<tr><td class="h"><a name="83"></a>83</td><td></td><td></td><td></td><td></td><td class="s"> $$n = [ $i, 0, undef, { $id => { } } ];</td></tr>
+<tr><td class="h"><a name="84"></a>84</td><td></td><td></td><td></td><td></td><td class="s"> } elsif (($f & _COUNT)) {</td></tr>
+<tr><td class="h"><a name="85"></a>85</td><td></td><td></td><td></td><td></td><td class="s"> $$n = [ $i, 1 ];</td></tr>
+<tr><td class="h"><a name="86"></a>86</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="87"></a>87</td><td></td><td></td><td></td><td></td><td class="s"> $$n = $i;</td></tr>
+<tr><td class="h"><a name="88"></a>88</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="89"></a>89</td><td></td><td></td><td></td><td></td><td class="s"> return $i;</td></tr>
+<tr><td class="h"><a name="90"></a>90</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="91"></a>91</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="92"></a>92</td><td></td><td></td><td></td><td></td><td class="s">sub _inc_node {</td></tr>
+<tr><td class="h"><a name="93"></a>93</td><td></td><td></td><td></td><td></td><td class="s"> my ($m, $n, $id) = @_;</td></tr>
+<tr><td class="h"><a name="94"></a>94</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="95"></a>95</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _MULTI)) {</td></tr>
+<tr><td class="h"><a name="96"></a>96</td><td></td><td></td><td></td><td></td><td class="s"> if ($id eq _GEN_ID) {</td></tr>
+<tr><td class="h"><a name="97"></a>97</td><td></td><td></td><td></td><td></td><td class="s"> $$n->[ _nc ]++</td></tr>
+<tr><td class="h"><a name="98"></a>98</td><td></td><td></td><td></td><td></td><td class="s"> while exists $$n->[ _nm ]->{ $$n->[ _nc ] };</td></tr>
+<tr><td class="h"><a name="99"></a>99</td><td></td><td></td><td></td><td></td><td class="s"> $id = $$n->[ _nc ];</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"> $$n->[ _nm ]->{ $id } = { };</td></tr>
+<tr><td class="h"><a name="102"></a>102</td><td></td><td></td><td></td><td></td><td class="s"> } elsif (($f & _COUNT)) {</td></tr>
+<tr><td class="h"><a name="103"></a>103</td><td></td><td></td><td></td><td></td><td class="s"> $$n->[ _nc ]++;</td></tr>
+<tr><td class="h"><a name="104"></a>104</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="105"></a>105</td><td></td><td></td><td></td><td></td><td class="s"> return $id;</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"></td></tr>
+<tr><td class="h"><a name="108"></a>108</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 212ms (212+7µs) within Graph::AdjacencyMap::__get_path_node which was called 28776 times, avg 7µs/call:
+# 15571 times (110ms+0s) by Graph::AdjacencyMap::_get_path_attrs at <a href="Graph-AdjacencyMap-pm-696-sub.html#242">line 242</a>, avg 7µs/call
+# 13196 times (102ms+4µs) by Graph::AdjacencyMap::_has_path_attr at <a href="Graph-AdjacencyMap-pm-696-sub.html#193">line 193</a>, avg 8µs/call
+# 9 times (78µs+3µs) by Graph::AdjacencyMap::_get_path_attr at <a href="Graph-AdjacencyMap-pm-696-sub.html#262">line 262</a>, avg 9µs/call</div></div>sub __get_path_node {</td></tr>
+<tr><td class="h"><a name="109"></a>109</td><td class="c0">316536</td><td class="c0"><span title="Avg 664ns">210ms</span></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="110"></a>110</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, $k);</td></tr>
+<tr><td class="h"><a name="111"></a>111</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="112"></a>112</td><td></td><td></td><td class="c3">18</td><td class="c3">7µs</td><td class="s"> @_ = sort @_ if ($f & _UNORD);<div class="calls"><div class="calls_out"> # spent 7µs making 18 calls to <a href="Graph-AdjacencyMap-pm-696-sub.html#Graph__AdjacencyMap__CORE_sort">Graph::AdjacencyMap::CORE:sort</a>, avg 372ns/call</div></div></td></tr>
+<tr><td class="h"><a name="113"></a>113</td><td></td><td></td><td></td><td></td><td class="s"> if ($m->[ _a ] == 2 && @_ == 2 && !($f & (_HYPER|_REF|_UNIQ))) { # Fast path.</td></tr>
+<tr><td class="h"><a name="114"></a>114</td><td></td><td></td><td></td><td></td><td class="s"> return unless exists $m->[ _s ]->{ $_[0] };</td></tr>
+<tr><td class="h"><a name="115"></a>115</td><td></td><td></td><td></td><td></td><td class="s"> $p = [ $m->[ _s ], $m->[ _s ]->{ $_[0] } ];</td></tr>
+<tr><td class="h"><a name="116"></a>116</td><td></td><td></td><td></td><td></td><td class="s"> $k = [ $_[0], $_[1] ];</td></tr>
+<tr><td class="h"><a name="117"></a>117</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="118"></a>118</td><td></td><td></td><td></td><td></td><td class="s"> ($p, $k) = $m->__has_path( @_ );</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"> return unless defined $p && defined $k;</td></tr>
+<tr><td class="h"><a name="121"></a>121</td><td></td><td></td><td></td><td></td><td class="s"> my $l = defined $k->[-1] ? $k->[-1] : "";</td></tr>
+<tr><td class="h"><a name="122"></a>122</td><td></td><td></td><td></td><td></td><td class="s"> return ( exists $p->[-1]->{ $l }, $p->[-1]->{ $l }, $p, $k, $l );</td></tr>
+<tr><td class="h"><a name="123"></a>123</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="124"></a>124</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="125"></a>125</td><td></td><td></td><td></td><td></td><td class="s">sub set_path_by_multi_id {</td></tr>
+<tr><td class="h"><a name="126"></a>126</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="127"></a>127</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, $k) = $m->__set_path( @_ );</td></tr>
+<tr><td class="h"><a name="128"></a>128</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p && defined $k;</td></tr>
+<tr><td class="h"><a name="129"></a>129</td><td></td><td></td><td></td><td></td><td class="s"> my $l = defined $k->[-1] ? $k->[-1] : "";</td></tr>
+<tr><td class="h"><a name="130"></a>130</td><td></td><td></td><td></td><td></td><td class="s"> return $m->__set_path_node( $p, $l, @_ );</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">sub get_multi_ids {</td></tr>
+<tr><td class="h"><a name="134"></a>134</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="135"></a>135</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="136"></a>136</td><td></td><td></td><td></td><td></td><td class="s"> return () unless ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="137"></a>137</td><td></td><td></td><td></td><td></td><td class="s"> my ($e, $n) = $m->__get_path_node( @_ );</td></tr>
+<tr><td class="h"><a name="138"></a>138</td><td></td><td></td><td></td><td></td><td class="s"> return $e ? keys %{ $n->[ _nm ] } : ();</td></tr>
+<tr><td class="h"><a name="139"></a>139</td><td></td><td></td><td></td><td></td><td class="s">}</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">sub _has_path_attrs {</td></tr>
+<tr><td class="h"><a name="142"></a>142</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="143"></a>143</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="144"></a>144</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop if ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="145"></a>145</td><td></td><td></td><td></td><td></td><td class="s"> @_ = sort @_ if ($f & _UNORD);</td></tr>
+<tr><td class="h"><a name="146"></a>146</td><td></td><td></td><td></td><td></td><td class="s"> $m->__attr( \@_ );</td></tr>
+<tr><td class="h"><a name="147"></a>147</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _MULTI)) {</td></tr>
+<tr><td class="h"><a name="148"></a>148</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, $k) = $m->__has_path( @_ );</td></tr>
+<tr><td class="h"><a name="149"></a>149</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p && defined $k;</td></tr>
+<tr><td class="h"><a name="150"></a>150</td><td></td><td></td><td></td><td></td><td class="s"> my $l = defined $k->[-1] ? $k->[-1] : "";</td></tr>
+<tr><td class="h"><a name="151"></a>151</td><td></td><td></td><td></td><td></td><td class="s"> return keys %{ $p->[-1]->{ $l }->[ _nm ]->{ $id } } ? 1 : 0;</td></tr>
+<tr><td class="h"><a name="152"></a>152</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="153"></a>153</td><td></td><td></td><td></td><td></td><td class="s"> my ($e, $n) = $m->__get_path_node( @_ );</td></tr>
+<tr><td class="h"><a name="154"></a>154</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless $e;</td></tr>
+<tr><td class="h"><a name="155"></a>155</td><td></td><td></td><td></td><td></td><td class="s"> return ref $n && $#$n == _na && keys %{ $n->[ _na ] } ? 1 : 0;</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">sub _set_path_attrs {</td></tr>
+<tr><td class="h"><a name="160"></a>160</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="161"></a>161</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="162"></a>162</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="163"></a>163</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop if ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="164"></a>164</td><td></td><td></td><td></td><td></td><td class="s"> @_ = sort @_ if ($f & _UNORD);</td></tr>
+<tr><td class="h"><a name="165"></a>165</td><td></td><td></td><td></td><td></td><td class="s"> $m->__attr( @_ );</td></tr>
+<tr><td class="h"><a name="166"></a>166</td><td></td><td></td><td></td><td></td><td class="s"> push @_, $id if ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="167"></a>167</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, $k) = $m->__set_path( @_ );</td></tr>
+<tr><td class="h"><a name="168"></a>168</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p && defined $k;</td></tr>
+<tr><td class="h"><a name="169"></a>169</td><td></td><td></td><td></td><td></td><td class="s"> my $l = defined $k->[-1] ? $k->[-1] : "";</td></tr>
+<tr><td class="h"><a name="170"></a>170</td><td></td><td></td><td></td><td></td><td class="s"> $m->__set_path_node( $p, $l, @_ ) unless exists $p->[-1]->{ $l };</td></tr>
+<tr><td class="h"><a name="171"></a>171</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _MULTI)) {</td></tr>
+<tr><td class="h"><a name="172"></a>172</td><td></td><td></td><td></td><td></td><td class="s"> $p->[-1]->{ $l }->[ _nm ]->{ $id } = $attr;</td></tr>
+<tr><td class="h"><a name="173"></a>173</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="174"></a>174</td><td></td><td></td><td></td><td></td><td class="s"> # Extend the node if it is a simple id node.</td></tr>
+<tr><td class="h"><a name="175"></a>175</td><td></td><td></td><td></td><td></td><td class="s"> $p->[-1]->{ $l } = [ $p->[-1]->{ $l }, 1 ] unless ref $p->[-1]->{ $l };</td></tr>
+<tr><td class="h"><a name="176"></a>176</td><td></td><td></td><td></td><td></td><td class="s"> $p->[-1]->{ $l }->[ _na ] = $attr;</td></tr>
+<tr><td class="h"><a name="177"></a>177</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="178"></a>178</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="179"></a>179</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="180"></a>180</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 300ms (154+146) within Graph::AdjacencyMap::_has_path_attr which was called 13196 times, avg 23µs/call:
+# 13196 times (154ms+146ms) by Graph::has_edge_attribute at <a href="Graph-pm-695-sub.html#1519">line 1519 of Graph.pm</a>, avg 23µs/call</div></div>sub _has_path_attr {</td></tr>
+<tr><td class="h"><a name="181"></a>181</td><td class="c0">131960</td><td class="c0"><span title="Avg 949ns">125ms</span></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="182"></a>182</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="183"></a>183</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="184"></a>184</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop if ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="185"></a>185</td><td></td><td></td><td class="c3">9</td><td class="c3">7µs</td><td class="s"> @_ = sort @_ if ($f & _UNORD);<div class="calls"><div class="calls_out"> # spent 7µs making 9 calls to <a href="Graph-AdjacencyMap-pm-696-sub.html#Graph__AdjacencyMap__CORE_sort">Graph::AdjacencyMap::CORE:sort</a>, avg 744ns/call</div></div></td></tr>
+<tr><td class="h"><a name="186"></a>186</td><td></td><td></td><td class="c0">13196</td><td class="c0">43.8ms</td><td class="s"> $m->__attr( \@_ );<div class="calls"><div class="calls_out"> # spent 43.8ms making 13196 calls to <a href="Graph-AdjacencyMap-Heavy-pm-697-sub.html#175">Graph::AdjacencyMap::Heavy::__attr</a>, avg 3µs/call</div></div></td></tr>
+<tr><td class="h"><a name="187"></a>187</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _MULTI)) {</td></tr>
+<tr><td class="h"><a name="188"></a>188</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, $k) = $m->__has_path( @_ );</td></tr>
+<tr><td class="h"><a name="189"></a>189</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p && defined $k;</td></tr>
+<tr><td class="h"><a name="190"></a>190</td><td></td><td></td><td></td><td></td><td class="s"> my $l = defined $k->[-1] ? $k->[-1] : "";</td></tr>
+<tr><td class="h"><a name="191"></a>191</td><td></td><td></td><td></td><td></td><td class="s"> exists $p->[-1]->{ $l }->[ _nm ]->{ $id }->{ $attr };</td></tr>
+<tr><td class="h"><a name="192"></a>192</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="193"></a>193</td><td></td><td></td><td class="c0">13196</td><td class="c0">102ms</td><td class="s"> my ($e, $n) = $m->__get_path_node( @_ );<div class="calls"><div class="calls_out"> # spent 102ms making 13196 calls to <a href="Graph-AdjacencyMap-pm-696-sub.html#108">Graph::AdjacencyMap::__get_path_node</a>, avg 8µs/call</div></div></td></tr>
+<tr><td class="h"><a name="194"></a>194</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless $e;</td></tr>
+<tr><td class="h"><a name="195"></a>195</td><td></td><td></td><td></td><td></td><td class="s"> return ref $n && $#$n == _na ? exists $n->[ _na ]->{ $attr } : undef;</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"></td></tr>
+<tr><td class="h"><a name="199"></a>199</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 214ms (173+40.7) within Graph::AdjacencyMap::_set_path_attr which was called 12664 times, avg 17µs/call:
+# 12664 times (173ms+40.7ms) by Graph::set_edge_attribute at <a href="Graph-pm-695-sub.html#1469">line 1469 of Graph.pm</a>, avg 17µs/call</div></div>sub _set_path_attr {</td></tr>
+<tr><td class="h"><a name="200"></a>200</td><td class="c0">265944</td><td class="c0"><span title="Avg 521ns">138ms</span></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="201"></a>201</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="202"></a>202</td><td></td><td></td><td></td><td></td><td class="s"> my $val = pop;</td></tr>
+<tr><td class="h"><a name="203"></a>203</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="204"></a>204</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop if ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="205"></a>205</td><td></td><td></td><td class="c3">59</td><td class="c3">51µs</td><td class="s"> @_ = sort @_ if ($f & _UNORD);<div class="calls"><div class="calls_out"> # spent 51µs making 59 calls to <a href="Graph-AdjacencyMap-pm-696-sub.html#Graph__AdjacencyMap__CORE_sort">Graph::AdjacencyMap::CORE:sort</a>, avg 866ns/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"> my ($p, $k);</td></tr>
+<tr><td class="h"><a name="207"></a>207</td><td></td><td></td><td class="c0">12664</td><td class="c0">40.6ms</td><td class="s"> $m->__attr( \@_ ); # _LIGHT maps need this to get upgraded when needed.<div class="calls"><div class="calls_out"> # spent 40.1ms making 12662 calls to <a href="Graph-AdjacencyMap-Heavy-pm-697-sub.html#175">Graph::AdjacencyMap::Heavy::__attr</a>, avg 3µs/call
+ # spent 446µs making 2 calls to <a href="Graph-AdjacencyMap-Light-pm-700-sub.html#214">Graph::AdjacencyMap::Light::__attr</a>, avg 223µs/call</div></div></td></tr>
+<tr><td class="h"><a name="208"></a>208</td><td></td><td></td><td></td><td></td><td class="s"> push @_, $id if ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="209"></a>209</td><td></td><td></td><td class="c3">59</td><td class="c3">26µs</td><td class="s"> @_ = sort @_ if ($f & _UNORD);<div class="calls"><div class="calls_out"> # spent 26µs making 59 calls to <a href="Graph-AdjacencyMap-pm-696-sub.html#Graph__AdjacencyMap__CORE_sort">Graph::AdjacencyMap::CORE:sort</a>, avg 439ns/call</div></div></td></tr>
+<tr><td class="h"><a name="210"></a>210</td><td></td><td></td><td></td><td></td><td class="s"> if ($m->[ _a ] == 2 && @_ == 2 && !($f & (_REF|_UNIQ|_HYPER|_UNIQ))) {</td></tr>
+<tr><td class="h"><a name="211"></a>211</td><td></td><td></td><td></td><td></td><td class="s"> $m->[ _s ]->{ $_[0] } ||= { };</td></tr>
+<tr><td class="h"><a name="212"></a>212</td><td></td><td></td><td></td><td></td><td class="s"> $p = [ $m->[ _s ], $m->[ _s ]->{ $_[0] } ];</td></tr>
+<tr><td class="h"><a name="213"></a>213</td><td></td><td></td><td></td><td></td><td class="s"> $k = [ $_[0], $_[1] ];</td></tr>
+<tr><td class="h"><a name="214"></a>214</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="215"></a>215</td><td></td><td></td><td></td><td></td><td class="s"> ($p, $k) = $m->__set_path( @_ );</td></tr>
+<tr><td class="h"><a name="216"></a>216</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="217"></a>217</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p && defined $k;</td></tr>
+<tr><td class="h"><a name="218"></a>218</td><td></td><td></td><td></td><td></td><td class="s"> my $l = defined $k->[-1] ? $k->[-1] : "";</td></tr>
+<tr><td class="h"><a name="219"></a>219</td><td></td><td></td><td></td><td></td><td class="s"> $m->__set_path_node( $p, $l, @_ ) unless exists $p->[-1]->{ $l };</td></tr>
+<tr><td class="h"><a name="220"></a>220</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _MULTI)) {</td></tr>
+<tr><td class="h"><a name="221"></a>221</td><td></td><td></td><td></td><td></td><td class="s"> $p->[-1]->{ $l }->[ _nm ]->{ $id }->{ $attr } = $val;</td></tr>
+<tr><td class="h"><a name="222"></a>222</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="223"></a>223</td><td></td><td></td><td></td><td></td><td class="s"> # Extend the node if it is a simple id node.</td></tr>
+<tr><td class="h"><a name="224"></a>224</td><td></td><td></td><td></td><td></td><td class="s"> $p->[-1]->{ $l } = [ $p->[-1]->{ $l }, 1 ] unless ref $p->[-1]->{ $l };</td></tr>
+<tr><td class="h"><a name="225"></a>225</td><td></td><td></td><td></td><td></td><td class="s"> $p->[-1]->{ $l }->[ _na ]->{ $attr } = $val;</td></tr>
+<tr><td class="h"><a name="226"></a>226</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="227"></a>227</td><td></td><td></td><td></td><td></td><td class="s"> return $val;</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"></td></tr>
+<tr><td class="h"><a name="230"></a>230</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 319ms (155+164) within Graph::AdjacencyMap::_get_path_attrs which was called 15571 times, avg 20µs/call:
+# 15571 times (155ms+164ms) by Graph::get_edge_attributes at <a href="Graph-pm-695-sub.html#1535">line 1535 of Graph.pm</a>, avg 20µs/call</div></div>sub _get_path_attrs {</td></tr>
+<tr><td class="h"><a name="231"></a>231</td><td class="c0">140139</td><td class="c0"><span title="Avg 896ns">126ms</span></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="232"></a>232</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="233"></a>233</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop if ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="234"></a>234</td><td></td><td></td><td></td><td></td><td class="s"> @_ = sort @_ if ($f & _UNORD);</td></tr>
+<tr><td class="h"><a name="235"></a>235</td><td></td><td></td><td class="c0">15571</td><td class="c0">54.1ms</td><td class="s"> $m->__attr( \@_ );<div class="calls"><div class="calls_out"> # spent 54.1ms making 15571 calls to <a href="Graph-AdjacencyMap-Heavy-pm-697-sub.html#175">Graph::AdjacencyMap::Heavy::__attr</a>, avg 3µs/call</div></div></td></tr>
+<tr><td class="h"><a name="236"></a>236</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _MULTI)) {</td></tr>
+<tr><td class="h"><a name="237"></a>237</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, $k) = $m->__has_path( @_ );</td></tr>
+<tr><td class="h"><a name="238"></a>238</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p && defined $k;</td></tr>
+<tr><td class="h"><a name="239"></a>239</td><td></td><td></td><td></td><td></td><td class="s"> my $l = defined $k->[-1] ? $k->[-1] : "";</td></tr>
+<tr><td class="h"><a name="240"></a>240</td><td></td><td></td><td></td><td></td><td class="s"> $p->[-1]->{ $l }->[ _nm ]->{ $id };</td></tr>
+<tr><td class="h"><a name="241"></a>241</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="242"></a>242</td><td></td><td></td><td class="c0">15571</td><td class="c0">110ms</td><td class="s"> my ($e, $n) = $m->__get_path_node( @_ );<div class="calls"><div class="calls_out"> # spent 110ms making 15571 calls to <a href="Graph-AdjacencyMap-pm-696-sub.html#108">Graph::AdjacencyMap::__get_path_node</a>, avg 7µs/call</div></div></td></tr>
+<tr><td class="h"><a name="243"></a>243</td><td></td><td></td><td></td><td></td><td class="s"> return unless $e;</td></tr>
+<tr><td class="h"><a name="244"></a>244</td><td></td><td></td><td></td><td></td><td class="s"> return $n->[ _na ] if ref $n && $#$n == _na;</td></tr>
+<tr><td class="h"><a name="245"></a>245</td><td></td><td></td><td></td><td></td><td class="s"> return;</td></tr>
+<tr><td class="h"><a name="246"></a>246</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="247"></a>247</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="248"></a>248</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="249"></a>249</td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 292µs (134+158) within Graph::AdjacencyMap::_get_path_attr which was called 9 times, avg 32µs/call:
+# 9 times (134µs+158µs) by Graph::get_edge_attribute at <a href="Graph-pm-695-sub.html#1571">line 1571 of Graph.pm</a>, avg 32µs/call</div></div>sub _get_path_attr {</td></tr>
+<tr><td class="h"><a name="250"></a>250</td><td class="c3">90</td><td class="c3"><span title="Avg 1µs">130µs</span></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="251"></a>251</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="252"></a>252</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="253"></a>253</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop if ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="254"></a>254</td><td></td><td></td><td class="c3">9</td><td class="c3">6µs</td><td class="s"> @_ = sort @_ if ($f & _UNORD);<div class="calls"><div class="calls_out"> # spent 6µs making 9 calls to <a href="Graph-AdjacencyMap-pm-696-sub.html#Graph__AdjacencyMap__CORE_sort">Graph::AdjacencyMap::CORE:sort</a>, avg 711ns/call</div></div></td></tr>
+<tr><td class="h"><a name="255"></a>255</td><td></td><td></td><td class="c3">9</td><td class="c3">70µs</td><td class="s"> $m->__attr( \@_ );<div class="calls"><div class="calls_out"> # spent 70µs making 9 calls to <a href="Graph-AdjacencyMap-Heavy-pm-697-sub.html#175">Graph::AdjacencyMap::Heavy::__attr</a>, avg 8µs/call</div></div></td></tr>
+<tr><td class="h"><a name="256"></a>256</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _MULTI)) {</td></tr>
+<tr><td class="h"><a name="257"></a>257</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, $k) = $m->__has_path( @_ );</td></tr>
+<tr><td class="h"><a name="258"></a>258</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p && defined $k;</td></tr>
+<tr><td class="h"><a name="259"></a>259</td><td></td><td></td><td></td><td></td><td class="s"> my $l = defined $k->[-1] ? $k->[-1] : "";</td></tr>
+<tr><td class="h"><a name="260"></a>260</td><td></td><td></td><td></td><td></td><td class="s"> return $p->[-1]->{ $l }->[ _nm ]->{ $id }->{ $attr };</td></tr>
+<tr><td class="h"><a name="261"></a>261</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="262"></a>262</td><td></td><td></td><td class="c3">9</td><td class="c3">81µs</td><td class="s"> my ($e, $n) = $m->__get_path_node( @_ );<div class="calls"><div class="calls_out"> # spent 81µs making 9 calls to <a href="Graph-AdjacencyMap-pm-696-sub.html#108">Graph::AdjacencyMap::__get_path_node</a>, avg 9µs/call</div></div></td></tr>
+<tr><td class="h"><a name="263"></a>263</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless $e;</td></tr>
+<tr><td class="h"><a name="264"></a>264</td><td></td><td></td><td></td><td></td><td class="s"> return ref $n && $#$n == _na ? $n->[ _na ]->{ $attr } : undef;</td></tr>
+<tr><td class="h"><a name="265"></a>265</td><td></td><td></td><td></td><td></td><td class="s"> }</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">sub _get_path_attr_names {</td></tr>
+<tr><td class="h"><a name="269"></a>269</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="270"></a>270</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="271"></a>271</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop if ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="272"></a>272</td><td></td><td></td><td></td><td></td><td class="s"> @_ = sort @_ if ($f & _UNORD);</td></tr>
+<tr><td class="h"><a name="273"></a>273</td><td></td><td></td><td></td><td></td><td class="s"> $m->__attr( \@_ );</td></tr>
+<tr><td class="h"><a name="274"></a>274</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _MULTI)) {</td></tr>
+<tr><td class="h"><a name="275"></a>275</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, $k) = $m->__has_path( @_ );</td></tr>
+<tr><td class="h"><a name="276"></a>276</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p && defined $k;</td></tr>
+<tr><td class="h"><a name="277"></a>277</td><td></td><td></td><td></td><td></td><td class="s"> my $l = defined $k->[-1] ? $k->[-1] : "";</td></tr>
+<tr><td class="h"><a name="278"></a>278</td><td></td><td></td><td></td><td></td><td class="s"> keys %{ $p->[-1]->{ $l }->[ _nm ]->{ $id } };</td></tr>
+<tr><td class="h"><a name="279"></a>279</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="280"></a>280</td><td></td><td></td><td></td><td></td><td class="s"> my ($e, $n) = $m->__get_path_node( @_ );</td></tr>
+<tr><td class="h"><a name="281"></a>281</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless $e;</td></tr>
+<tr><td class="h"><a name="282"></a>282</td><td></td><td></td><td></td><td></td><td class="s"> return keys %{ $n->[ _na ] } if ref $n && $#$n == _na;</td></tr>
+<tr><td class="h"><a name="283"></a>283</td><td></td><td></td><td></td><td></td><td class="s"> return;</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"></td></tr>
+<tr><td class="h"><a name="287"></a>287</td><td></td><td></td><td></td><td></td><td class="s">sub _get_path_attr_values {</td></tr>
+<tr><td class="h"><a name="288"></a>288</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="289"></a>289</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="290"></a>290</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop if ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="291"></a>291</td><td></td><td></td><td></td><td></td><td class="s"> @_ = sort @_ if ($f & _UNORD);</td></tr>
+<tr><td class="h"><a name="292"></a>292</td><td></td><td></td><td></td><td></td><td class="s"> $m->__attr( \@_ );</td></tr>
+<tr><td class="h"><a name="293"></a>293</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _MULTI)) {</td></tr>
+<tr><td class="h"><a name="294"></a>294</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, $k) = $m->__has_path( @_ );</td></tr>
+<tr><td class="h"><a name="295"></a>295</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p && defined $k;</td></tr>
+<tr><td class="h"><a name="296"></a>296</td><td></td><td></td><td></td><td></td><td class="s"> my $l = defined $k->[-1] ? $k->[-1] : "";</td></tr>
+<tr><td class="h"><a name="297"></a>297</td><td></td><td></td><td></td><td></td><td class="s"> values %{ $p->[-1]->{ $l }->[ _nm ]->{ $id } };</td></tr>
+<tr><td class="h"><a name="298"></a>298</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="299"></a>299</td><td></td><td></td><td></td><td></td><td class="s"> my ($e, $n) = $m->__get_path_node( @_ );</td></tr>
+<tr><td class="h"><a name="300"></a>300</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless $e;</td></tr>
+<tr><td class="h"><a name="301"></a>301</td><td></td><td></td><td></td><td></td><td class="s"> return values %{ $n->[ _na ] } if ref $n && $#$n == _na;</td></tr>
+<tr><td class="h"><a name="302"></a>302</td><td></td><td></td><td></td><td></td><td class="s"> return;</td></tr>
+<tr><td class="h"><a name="303"></a>303</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="304"></a>304</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="305"></a>305</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="306"></a>306</td><td></td><td></td><td></td><td></td><td class="s">sub _del_path_attrs {</td></tr>
+<tr><td class="h"><a name="307"></a>307</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="308"></a>308</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="309"></a>309</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop if ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="310"></a>310</td><td></td><td></td><td></td><td></td><td class="s"> @_ = sort @_ if ($f & _UNORD);</td></tr>
+<tr><td class="h"><a name="311"></a>311</td><td></td><td></td><td></td><td></td><td class="s"> $m->__attr( \@_ );</td></tr>
+<tr><td class="h"><a name="312"></a>312</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _MULTI)) {</td></tr>
+<tr><td class="h"><a name="313"></a>313</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, $k) = $m->__has_path( @_ );</td></tr>
+<tr><td class="h"><a name="314"></a>314</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p && defined $k;</td></tr>
+<tr><td class="h"><a name="315"></a>315</td><td></td><td></td><td></td><td></td><td class="s"> my $l = defined $k->[-1] ? $k->[-1] : "";</td></tr>
+<tr><td class="h"><a name="316"></a>316</td><td></td><td></td><td></td><td></td><td class="s"> delete $p->[-1]->{ $l }->[ _nm ]->{ $id };</td></tr>
+<tr><td class="h"><a name="317"></a>317</td><td></td><td></td><td></td><td></td><td class="s"> unless (keys %{ $p->[-1]->{ $l }->[ _nm ] } ||</td></tr>
+<tr><td class="h"><a name="318"></a>318</td><td></td><td></td><td></td><td></td><td class="s"> (defined $p->[-1]->{ $l }->[ _na ] &&</td></tr>
+<tr><td class="h"><a name="319"></a>319</td><td></td><td></td><td></td><td></td><td class="s"> keys %{ $p->[-1]->{ $l }->[ _na ] })) {</td></tr>
+<tr><td class="h"><a name="320"></a>320</td><td></td><td></td><td></td><td></td><td class="s"> delete $p->[-1]->{ $l };</td></tr>
+<tr><td class="h"><a name="321"></a>321</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="322"></a>322</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="323"></a>323</td><td></td><td></td><td></td><td></td><td class="s"> my ($e, $n) = $m->__get_path_node( @_ );</td></tr>
+<tr><td class="h"><a name="324"></a>324</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless $e;</td></tr>
+<tr><td class="h"><a name="325"></a>325</td><td></td><td></td><td></td><td></td><td class="s"> if (ref $n) {</td></tr>
+<tr><td class="h"><a name="326"></a>326</td><td></td><td></td><td></td><td></td><td class="s"> $e = _na == $#$n && keys %{ $n->[ _na ] } ? 1 : 0;</td></tr>
+<tr><td class="h"><a name="327"></a>327</td><td></td><td></td><td></td><td></td><td class="s"> $#$n = _na - 1;</td></tr>
+<tr><td class="h"><a name="328"></a>328</td><td></td><td></td><td></td><td></td><td class="s"> return $e;</td></tr>
+<tr><td class="h"><a name="329"></a>329</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="330"></a>330</td><td></td><td></td><td></td><td></td><td class="s"> return 0;</td></tr>
+<tr><td class="h"><a name="331"></a>331</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="332"></a>332</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="333"></a>333</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="334"></a>334</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="335"></a>335</td><td></td><td></td><td></td><td></td><td class="s">sub _del_path_attr {</td></tr>
+<tr><td class="h"><a name="336"></a>336</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="337"></a>337</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="338"></a>338</td><td></td><td></td><td></td><td></td><td class="s"> my $attr = pop;</td></tr>
+<tr><td class="h"><a name="339"></a>339</td><td></td><td></td><td></td><td></td><td class="s"> my $id = pop if ($f & _MULTI);</td></tr>
+<tr><td class="h"><a name="340"></a>340</td><td></td><td></td><td></td><td></td><td class="s"> @_ = sort @_ if ($f & _UNORD);</td></tr>
+<tr><td class="h"><a name="341"></a>341</td><td></td><td></td><td></td><td></td><td class="s"> $m->__attr( \@_ );</td></tr>
+<tr><td class="h"><a name="342"></a>342</td><td></td><td></td><td></td><td></td><td class="s"> if (($f & _MULTI)) {</td></tr>
+<tr><td class="h"><a name="343"></a>343</td><td></td><td></td><td></td><td></td><td class="s"> my ($p, $k) = $m->__has_path( @_ );</td></tr>
+<tr><td class="h"><a name="344"></a>344</td><td></td><td></td><td></td><td></td><td class="s"> return unless defined $p && defined $k;</td></tr>
+<tr><td class="h"><a name="345"></a>345</td><td></td><td></td><td></td><td></td><td class="s"> my $l = defined $k->[-1] ? $k->[-1] : "";</td></tr>
+<tr><td class="h"><a name="346"></a>346</td><td></td><td></td><td></td><td></td><td class="s"> delete $p->[-1]->{ $l }->[ _nm ]->{ $id }->{ $attr };</td></tr>
+<tr><td class="h"><a name="347"></a>347</td><td></td><td></td><td></td><td></td><td class="s"> $m->_del_path_attrs( @_, $id )</td></tr>
+<tr><td class="h"><a name="348"></a>348</td><td></td><td></td><td></td><td></td><td class="s"> unless keys %{ $p->[-1]->{ $l }->[ _nm ]->{ $id } };</td></tr>
+<tr><td class="h"><a name="349"></a>349</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="350"></a>350</td><td></td><td></td><td></td><td></td><td class="s"> my ($e, $n) = $m->__get_path_node( @_ );</td></tr>
+<tr><td class="h"><a name="351"></a>351</td><td></td><td></td><td></td><td></td><td class="s"> return undef unless $e;</td></tr>
+<tr><td class="h"><a name="352"></a>352</td><td></td><td></td><td></td><td></td><td class="s"> if (ref $n && $#$n == _na && exists $n->[ _na ]->{ $attr }) {</td></tr>
+<tr><td class="h"><a name="353"></a>353</td><td></td><td></td><td></td><td></td><td class="s"> delete $n->[ _na ]->{ $attr };</td></tr>
+<tr><td class="h"><a name="354"></a>354</td><td></td><td></td><td></td><td></td><td class="s"> return 1;</td></tr>
+<tr><td class="h"><a name="355"></a>355</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="356"></a>356</td><td></td><td></td><td></td><td></td><td class="s"> return 0;</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></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="359"></a>359</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="360"></a>360</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="361"></a>361</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"><div class="calls"><div class="calls_in"># spent 2µs within Graph::AdjacencyMap::_is_COUNT which was called:
+# once (2µs+0s) by Graph::countedged at <a href="Graph-pm-695-sub.html#337">line 337 of Graph.pm</a></div></div>sub _is_COUNT { $_[0]->[ _f ] & _COUNT }</td></tr>
+<tr><td class="h"><a name="362"></a>362</td><td class="c0">42844</td><td class="c0"><span title="Avg 2µs">88.5ms</span></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 48.1ms within Graph::AdjacencyMap::_is_MULTI which was called 42844 times, avg 1µs/call:
+# 42844 times (48.1ms+0s) by Graph::multiedged at <a href="Graph-pm-695-sub.html#338">line 338 of Graph.pm</a>, avg 1µs/call</div></div>sub _is_MULTI { $_[0]->[ _f ] & _MULTI }</td></tr>
+<tr><td class="h"><a name="363"></a>363</td><td></td><td></td><td></td><td></td><td class="s">sub _is_HYPER { $_[0]->[ _f ] & _HYPER }</td></tr>
+<tr><td class="h"><a name="364"></a>364</td><td class="c0">12817</td><td class="c0"><span title="Avg 2µs">29.5ms</span></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 16.5ms within Graph::AdjacencyMap::_is_UNORD which was called 12817 times, avg 1µs/call:
+# 12766 times (16.3ms+0s) by Graph::omniedged at <a href="Graph-pm-695-sub.html#340">line 340 of Graph.pm</a>, avg 1µs/call
+# 51 times (137µs+0s) by Graph::directed at <a href="Graph-pm-695-sub.html#345">line 345 of Graph.pm</a>, avg 3µs/call</div></div>sub _is_UNORD { $_[0]->[ _f ] & _UNORD }</td></tr>
+<tr><td class="h"><a name="365"></a>365</td><td></td><td></td><td></td><td></td><td class="s">sub _is_UNIQ { $_[0]->[ _f ] & _UNIQ }</td></tr>
+<tr><td class="h"><a name="366"></a>366</td><td></td><td></td><td></td><td></td><td class="s">sub _is_REF { $_[0]->[ _f ] & _REF }</td></tr>
+<tr><td class="h"><a name="367"></a>367</td><td></td><td></td><td></td><td></td><td class="s">sub _is_STR { $_[0]->[ _f ] & _STR }</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">sub __arg {</td></tr>
+<tr><td class="h"><a name="370"></a>370</td><td></td><td></td><td></td><td></td><td class="s"> my $m = shift;</td></tr>
+<tr><td class="h"><a name="371"></a>371</td><td></td><td></td><td></td><td></td><td class="s"> my $f = $m->[ _f ];</td></tr>
+<tr><td class="h"><a name="372"></a>372</td><td></td><td></td><td></td><td></td><td class="s"> my @a = @{$_[0]};</td></tr>
+<tr><td class="h"><a name="373"></a>373</td><td></td><td></td><td></td><td></td><td class="s"> if ($f & _UNIQ) {</td></tr>
+<tr><td class="h"><a name="374"></a>374</td><td></td><td></td><td></td><td></td><td class="s"> my %u;</td></tr>
+<tr><td class="h"><a name="375"></a>375</td><td></td><td></td><td></td><td></td><td class="s"> if ($f & _UNORD) {</td></tr>
+<tr><td class="h"><a name="376"></a>376</td><td></td><td></td><td></td><td></td><td class="s"> @u{ @a } = @a;</td></tr>
+<tr><td class="h"><a name="377"></a>377</td><td></td><td></td><td></td><td></td><td class="s"> @a = values %u;</td></tr>
+<tr><td class="h"><a name="378"></a>378</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="379"></a>379</td><td></td><td></td><td></td><td></td><td class="s"> my @u;</td></tr>
+<tr><td class="h"><a name="380"></a>380</td><td></td><td></td><td></td><td></td><td class="s"> for my $e (@a) {</td></tr>
+<tr><td class="h"><a name="381"></a>381</td><td></td><td></td><td></td><td></td><td class="s"> push @u, $e if $u{$e}++ == 0;</td></tr>
+<tr><td class="h"><a name="382"></a>382</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="383"></a>383</td><td></td><td></td><td></td><td></td><td class="s"> @a = @u;</td></tr>
+<tr><td class="h"><a name="384"></a>384</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="385"></a>385</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="386"></a>386</td><td></td><td></td><td></td><td></td><td class="s"> # Alphabetic or numeric sort, does not matter as long as it unifies.</td></tr>
+<tr><td class="h"><a name="387"></a>387</td><td></td><td></td><td></td><td></td><td class="s"> @{$_[0]} = ($f & _UNORD) ? sort @a : @a;</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">sub _successors {</td></tr>
+<tr><td class="h"><a name="391"></a>391</td><td></td><td></td><td></td><td></td><td class="s"> my $E = shift;</td></tr>
+<tr><td class="h"><a name="392"></a>392</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="393"></a>393</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="394"></a>394</td><td></td><td></td><td></td><td></td><td class="s"> map { my @v = @{ $_->[ 1 ] };</td></tr>
+<tr><td class="h"><a name="395"></a>395</td><td></td><td></td><td></td><td></td><td class="s"> shift @v;</td></tr>
+<tr><td class="h"><a name="396"></a>396</td><td></td><td></td><td></td><td></td><td class="s"> map { $V->_get_id_path($_) } @v } $g->_edges_from( @_ );</td></tr>
+<tr><td class="h"><a name="397"></a>397</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="398"></a>398</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="399"></a>399</td><td></td><td></td><td></td><td></td><td class="s">sub _predecessors {</td></tr>
+<tr><td class="h"><a name="400"></a>400</td><td></td><td></td><td></td><td></td><td class="s"> my $E = shift;</td></tr>
+<tr><td class="h"><a name="401"></a>401</td><td></td><td></td><td></td><td></td><td class="s"> my $g = shift;</td></tr>
+<tr><td class="h"><a name="402"></a>402</td><td></td><td></td><td></td><td></td><td class="s"> my $V = $g->[ _V ];</td></tr>
+<tr><td class="h"><a name="403"></a>403</td><td></td><td></td><td></td><td></td><td class="s"> if (wantarray) {</td></tr>
+<tr><td class="h"><a name="404"></a>404</td><td></td><td></td><td></td><td></td><td class="s"> map { my @v = @{ $_->[ 1 ] };</td></tr>
+<tr><td class="h"><a name="405"></a>405</td><td></td><td></td><td></td><td></td><td class="s"> pop @v;</td></tr>
+<tr><td class="h"><a name="406"></a>406</td><td></td><td></td><td></td><td></td><td class="s"> map { $V->_get_id_path($_) } @v } $g->_edges_to( @_ );</td></tr>
+<tr><td class="h"><a name="407"></a>407</td><td></td><td></td><td></td><td></td><td class="s"> } else {</td></tr>
+<tr><td class="h"><a name="408"></a>408</td><td></td><td></td><td></td><td></td><td class="s"> return $g->_edges_to( @_ );</td></tr>
+<tr><td class="h"><a name="409"></a>409</td><td></td><td></td><td></td><td></td><td class="s"> }</td></tr>
+<tr><td class="h"><a name="410"></a>410</td><td></td><td></td><td></td><td></td><td class="s">}</td></tr>
+<tr><td class="h"><a name="411"></a>411</td><td></td><td></td><td></td><td></td><td class="s"></td></tr>
+<tr><td class="h"><a name="412"></a>412</td><td class="c3">1</td><td class="c3"><span title="Avg 20µs">20µs</span></td><td></td><td></td><td class="s">1;</td></tr>
+<tr><td class="h"><a name="413"></a>413</td><td></td><td></td><td></td><td></td><td class="s">__END__</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__AdjacencyMap__CORE_sort"></a></td><td></td><td></td><td></td><td></td><td class="s"><div class="calls"><div class="calls_in"># spent 97µs within Graph::AdjacencyMap::CORE:sort which was called 154 times, avg 629ns/call:
+# 59 times (51µs+0s) by Graph::AdjacencyMap::_set_path_attr at <a href="Graph-AdjacencyMap-pm-696-sub.html#205">line 205</a>, avg 866ns/call
+# 59 times (26µs+0s) by Graph::AdjacencyMap::_set_path_attr at <a href="Graph-AdjacencyMap-pm-696-sub.html#209">line 209</a>, avg 439ns/call
+# 18 times (7µs+0s) by Graph::AdjacencyMap::__get_path_node at <a href="Graph-AdjacencyMap-pm-696-sub.html#112">line 112</a>, avg 372ns/call
+# 9 times (7µs+0s) by Graph::AdjacencyMap::_has_path_attr at <a href="Graph-AdjacencyMap-pm-696-sub.html#185">line 185</a>, avg 744ns/call
+# 9 times (6µs+0s) by Graph::AdjacencyMap::_get_path_attr at <a href="Graph-AdjacencyMap-pm-696-sub.html#254">line 254</a>, avg 711ns/call</div></div>sub Graph::AdjacencyMap::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