Return Distinct edges from edge array of multiple graphs >>> sorted(get_distinct_edge(edge_array)) ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h']
(edge_array)
| 25 | |
| 26 | |
| 27 | def get_distinct_edge(edge_array): |
| 28 | """ |
| 29 | Return Distinct edges from edge array of multiple graphs |
| 30 | >>> sorted(get_distinct_edge(edge_array)) |
| 31 | ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h'] |
| 32 | """ |
| 33 | distinct_edge = set() |
| 34 | for row in edge_array: |
| 35 | for item in row: |
| 36 | distinct_edge.add(item[0]) |
| 37 | return list(distinct_edge) |
| 38 | |
| 39 | |
| 40 | def get_bitcode(edge_array, distinct_edge): |
no test coverage detected