Undirected Wiener Index: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:2511:25, 15 February 2023‎ Admin talk contribs‎ 986 bytes +986‎ Created page with "{{DISPLAYTITLE:Undirected Wiener Index (Wiener Index)}} == Description == Calculate the sum of the lengths of the shortest paths between all pairs of vertices in an undirected graph (typically in the chemical graph representing the non-hydrogen atoms in the molecule). == Related Problems == Related: Minimum Wiener Connector Problem == Parameters == <pre>n: number of vertices (number of non-hydrogen atoms in the molecule)</pre> == Table of Algorithms == Cur..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Undirected_Wiener_Index"