georgios-ts

Add Left-Right Planarity test.

7

This commit implements a new function `is_planar` that checks if an undirected graph can be drawn in a plane without any edge intersections. The planarity check algorithm is based on...

Expand graph operations

3

### What is the expected enhancement? Graph operations (https://en.wikipedia.org/wiki/Graph_operations) produce new graphs from initial ones. Right now retworkx can `compose`, take the `union` of two graphs or return the `complement`...

Add Stoer Wagner min cut algorithm.

6

This commits adds a new function `stoer_wagner_min_cut` that computes a minimum cut for weighted undirected graphs.

Add `is_semiconnected` function.

1

### What is the expected enhancement? A graph is semiconnected if, and only if, for any pair of nodes, either one is reachable from the other, or they are mutually...

### What is the expected enhancement? Recently a new function that calculates the `betweenness_centrality` was added (https://qiskit.org/documentation/retworkx/api.html#centrality). We can add similar measures like - `edge_betweenness_centrality` https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.centrality.edge_betweenness_centrality.html#networkx.algorithms.centrality.edge_betweenness_centrality, or - `closeness_centrality` https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.centrality.closeness_centrality.html#networkx.algorithms.centrality.closeness_centrality