# Tagged Questions

**2**

votes

**1**answer

489 views

### number of totally different path between two nodes in graph theory

I have an undirected, unweighted graph representing a network.
I have a starting node and an end one.
My 'network' is reliable if there is no node such that without that node s and t are not reachable ...

**9**

votes

**5**answers

23k views

### Finding all paths on undirected graph

I have an undirected, unweighted graph, and I'm trying to come up with an algorithm that, given 2 unique nodes on the graph, will find all paths connecting the two nodes, not including cycles. Here's ...

**2**

votes

**4**answers

9k views

### Difference between connected vs strongly connected vs complete graphs [closed]

What is the difference between
connected
strongly-connected and
complete?
My understanding is:
connected: you can get to every vertex from every other vertex.
strongly connected: every vertex ...