Custom Query (14 matches)
| Ticket | Summary | Cc | Status | Owner | Type | Priority |
|---|---|---|---|---|---|---|
| #7304 | Contract edge in graph | brunellus, lkeough | needs_info | rlm | enhancement | major |
| #12387 | Everything is not well with dense graph backends | brunellus, rlm | new | jason, ncohen, rlm | defect | major |
| #6236 | find the dual graph of a planar graph | brunellus | new | rlm | enhancement | major |
| #1941 | Finish bipartite graph implementation | brunellus | new | rlm | defect | major |
| #8423 | fractals: add code to plot julia sets | ncohen, brunellus | new | sdietzel | enhancement | minor |
| #2266 | give shortest_paths an optional endpoint | jason, mvngu, brunellus | new | rlm | enhancement | minor |
| #8744 | Improve add_edge in BipartiteGraph to make it independent from the current coloring | rhinton, brunellus | new | jason, ncohen, rlm | enhancement | major |
| #13112 | inconsistency calling functions for weighted graphs | brunellus | new | jason, ncohen, rlm | enhancement | major |
| #9807 | merge_vertices behavior in a graph with loops | brunellus | new | jason, ncohen, rlm | defect | minor |
| #9136 | more named graphs | brunellus | new | jason, ncohen, rlm | enhancement | major |
| #9831 | Permutation(list) should check its input (?) | brunellus | needs_work | sage-combinat | defect | major |
| #4854 | represent paths as lists of edges | brunellus | needs_info | rlm | enhancement | major |
| #13730 | Speed up some graph iterations | azi, ncohen, slani, brunellus | needs_work | jason, ncohen, rlm | enhancement | major |
| #10015 | Support hyperreals and/or surreal numbers | brunellus, kini | new | AlexGhitza | enhancement | minor |
Note: See TracQuery
for help on using queries.
