22
33"""
44Core routines for working with Graphs.
5- A Graph is a tuple of a set of Nodes and Edges.
6-
7- networkx does all the heavy lifting.
85"""
96
107# uses networkx
@@ -1028,9 +1025,9 @@ def eval_patt(self, graph, patt, expression, evaluation, options):
10281025class AdjacencyList (_NetworkXBuiltin ):
10291026 """
10301027 <url>
1031- :Adjacenty list:
1028+ :Adjacency list:
10321029 https://en.wikipedia.org/wiki/Adjacency_list</url> (<url>
1033- :Networkx :
1030+ :NetworkX :
10341031 https://networkx.org/documentation/networkx-2.8.8/reference/readwrite/adjlist.html</url>,
10351032 <url>
10361033 :WMA:
@@ -1039,9 +1036,10 @@ class AdjacencyList(_NetworkXBuiltin):
10391036 <dl>
10401037 <dt>'AdjacencyList'[$graph$, $v$]
10411038 <dd>gives a list of vertices adjacent to $v$ in a 'Graph' \
1042- or a list of edges $g$..
1039+ or a list of edges $g$.
1040+
10431041 <dt>'AdjacencyList'[$graph$, $pattern$]
1044- <dd>gives a list of vertices adjacent to vertices \.
1042+ <dd>gives a list of vertices adjacent to vertices \
10451043 matching $pattern$.
10461044 </dl>
10471045
@@ -1102,7 +1100,7 @@ class BetweennessCentrality(_Centrality):
11021100 <url>
11031101 :Betweenness centrality:
11041102 https://en.wikipedia.org/wiki/Betweenness_centrality</url> (<url>
1105- :Networkx :
1103+ :NetworkX :
11061104 https://networkx.org/documentation/networkx-2.8.8/reference/algorithms/generated/\
11071105 networkx.algorithms.centrality.betweenness_centrality.html</url>,
11081106 <url>
@@ -1146,7 +1144,7 @@ class ClosenessCentrality(_Centrality):
11461144 <url>
11471145 :Betweenness centrality:
11481146 https://en.wikipedia.org/wiki/Closeness_centrality</url> (<url>
1149- :Networkx :
1147+ :NetworkX :
11501148 https://networkx.org/documentation/networkx-2.8.8/reference/algorithms/generated/\
11511149 networkx.algorithms.centrality.closeness_centrality.html</url>,
11521150 <url>
@@ -1194,7 +1192,7 @@ class DegreeCentrality(_Centrality):
11941192 <url>
11951193 :Degree centrality:
11961194 https://en.wikipedia.org/wiki/Degree_centrality</url> (<url>
1197- :Networkx :
1195+ :NetworkX :
11981196 https://networkx.org/documentation/networkx-2.8.8/reference/algorithms/generated/\
11991197 networkx.algorithms.centrality.degree_centrality.html</url>,
12001198 <url>
@@ -1252,7 +1250,7 @@ class DirectedEdge(Builtin):
12521250 <url>
12531251 :Directed edge:
12541252 https://en.wikipedia.org/wiki/Directed_graph</url> (<url>
1255- :Networkx :
1253+ :NetworkX :
12561254 https://networkx.org/documentation/stable/reference/classes/digraph.html</url>,
12571255 <url>
12581256 :WMA:
@@ -1273,7 +1271,7 @@ class EdgeConnectivity(_NetworkXBuiltin):
12731271 <url>
12741272 :Edge connectivity:
12751273 https://en.wikipedia.org/wiki/Directed_graph</url> (<url>
1276- :Networkx :
1274+ :NetworkX :
12771275 https://networkx.org/documentation/stable/reference/algorithms/\
12781276 generated/networkx.algorithms.connectivity.connectivity.edge_connectivity.html</url>,
12791277 <url>
@@ -1397,7 +1395,7 @@ class EigenvectorCentrality(_ComponentwiseCentrality):
13971395 <url>
13981396 :Eigenvector Centrality:
13991397 https://en.wikipedia.org/wiki/Eigenvector_centrality</url> (<url>
1400- :Networkx :
1398+ :NetworkX :
14011399 https://networkx.org/documentation/networkx-2.8.8/reference/algorithms\
14021400 /generated/networkx.algorithms.centrality.eigenvector_centrality.html</url>,
14031401<url>
@@ -1462,7 +1460,7 @@ class FindShortestPath(_NetworkXBuiltin):
14621460 <url>
14631461 :Shortest path problem:
14641462 https://en.wikipedia.org/wiki/Shortest_path_problem</url> (<url>
1465- :Networkx :
1463+ :NetworkX :
14661464 https://networkx.org/documentation/networkx-2.8.8/reference/algorithms\
14671465 /generated/networkx.algorithms.shortest_paths.generic.shortest_path.html</url>,
14681466 <url>
@@ -1647,14 +1645,11 @@ def boxes_to_tex(self, elements, **options):
16471645class HITSCentrality (_Centrality ):
16481646 """
16491647 <url>
1650- :https://en.wikipedia.org/wiki/HITS_algorithm:
1651- https://en.wikipedia.org/wiki/HITS_centrality</url> (<url>
1652- :Networkx:
1648+ :NetworkX:
16531649 https://networkx.org/documentation/networkx-2.8.8/reference/algorithms/\
1654- generated/networkx.algorithms.link_analysis.hits_alg.hits.html</url>,
1655- <url>
1650+ generated/networkx.algorithms.link_analysis.hits_alg.hits.html</url>, <url>
16561651 :WMA:
1657- https://reference.wolfram.com/language/ref/HITSCentrality.html</url>)
1652+ https://reference.wolfram.com/language/ref/HITSCentrality.html</url>
16581653
16591654 <dl>
16601655 <dt>'HITSCentrality'[$g$]
@@ -1731,7 +1726,7 @@ class KatzCentrality(_ComponentwiseCentrality):
17311726 <url>
17321727 :Katz Centrality:
17331728 https://en.wikipedia.org/wiki/Katz_centrality</url> (<url>
1734- :Networkx :
1729+ :NetworkX :
17351730 https://networkx.org/documentation/networkx-2.8.8/reference/algorithms\
17361731 /generated/networkx.algorithms.centrality.katz_centrality.html\
17371732 #networkx.algorithms.centrality.katz_centrality</url>, <url>
@@ -1793,7 +1788,7 @@ class PageRankCentrality(_Centrality):
17931788 <url>
17941789 :Pagerank Centrality:
17951790 https://en.wikipedia.org/wiki/Pagerank</url> (<url>
1796- :Networkx :
1791+ :NetworkX :
17971792 https://networkx.org/documentation/networkx-2.8.8/reference/algorithms\
17981793 /generated/networkx.algorithms.link_analysis.pagerank_alg.pagerank.html</url>,
17991794 <url>
@@ -1814,6 +1809,7 @@ class PageRankCentrality(_Centrality):
18141809 # >> g = Graph[{a -> d, b -> c, d -> c, d -> a, e -> c, d -> c}]; PageRankCentrality[g, 0.2]
18151810 = {0.184502, 0.207565, 0.170664, 0.266605, 0.170664}
18161811 """
1812+
18171813 summary_text = "get the page rank centralities"
18181814
18191815 def eval_alpha_beta (self , graph , alpha , expression , evaluation , options ):
0 commit comments