# code which counts the number of edges

How to write a code which counts the number of edges from a one vertex to another vertex in a directed bipartite graph?

code which counts the number of edges

1

Following up on vdelecroix's comment above, here's an example:

```
sage: G=graphs.PathGraph(5)
sage: G.distance(2,4)
2
```

Asked: **
2013-03-28 08:20:38 -0500
**

Seen: **101 times**

Last updated: **Mar 31 '13**

Counting paths in directed graph with multiedges

How to recognise DiGraph equivalence

How to find the path of the maximal distance between two vertices on a complete digraph?

plot digraph use adjacency matrix

.plot() displaying cycle graphs as huge pretzels

Using a lambda expression in digraphs fails for len(G.sinks())?

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.

Do you mean the distance ?

yeah,you are right.

I don't know if I am right because in your question you specify that the graph "directed" and "bipartite"... what those two properties have to do with computing a distance in a graph ? Anyway, can you reformulate your question in a clearer way ?