code for tail and head of an edge in a bipartite graph
how to write a code for finding tail and head of an edge in a bipartite graph?
how to write a code for finding tail and head of an edge in a bipartite graph?
You may want to take a look to this, and in particular this. Good luck!
UPDATE
Let $G$ be a bipartite graph that you have generated using one of the ways commented in the 2nd link above. Now you want to take an edge and get its head an tail. In order to do that, you can just identify the sets of tails and heads with the "bipartition" method of the graph, and check which of the vertices of an edge is in which set. It could be something like
tail_set, head_set = G.bipartition()
print "Set of tails: ",tail_set
print "Set of heads: ",head_set
for edge in G.edges():
v1, v2 = edge[:2]
tail = (v1 if v1 in tail_set else v2)
head = (v1 if tail == v2 else v2)
print "Edge: ",edge
print " Tail: ",tail,", Head: ",head
i looked to that but could not find proper code which i wanted..
Please start posting anonymously - your entry will be published after you log in or create a new account.
Asked: 2013-04-22 08:05:23 +0100
Seen: 476 times
Last updated: Apr 22 '13
optimizing graph coloring for small chromatic number
Enumerate isomrphic subgraphs of graph vertex labeled
multi-symmetric functions and multi-partitions
A Combinatorics Problem - Product Rule Indices
Dictating the roots to RootSystem
iterating over a combinatorial class