Create app.py

app.py

@@ -0,0 +1,61 @@
+import streamlit as st
+import graphviz
+import random
+import gurobipy as gp
+from gurobipy import GRB
+
+
+def generate_random_graph(V: int, density: float) -> tuple[int, list[tuple[int, int]]]:
+    E = [(u, v) for u in range(V - 1) for v in range(u + 1, V)]
+    random.shuffle(E)
+    E = E[:int(density * V * (V - 1) / 2)]
+    return V, E
+
+
+def solve_matching(V: int, E: list[tuple[int, int]]) -> list[tuple[int, int]]:
+    m = gp.Model()
+    x = m.addVars(E, vtype=GRB.BINARY)
+    
+    m.setObjective(x.sum(), GRB.MAXIMIZE)
+    m.addConstrs(x.sum(u, '*') + x.sum('*', u) <= 1 for u in range(V))
+    
+    m.optimize()
+    
+    matching = []
+    for e in E:
+        if x[e].x > 0.5:
+            matching.append(e)
+
+    return matching
+
+
+def main():
+    V = st.number_input('Number of vertices', min_value=1, value=10)
+    density = st.slider('Density', min_value=0.0, max_value=1.0, value=0.5)
+    st.button('Generate')
+
+    V, E = generate_random_graph(V, density)
+
+    if len(E) > 40:
+        st.warning('Too many edges to display')
+        return
+
+    M = set(solve_matching(V, E))
+
+    if len(M) == V // 2:
+        st.success('Perfect matching found')
+    else:
+        st.metric('Matching size', len(M))
+
+    G = graphviz.Graph()
+    for u, v in E:
+        if (u, v) in M:
+            G.edge(str(u), str(v), color='red')
+        else:
+            G.edge(str(u), str(v), color='gray', style='dashed')
+
+    st.graphviz_chart(G)
+
+
+if __name__ == '__main__':
+    main()