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 3 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 625 Yes stringify
97 298 Yes eq
101 276 Yes boolify
105 11 Yes ne
112 80 n/a BEGIN
115 2691 n/a _opt
123 6 n/a _opt_get
129 1228 n/a _opt_unknown
137 106 n/a _opt_from_existing
145 897 n/a _opt_to_vflags
157 897 n/a _opt_to_eflags
168 897 Yes new
224 892 n/a _make_v
229 892 n/a _make_e
236 1621 n/a _am_light
241 163 n/a _am_heavy
244 1294 Yes countvertexed
245 5307 Yes multivertexed
246 146 Yes refvertexed
247 1 Yes refvertexed_stringified
248 140 n/a __stringified
250 575 Yes countedged
251 38000 Yes multiedged
252 79221 Yes hyperedged
253 47459 Yes undirected
255 22130 Yes directed
269 20974 Yes has_union_find
272 2101 Yes add_vertex
278 2659 Yes has_vertex
285 2249 n/a _vertices05
290 1153 Yes vertices
302 22 Yes has_vertices
307 15555 Yes add_edge
312 69 n/a _vertex_ids_ensure
317 56 n/a _vertex_ids_ensure_multi
324 38120 n/a _vertex_ids
329 285 n/a _vertex_ids_multi
336 38189 n/a _vertex_ids_maybe_ensure
350 19981 Yes has_edge
363 22 Yes any_edge
371 1236 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 476 n/a _edges_from
513 326 n/a _edges_to
521 12 Yes edges_at
526 287 Yes edges_from
531 246 Yes edges_to
537 8090 Yes successors
546 5063 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 468 Yes delete_edge
636 184 Yes delete_vertex
650 63 Yes get_vertex_count
655 975 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 4694 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 710 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 17882 n/a __ANON__
905 206 n/a __ANON__
911 18042 n/a _munge_args
920 4695 n/a _set_attribute
923 80 n/a BEGIN
931 1114 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 631 n/a _get_attributes
961 80 n/a BEGIN
969 11538 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 2268 Yes add_vertices
1029 17808 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 486 Yes transpose_edge
1187 20 Yes transpose_graph
1196 9 Yes complete_graph
1211 5 Yes complement_graph
1219 23 Yes subgraph
1246 4 Yes is_transitive
1258 149 n/a _defattr
1262 1 Yes add_weighted_vertex
1268 1 Yes add_weighted_vertices
1277 5 Yes get_vertex_weight
1283 3 Yes has_vertex_weight
1289 1 Yes set_vertex_weight
1295 1 Yes delete_vertex_weight
1301 1 Yes add_weighted_vertex_by_id
1307 1 Yes add_weighted_vertices_by_id
1318 5 Yes get_vertex_weight_by_id
1324 3 Yes has_vertex_weight_by_id
1330 1 Yes set_vertex_weight_by_id
1336 1 Yes delete_vertex_weight_by_id
1346 2585 Yes add_weighted_edge
1352 3 Yes add_weighted_edges
1361 1 Yes add_weighted_edges_by_id
1371 6 Yes add_weighted_path
1382 7 Yes get_edge_weight
1388 3 Yes has_edge_weight
1394 3 Yes set_edge_weight
1400 1 Yes delete_edge_weight
1406 6 Yes add_weighted_edge_by_id
1412 3 Yes add_weighted_path_by_id
1424 8 Yes get_edge_weight_by_id
1430 3 Yes has_edge_weight_by_id
1436 1 Yes set_edge_weight_by_id
1442 1 Yes delete_edge_weight_by_id
1455 43 n/a _expected
1467 10 Yes expect_no_args
1474 1183 Yes expect_undirected
1478 261 Yes expect_directed
1482 3 Yes expect_acyclic
1486 7 Yes expect_dag
1493 11 Yes expect_hyperedged
1497 226 Yes expect_multivertexed
1502 1492 Yes expect_non_multivertexed
1507 19010 Yes expect_non_multiedged
1512 416 Yes expect_multiedged
1517 677 Yes expect_non_unionfind
1521 1101 n/a _get_options
1538 1 n/a __fisher_yates_shuffle
1557 80 n/a BEGIN
1561 14 Yes random_graph
1591 12069 n/a __ANON__
1621 126 Yes random_vertex
1626 31 Yes random_edge
1631 49 Yes random_successor
1636 48 Yes random_predecessor
1647 23 n/a _MST_attr
1658 23 n/a _MST_edges
1667 24 Yes MST_Kruskal
1689 926 n/a _MST_add
1694 246 n/a _next_alphabetic
1695 5 n/a _next_numeric
1696 544 n/a _next_random
1699 150 n/a _root_opt
1733 83 n/a _heap_walk
1761 43 Yes MST_Prim
1777 13 Yes is_acyclic
1781 5 Yes is_dag
1791 5 Yes topological_sort
1809 12 n/a _undirected_copy_compute
1813 63 Yes undirected_copy
1820 3 Yes directed_copy
1844 80 n/a BEGIN
1846 228 n/a __ANON__
1850 2283 n/a _check_cache
1878 40 n/a _connected_components_compute
1902 26 n/a __ANON__
1903 34 n/a __ANON__
1905 97 n/a __ANON__
1918 384 n/a _connected_components
1924 82 Yes connected_component_by_vertex
1929 58 Yes connected_component_by_index
1935 41 Yes connected_components
1940 29 Yes same_connected_components
1955 40 n/a _super_component
1958 21 Yes connected_graph
1973 197 Yes is_connected
1978 10 Yes is_weakly_connected
1986 6 Yes weakly_connected_components
1992 21 Yes weakly_connected_component_by_vertex
1998 15 Yes weakly_connected_component_by_index
2004 8 Yes same_weakly_connected_components
2010 6 Yes weakly_connected_graph
2016 14 n/a _strongly_connected_components_compute
2026 136 n/a __ANON__
2034 255 n/a __ANON__
2045 12 n/a _strongly_connected_components_v2c
2049 18 n/a _strongly_connected_components_arrays
2053 40 n/a _strongly_connected_components
2058 19 Yes strongly_connected_components
2063 5 Yes strongly_connected_component_by_vertex
2068 6 Yes strongly_connected_component_by_index
2075 8 Yes same_strongly_connected_components
2082 4 Yes is_strongly_connected
2088 6 Yes strongly_connected_graph
2107 14931 n/a _biconnectivity_out
2117 17608 n/a _biconnectivity_dfs
2137 288 n/a _biconnectivity_compute
2180 471 Yes biconnectivity
2186 13 Yes is_biconnected
2190 13 Yes is_edge_connected
2194 13 Yes is_edge_separable
2198 248 Yes articulation_points
2204 14 Yes biconnected_components
2208 16 Yes biconnected_component_by_index
2213 2 Yes biconnected_component_by_vertex
2222 5 Yes same_biconnected_components
2232 1 Yes biconnected_graph
2252 59 Yes bridges
2260 1073 n/a _SPT_add
2278 41 n/a _SPT_Dijkstra_compute
2285 81 Yes SPT_Dijkstra
2296 68 Yes SP_Dijkstra
2315 2118 n/a __SPT_Bellman_Ford
2338 11 n/a _SPT_Bellman_Ford
2370 11 n/a _SPT_Bellman_Ford_compute
2384 27 Yes SPT_Bellman_Ford
2392 18 Yes SP_Bellman_Ford
2415 19 Yes TransitiveClosure_Floyd_Warshall
2423 37 Yes APSP_Floyd_Warshall
2431 22 n/a _transitive_closure_matrix_compute
2435 1143 Yes transitive_closure_matrix
2440 1532 Yes path_length
2444 27 Yes path_successor
2448 205 Yes path_vertices
2452 25 Yes all_paths
2456 12724 Yes is_reachable
2460 34 Yes for_shortest_paths
2472 25 n/a _minmax_path
2478 628 n/a __ANON__
2495 15 Yes diameter
2503 5 Yes longest_path
2534 165 Yes vertex_eccentricity
2547 11 Yes shortest_path
2582 17 Yes radius
2593 10 Yes center_vertices
2613 9 Yes average_path_length
2618 809 n/a __ANON__
2633 32 Yes is_multi_graph
2645 32 Yes is_simple_graph
2652 32 Yes is_pseudo_graph
2669 4 n/a __factorial
2678 39 n/a _factorial
2685 31 Yes could_be_isomorphic
2717 17 Yes subgraph_by_radius
2721 2 Yes clustering_coefficient
2753 1 Yes betweenness