index
:
delta/python-packages/networkx.git
MridulS-patch-1
attrgraph
beam-log-2
circleci-project-setup
digraph-edge-subgraph
doc-isom-orderable
doc-typo
docdraft
docs-for-v1.11
dschult-patch-1
dschult-patch-gml
error-message-configuration-model
error-message-eccentricity
fix-d-separation-conflicts
gh-pages
iter_refactor
kl-encoding
main
master
networkx-1.10
nx-sparse
remove-beam-notes
remove-conda
revert-1806-patch-numpy-compatible
revert-3507-master
revert-5156-pin-pyparsing
scipy-pandas-310
v1.10
v1.10.1
v1.11
v1.9
v1.9.1
v2.5
v2.6
v2.8
github.com: networkx/networkx.git
summary
refs
log
tree
commit
diff
log msg
author
committer
range
path:
root
/
networkx
/
algorithms
/
approximation
/
__init__.py
Commit message (
Expand
)
Author
Age
Files
Lines
*
Delete warning in approximation documentation (#6221)
Paula Pérez Bianchi
2023-02-03
1
-5
/
+5
*
Add approximation algorithms for traveling salesman problem (#4607)
Dan Schult
2021-05-16
1
-8
/
+9
*
Approximated Diameter (#4476)
Andrea Tomassilli
2021-01-12
1
-0
/
+1
*
Cliques on mutigraph/directed graph types (#4502)
Andrea Tomassilli
2021-01-12
1
-1
/
+0
*
Maxcut heuristics (#4138)
Jonas Charfreitag
2020-12-14
1
-0
/
+1
*
Remove boiler plate from top of modules
Jarrod Millman
2019-11-11
1
-8
/
+0
*
PEP8 fixes
Jarrod Millman
2019-10-18
1
-1
/
+1
*
Update copyright
Jarrod Millman
2019-03-30
1
-1
/
+1
*
Treewidth and tree decomposition heuristics (#2935) (#2951)
David Kraeutmann
2018-06-26
1
-0
/
+1
*
Add a large clique size heuristic function (#2830)
Dan Schult
2018-01-17
1
-5
/
+19
*
Add docs for steiner_tree and metric_closure (#2783)
Dan Schult
2017-12-02
1
-0
/
+1
*
Merge remote-tracking branch 'upstream/master' into fix_approximation_import
JGab
2015-06-11
1
-0
/
+1
|
\
|
*
Add fast approximation for k-(node)-components.
Jordi Torrents
2015-06-03
1
-0
/
+1
*
|
Document approximation
JGab
2015-05-10
1
-0
/
+5
|
/
*
Add fast approximation for node connectivity.
Jordi Torrents
2015-03-14
1
-0
/
+1
*
Fixed init to include my new function.
Fred Morstatter
2013-05-09
1
-0
/
+1
*
Add independent set.
Aric Hagberg
2012-04-15
1
-0
/
+1
*
Add matching.
Aric Hagberg
2012-04-15
1
-0
/
+1
*
Add dominating set problem.
Aric Hagberg
2012-04-15
1
-0
/
+1
*
Add clique and ramsey.
Aric Hagberg
2012-04-15
1
-0
/
+2
*
Add vertex cover approximation algorithm.
Aric Hagberg
2012-04-15
1
-0
/
+1