python (65.2k questions)

javascript (44.3k questions)

reactjs (22.7k questions)

java (20.8k questions)

c# (17.4k questions)

html (16.3k questions)

r (13.7k questions)

android (13k questions)

Questions - graph-theory

Boost Graph Library: Deleting an edge while using an iterator

Currently I am trying to implement a Girvan Newman Algorithm for a class project using boost graph library in c++. At the moment, edges and vertices are being added fine, but I am having an issue remo...
test-img

Nicole Sood

c++

algorithm

boost

graph-theory

Votes: 0

Answers: 1

Latest Answer

The bigger problem is that you are indexing betweenness by an integer [0, num_edges). This doesn't make a lot of sense unless betweenness is actually an edge centrality map (not the vertex centrality ...
test-img

sehe

Find all Cycles in the Directed Graph including back edges

Given a graph below, find all the possible path from vertex 1 to come back to 1 including back edges. Result: [1,2,3,2,1] [1,2,1] [1,2,3,1] I tried using DFS able to get only...
test-img

Arundhathi D

java

algorithm

graph

graph-theory

depth-first-search

Votes: 0

Answers: 1

Latest Answer

You were close to the answer. In order to detect a cycle in a graph, you need to use the Depth first search algorithm. That's correct. But there are a couple of things in your solution that has to imp...
test-img

Alexander Ivanchenko

Counting 4 and 6-cycles in bipartite R igraph

I want to count the number of four-cycles and the number of six-cycles in a bipartite igraph in R. Adapting the code in r igraph find all cycles, I've come up with this solution: > set.seed(1) >...
test-img

Zachary

r

graph-theory

igraph

cycle

Votes: 0

Answers: 1

Latest Answer

You can count cycles using igraph's subisomorphism functions. For example, counting 5-cycles: set.seed(123) g <- sample_gnm(10,30) > count_subgraph_isomorphisms(make_ring(5), g) [1] 3500 This ...
test-img

Szabolcs

Calculate Total fun from 4 cities . Interview Question DSA round

Given there are cities , and each city has a fun factor associated with it . There is a bidirectional path between cities . Calculate the max total fun by choosing only 4 cities and show the list of c...
test-img

darth_vader

java

algorithm

graph

graph-theory

Votes: 0

Answers: 0

Posts

Questions

Blogs

Jobs