Subroutine Coverage

blib/lib/Graph.pm
Criterion Covered Total %
subroutine 307 307 100.0
pod 195 195 100.0


line count pod subroutine
3 80 n/a BEGIN
4 80 n/a BEGIN
5 80 n/a BEGIN
7 20 n/a __carp_confess
9 80 n/a BEGIN
15 80 n/a BEGIN
26 1 n/a _empty_array
30 20 n/a _can_deep_copy_Storable
51 80 n/a BEGIN
63 44 Yes Infinity
82 80 n/a BEGIN
85 694 Yes stringify
97 295 Yes eq
101 276 Yes boolify
105 11 Yes ne
112 80 n/a BEGIN
115 2682 n/a _opt
123 6 n/a _opt_get
129 1225 n/a _opt_unknown
137 106 n/a _opt_from_existing
145 894 n/a _opt_to_vflags
157 894 n/a _opt_to_eflags
168 894 Yes new
224 889 n/a _make_v
229 889 n/a _make_e
236 1615 n/a _am_light
241 163 n/a _am_heavy
244 1546 Yes countvertexed
245 5557 Yes multivertexed
246 146 Yes refvertexed
247 1 Yes refvertexed_stringified
248 140 n/a __stringified
250 575 Yes countedged
251 37766 Yes multiedged
252 78866 Yes hyperedged
253 47262 Yes undirected
255 21986 Yes directed
269 20888 Yes has_union_find
272 2101 Yes add_vertex
278 2577 Yes has_vertex
285 2571 n/a _vertices05
290 1405 Yes vertices
302 22 Yes has_vertices
307 15519 Yes add_edge
312 69 n/a _vertex_ids_ensure
317 56 n/a _vertex_ids_ensure_multi
324 37839 n/a _vertex_ids
329 285 n/a _vertex_ids_multi
336 37908 n/a _vertex_ids_maybe_ensure
350 19845 Yes has_edge
363 22 Yes any_edge
371 1305 n/a _edges05
380 367 Yes edges
390 7 Yes has_edges
398 14 Yes add_vertex_by_id
409 6 Yes add_vertex_get_id
418 100 Yes has_vertex_by_id
424 4 Yes delete_vertex_by_id
436 14 Yes get_multivertex_ids
442 57 Yes add_edge_by_id
454 13 Yes add_edge_get_id
465 153 Yes has_edge_by_id
475 5 Yes delete_edge_by_id
490 35 Yes get_multiedge_ids
500 189 n/a _edges_at
506 473 n/a _edges_from
513 326 n/a _edges_to
521 12 Yes edges_at
526 284 Yes edges_from
531 246 Yes edges_to
537 25574 Yes successors
546 5047 Yes predecessors
556 166 n/a _cessors_by_radius
574 37 Yes all_successors
580 9 Yes successors_by_radius
586 18 Yes all_predecessors
592 22 Yes predecessors_by_radius
598 26 Yes neighbours_by_radius
604 219 Yes neighbours
612 54 Yes all_neighbours
618 36 Yes all_reachable
622 17 Yes reachable_by_radius
626 455 Yes delete_edge
636 184 Yes delete_vertex
650 63 Yes get_vertex_count
655 970 Yes get_edge_count
662 6 Yes delete_vertices
672 6 Yes delete_edges
686 232 Yes in_degree
695 208 Yes out_degree
704 42 n/a _total_degree
709 38 Yes degree
720 36 Yes is_sink_vertex
725 36 Yes is_source_vertex
730 36 Yes is_successorless_vertex
735 36 Yes is_predecessorless_vertex
740 36 Yes is_successorful_vertex
745 36 Yes is_predecessorful_vertex
750 4676 Yes is_isolated_vertex
755 36 Yes is_interior_vertex
766 36 Yes is_exterior_vertex
771 108 Yes is_self_loop_vertex
788 80 n/a BEGIN
790 779 n/a __ANON__
798 126 Yes add_path
811 4 Yes delete_path
823 20 Yes has_path
834 39 Yes add_cycle
839 2 Yes delete_cycle
845 9 Yes has_cycle
853 17 Yes has_a_cycle
861 2 Yes find_a_cycle
890 80 n/a BEGIN
902 17756 n/a __ANON__
905 206 n/a __ANON__
911 17916 n/a _munge_args
920 4658 n/a _set_attribute
923 80 n/a BEGIN
931 1115 n/a _set_attributes
933 80 n/a BEGIN
941 40 n/a _has_attributes
942 80 n/a BEGIN
950 24 n/a _has_attribute
952 80 n/a BEGIN
960 626 n/a _get_attributes
961 80 n/a BEGIN
969 11453 n/a _get_attribute
970 80 n/a BEGIN
979 12 n/a _get_attribute_names
980 80 n/a BEGIN
988 12 n/a _get_attribute_values
989 80 n/a BEGIN
997 8 n/a _delete_attributes
998 80 n/a BEGIN
1006 12 n/a _delete_attribute
1008 80 n/a BEGIN
1016 2265 Yes add_vertices
1029 17738 Yes add_edges
1050 24 Yes rename_vertex
1056 3 Yes rename_vertices
1064 11 Yes as_hashes
1102 3 Yes ingest
1128 34 Yes copy
1130 80 n/a BEGIN
1140 19 n/a _deep_copy_best
1145 20 n/a _deep_copy_Storable
1150 3 n/a __ANON__
1155 1 n/a _deep_copy_DataDumper
1158 80 n/a BEGIN
1161 1 n/a BEGIN
1161 1 n/a BEGIN
1165 17 Yes deep_copy
1174 481 Yes transpose_edge
1187 20 Yes transpose_graph
1196 9 Yes complete_graph
1211 5 Yes complement_graph
1219 20 Yes subgraph
1237 4 Yes is_transitive
1249 149 n/a _defattr
1253 1 Yes add_weighted_vertex
1259 1 Yes add_weighted_vertices
1268 5 Yes get_vertex_weight
1274 3 Yes has_vertex_weight
1280 1 Yes set_vertex_weight
1286 1 Yes delete_vertex_weight
1292 1 Yes add_weighted_vertex_by_id
1298 1 Yes add_weighted_vertices_by_id
1309 5 Yes get_vertex_weight_by_id
1315 3 Yes has_vertex_weight_by_id
1321 1 Yes set_vertex_weight_by_id
1327 1 Yes delete_vertex_weight_by_id
1337 2548 Yes add_weighted_edge
1343 3 Yes add_weighted_edges
1352 1 Yes add_weighted_edges_by_id
1362 6 Yes add_weighted_path
1373 7 Yes get_edge_weight
1379 3 Yes has_edge_weight
1385 3 Yes set_edge_weight
1391 1 Yes delete_edge_weight
1397 6 Yes add_weighted_edge_by_id
1403 3 Yes add_weighted_path_by_id
1415 8 Yes get_edge_weight_by_id
1421 3 Yes has_edge_weight_by_id
1427 1 Yes set_edge_weight_by_id
1433 1 Yes delete_edge_weight_by_id
1446 43 n/a _expected
1458 10 Yes expect_no_args
1465 1147 Yes expect_undirected
1469 261 Yes expect_directed
1473 3 Yes expect_acyclic
1477 7 Yes expect_dag
1484 11 Yes expect_hyperedged
1488 226 Yes expect_multivertexed
1493 1493 Yes expect_non_multivertexed
1498 18846 Yes expect_non_multiedged
1503 416 Yes expect_multiedged
1508 664 Yes expect_non_unionfind
1512 1098 n/a _get_options
1529 1 n/a __fisher_yates_shuffle
1548 80 n/a BEGIN
1552 14 Yes random_graph
1582 12576 n/a __ANON__
1612 127 Yes random_vertex
1617 31 Yes random_edge
1622 48 Yes random_successor
1627 50 Yes random_predecessor
1638 23 n/a _MST_attr
1649 23 n/a _MST_edges
1658 24 Yes MST_Kruskal
1680 926 n/a _MST_add
1685 241 n/a _next_alphabetic
1686 5 n/a _next_numeric
1687 537 n/a _next_random
1690 150 n/a _root_opt
1724 83 n/a _heap_walk
1752 43 Yes MST_Prim
1768 13 Yes is_acyclic
1772 5 Yes is_dag
1782 5 Yes topological_sort
1800 12 n/a _undirected_copy_compute
1804 63 Yes undirected_copy
1811 3 Yes directed_copy
1835 80 n/a BEGIN
1837 228 n/a __ANON__
1841 2247 n/a _check_cache
1869 40 n/a _connected_components_compute
1893 26 n/a __ANON__
1894 34 n/a __ANON__
1896 97 n/a __ANON__
1909 384 n/a _connected_components
1915 82 Yes connected_component_by_vertex
1920 58 Yes connected_component_by_index
1926 41 Yes connected_components
1931 29 Yes same_connected_components
1946 40 n/a _super_component
1949 21 Yes connected_graph
1964 197 Yes is_connected
1969 10 Yes is_weakly_connected
1977 6 Yes weakly_connected_components
1983 21 Yes weakly_connected_component_by_vertex
1989 15 Yes weakly_connected_component_by_index
1995 8 Yes same_weakly_connected_components
2001 6 Yes weakly_connected_graph
2007 14 n/a _strongly_connected_components_compute
2017 134 n/a __ANON__
2025 248 n/a __ANON__
2036 12 n/a _strongly_connected_components_v2c
2040 18 n/a _strongly_connected_components_arrays
2044 40 n/a _strongly_connected_components
2049 19 Yes strongly_connected_components
2054 5 Yes strongly_connected_component_by_vertex
2059 6 Yes strongly_connected_component_by_index
2066 8 Yes same_strongly_connected_components
2073 4 Yes is_strongly_connected
2079 6 Yes strongly_connected_graph
2098 14895 n/a _biconnectivity_out
2108 17536 n/a _biconnectivity_dfs
2129 252 n/a _biconnectivity_compute
2170 435 Yes biconnectivity
2176 13 Yes is_biconnected
2180 13 Yes is_edge_connected
2184 13 Yes is_edge_separable
2188 248 Yes articulation_points
2194 14 Yes biconnected_components
2198 16 Yes biconnected_component_by_index
2203 2 Yes biconnected_component_by_vertex
2210 5 Yes same_biconnected_components
2218 1 Yes biconnected_graph
2238 23 Yes bridges
2246 1073 n/a _SPT_add
2264 41 n/a _SPT_Dijkstra_compute
2271 81 Yes SPT_Dijkstra
2282 68 Yes SP_Dijkstra
2301 2118 n/a __SPT_Bellman_Ford
2324 11 n/a _SPT_Bellman_Ford
2356 11 n/a _SPT_Bellman_Ford_compute
2370 27 Yes SPT_Bellman_Ford
2378 18 Yes SP_Bellman_Ford
2401 19 Yes TransitiveClosure_Floyd_Warshall
2409 37 Yes APSP_Floyd_Warshall
2417 22 n/a _transitive_closure_matrix_compute
2421 1143 Yes transitive_closure_matrix
2426 1532 Yes path_length
2430 27 Yes path_successor
2434 205 Yes path_vertices
2438 25 Yes all_paths
2442 12103 Yes is_reachable
2446 34 Yes for_shortest_paths
2458 25 n/a _minmax_path
2464 628 n/a __ANON__
2481 15 Yes diameter
2489 5 Yes longest_path
2520 165 Yes vertex_eccentricity
2533 11 Yes shortest_path
2568 17 Yes radius
2579 10 Yes center_vertices
2599 9 Yes average_path_length
2604 809 n/a __ANON__
2619 32 Yes is_multi_graph
2631 32 Yes is_simple_graph
2638 32 Yes is_pseudo_graph
2655 4 n/a __factorial
2664 39 n/a _factorial
2671 31 Yes could_be_isomorphic
2703 17 Yes subgraph_by_radius
2707 2 Yes clustering_coefficient
2739 1 Yes betweenness