Issue 113 in python-graph: HITS algorithm implementation

[python...@googlecode.com]

Status: New
Owner: ----
Labels: Type-Defect Priority-Medium

New issue 113 by mydi...@gmail.com: HITS algorithm implementation
http://code.google.com/p/python-graph/issues/detail?id=113

Attached is the diff file based on the current latest revision that
implements the HITS algorithm. Also, a unittest is included in a similar
spirit to the pagerank algorithm.

If I forgot something, let me know.

Attachments:
hits.diff 5.6 KB

[python...@googlecode.com]

Comment #1 on issue 113 by mydi...@gmail.com: HITS algorithm implementation
http://code.google.com/p/python-graph/issues/detail?id=113

Fixed a bug on hits. (flatten some lists)

Attachments:
hits.py 3.2 KB

[Mohamed Badawy]

  Dear All i want a help to complete the Dijkstra algorithm code using Python 

I want to know how can i access the cost values 

G = {'s':{'u':10, 'x':5},
     'u':{'v':1, 'x':2},
     'v':{'y':4},
     'x':{'u':3, 'v':9, 'y':2},
     'y':{'s':7, 'v':6}}

SO Dijkstra (G,'s','d') will return the path and the value of the path so i need to know hoa can i access numbers 

such as  10 5 with u , x  &  1,2 with v,x  and so on .

Thanks in advance