-
### Description
Write a function to check if a cycle exists in an undirected graph.
### Language
C++
### Deliverables
- Code
- Comments for better understanding
@akshitagit can I work on t…
-
I would like to propose an extension of the k-components algorithm currently implemented in NetworkX for undirected graphs to also work with directed graphs. This extension would be based on the conce…
-
Hello,
I am very interested in the filtering module of your work!
As you mentioned in your description module, the input of the filtering modules follows:
"the each line as an edge seperated by…
-
I'm working for this in C++ :)
-
There are various use cases of graphs where it's relevant to extract a minimum cost spanning arborescence (equivalent of minimum spanning tree for undirected weighted graphs).
For example in my ca…
-
From a suggestion by dcoudert ([#24634 comment:10](https://github.com/sagemath/sage/issues/24634#comment:10)):
Let's move some of the methods that are actually only valid for undirected graphs from …
-
Hi, i need your help.
1) When i read your paper. I saw you said: "All the graphs are undirected and preprocessed to have self-loops to speed up training". Besides, you also can said: "we propose to u…
-
`igraph_all_st_mincuts` and `igraph_all_st_cuts` are only implemented for directed graphs. It would be nice to implement them for undirected ones too.
Am I mistaken that converting the undirected g…
-
http://link.springer.com/chapter/10.1007/978-3-642-04031-3_34#page-1
-
1. Обновить свою ветку по main.
2. Создать файл source/graph_view_un_el.cpp
3. В нём определить класс ogxx::Graph_view_undirected_edge_list: public ogxx::Graph_view.
4. В данный класс в качестве по…