Balazs Dezso <deba@inf.elte.hu> [Tue, 28 Apr 2009 12:54:59 +0200] rev 629
Fix Makefile.am EXTRA_DIST (#276)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 28 Apr 2009 14:01:00 +0100] rev 628
Merge
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 28 Apr 2009 13:51:34 +0100] rev 627
Merge and extend the fix of #275
Alpar Juttner <alpar@cs.elte.hu> [Sun, 26 Apr 2009 16:36:23 +0100] rev 626
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 26 Apr 2009 16:44:53 +0200] rev 625
Modify the interface of MinCostArborescence + improvements (#267)
- Rename arborescenceValue() to arborescenceCost().
- Rename DefXyz template named paramaters to SetXyz.
- Rearrange public functions (for better doc).
- Doc improvements.
- Extend the test file with interface checking.
Alpar Juttner <alpar@cs.elte.hu> [Sat, 25 Apr 2009 17:51:09 +0100] rev 624
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 25 Apr 2009 02:12:41 +0200] rev 623
Modify the interface of Suurballe (#266, #181)
- Move the parameters s and t from the constructor to the run()
function. It makes the interface capable for multiple run(s,t,k)
calls (possible improvement in the future) and it is more similar
to Dijkstra.
- Simliarly init() and findFlow(k) were replaced by init(s) and
findFlow(t,k). The separation of parameters s and t is for the
future plans of supporting multiple targets with one source node.
For more information see #181.
- LEMON_ASSERT for the Length type (check if it is integer).
- Doc improvements.
- Rearrange query functions.
- Extend test file.
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 25 Apr 2009 18:25:59 +0200] rev 622
Support infinite bounds in Circulation + fixes (#270, #266)
- Support infinite capacities.
- Bug fix in upperMap().
- Fixes and improvements in the documentation.
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 23 Apr 2009 07:30:40 +0100] rev 621
FindCOIN for CMake (#256)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 23 Apr 2009 07:29:50 +0100] rev 620
FindCPLEX for CMake (#256)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 23 Apr 2009 07:28:56 +0100] rev 619
FindGLPK improvements (#256)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 24 Apr 2009 12:12:14 +0100] rev 618
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 11:54:48 +0200] rev 617
Fix and uniform the usage of Graph and Parent typedefs (#268)
- Rename Graph typedefs to GraphType in the implementation of graph
maps and MapExtender to prevent conflicts (especially using VS).
They are not public.
- Make Parent typedefs private in all classes.
- Replace Digraph with Graph in some places
(fix faulty renamings of the script).
- Use Graph and Digraph typedefs (more) consequently.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 10:15:33 +0200] rev 616
VS compatibility fix (#268)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 12:23:53 +0200] rev 615
Exploit the changes of #190 in MCF test file (#234, #190)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 12:23:17 +0200] rev 614
Support LEQ and GEQ supply constraints in dimacs-solver (#234, #219)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 24 Apr 2009 12:22:06 +0200] rev 613
Bug fix in NetworkSimplex (#234)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 23 Apr 2009 10:44:35 +0100] rev 612
Fix usage of sqrt() (#268)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 21 Apr 2009 15:18:54 +0100] rev 611
Merge and fix
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 17 Apr 2009 18:14:35 +0200] rev 610
Slightly modify the interface of Circulation and Preflow (#266)
in order to synchronize them to the interface of NetworkSimplex.
Circulation:
- The "delta" notation is replaced by "supply".
- lowerCapMap(), upperCapMap() are renamed to lowerMap() and upperMap().
- Value is renamed to Flow.
Preflow:
- Value is renamed to Flow.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 17 Apr 2009 18:04:36 +0200] rev 609
Support >= and <= constraints in NetworkSimplex (#219, #234)
By default the same inequality constraints are supported as by
Circulation (the GEQ form), but the LEQ form can also be selected
using the problemType() function.
The documentation of the min. cost flow module is reworked and
extended with important notes and explanations about the different
variants of the problem and about the dual solution and optimality
conditions.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 03 Apr 2009 18:59:15 +0200] rev 608
Support real types + numerical stability fix in NS (#254)
- Real types are supported by appropriate inicialization.
- A feature of the XTI spanning tree structure is removed to ensure
numerical stability (could cause problems using integer types).
The node potentials are updated always on the lower subtree,
in order to prevent overflow problems.
The former method isn't notably faster during to our tests.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 03 Apr 2009 13:46:16 +0200] rev 607
Separate types for flow and cost values in NetworkSimplex (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 25 Mar 2009 21:37:50 +0100] rev 606
Support multiple run() calls in NetworkSimplex (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 25 Mar 2009 15:58:44 +0100] rev 605
Rework the interface of NetworkSimplex (#234)
The parameters of the problem can be set with separate functions
instead of different constructors.
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 24 Mar 2009 00:18:25 +0100] rev 604
Use XTI implementation instead of ATI in NetworkSimplex (#234)
XTI (eXtended Threaded Index) is an imporved version of the widely
known ATI (Augmented Threaded Index) method for storing and updating
the spanning tree structure in Network Simplex algorithms.
In the ATI data structure three indices are stored for each node:
predecessor, thread and depth. In the XTI data structure depth is
replaced by the number of successors and the last successor
(according to the thread index).
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 23 Mar 2009 23:54:42 +0100] rev 603
Internal restructuring and renamings in NetworkSimplex (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 24 Feb 2009 09:52:26 +0100] rev 602
Support min cost flow in dimacs-solver (#234)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 24 Feb 2009 09:46:02 +0100] rev 601
Port NetworkSimplex from SVN -r3520 (#234)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 21 Apr 2009 13:08:19 +0100] rev 600
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 21 Apr 2009 10:34:49 +0100] rev 599
Merge
Balazs Dezso <deba@inf.elte.hu> [Sat, 18 Apr 2009 21:54:30 +0200] rev 598
Add more docs to LGF function interface (#109)
Balazs Dezso <deba@inf.elte.hu> [Sat, 18 Apr 2009 21:01:12 +0200] rev 597
Fix in HaoOrlin (#264)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 09:37:51 +0200] rev 596
Improvements and fixes for the minimum cut algorithms (#264)
Alpar Juttner <alpar@cs.elte.hu> [Sat, 18 Apr 2009 08:51:54 +0100] rev 595
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 17 Apr 2009 09:58:50 +0200] rev 594
Rename max_matching.h to matching.h (#265)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 17 Apr 2009 09:54:14 +0200] rev 593
Extend and modify the interface of matching algorithms (#265)
- Rename decomposition() to status() in MaxMatching.
- Add a new query function statusMap() to MaxMatching.
- Add a new query function matchingMap() to all the three classes.
- Rename matchingValue() to matchingWeight() in the weighted
matching classes.
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 11:47:19 +0200] rev 592
Improvements for the Euler tools and the test file (#264)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 11:41:25 +0200] rev 591
Bug fix in the Euler iterators (#264)
Handle the case when the first node is isolated.
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 12:01:14 +0200] rev 590
Imporvements for the matching algorithms (#264)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 15 Apr 2009 07:13:30 +0100] rev 589
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 15 Apr 2009 07:07:25 +0100] rev 588
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 15 Apr 2009 07:05:32 +0100] rev 587
Rotate and enlarge some images (#262)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 04:26:13 +0200] rev 586
Add images + fixes in the doc of connectivity tools (#262)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 03:26:45 +0200] rev 585
Improve test files for some algorithms (#263)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 15 Apr 2009 02:04:37 +0200] rev 584
Small doc improvements (#263)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 14 Apr 2009 10:40:33 +0100] rev 583
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 14 Apr 2009 10:54:42 +0200] rev 582
Remove notes about reference maps as extra features (#190)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 14 Apr 2009 10:35:38 +0200] rev 581
Exploit that the standard maps are reference maps (#190)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 14 Apr 2009 10:34:12 +0200] rev 580
Standard graph maps are required to be reference maps (#190)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 14 Apr 2009 10:33:17 +0200] rev 579
Various improvements and fixes (mainly in the doc) (#190)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 10 Apr 2009 07:29:22 +0100] rev 578
Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 10 Apr 2009 07:29:00 +0100] rev 577
Merge
Balazs Dezso <deba@inf.elte.hu> [Wed, 08 Apr 2009 22:49:28 +0200] rev 576
Unified message handling for LP and MIP solvers (#9)
Balazs Dezso <deba@inf.elte.hu> [Thu, 09 Apr 2009 21:19:16 +0200] rev 575
Force cplex checking (#260)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 08 Apr 2009 10:42:00 +0200] rev 574
Add RangeIdMap, CrossRefMap to the rename script (#160)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 07 Apr 2009 14:50:20 +0100] rev 573
Merge
Alpar Juttner <alpar@cs.elte.hu> [Sat, 04 Apr 2009 07:30:58 +0100] rev 572
DescriptorMap->RangeIdMap, InvertableMap->CrossRefMap (#160)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 07 Apr 2009 12:56:50 +0100] rev 571
Merge
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 06 Apr 2009 18:51:04 +0100] rev 570
Fix compilation with MSVC (#259)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 06 Apr 2009 18:51:54 +0100] rev 569
Fix compilation with MSVC (#258)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Fri, 03 Apr 2009 16:58:22 +0100] rev 568
Single check macro for all COIN-OR dependencies (#204)
Balazs Dezso <deba@inf.elte.hu> [Wed, 01 Apr 2009 22:58:58 +0200] rev 567
Add CBC support (#204)
Balazs Dezso <deba@inf.elte.hu> [Thu, 02 Apr 2009 19:29:56 +0200] rev 566
Silent glp_adv_basis() (#255)
Balazs Dezso <deba@inf.elte.hu> [Wed, 01 Apr 2009 22:54:00 +0200] rev 565
Fixing presolver and basis handling (#255)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Wed, 01 Apr 2009 14:18:35 +0100] rev 564
Add 'demo' make target for building the demo programs
Alpar Juttner <alpar@cs.elte.hu> [Wed, 01 Apr 2009 17:17:47 +0100] rev 563
Fix in .hgignore
Alpar Juttner <alpar@cs.elte.hu> [Tue, 31 Mar 2009 16:25:10 +0100] rev 562
Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 30 Mar 2009 16:46:37 +0100] rev 561
Accept negative values as unbounded capacity in dimacs readers (#243)
and some doc improvements.
Alpar Juttner <alpar@cs.elte.hu> [Sun, 29 Mar 2009 22:19:14 +0100] rev 560
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sun, 29 Mar 2009 23:08:20 +0200] rev 559
Various doc improvements (#248)
- Rename all the ugly template parameters (too long and/or starting
with an underscore).
- Rename function parameters starting with an underscore.
- Extend the doc for many classes.
- Use LaTeX-style O(...) expressions only for the complicated ones.
- A lot of small unification changes.
- Small fixes.
- Some other improvements.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 27 Mar 2009 18:49:25 +0100] rev 558
Improve timer and counter tests (#253)
- Do not print the output of counter_test.cc.
- Check the output of counter_test.cc.
- Shorten the running time of time_measure_test.cc.
Alpar Juttner <alpar@cs.elte.hu> [Sat, 28 Mar 2009 10:36:53 +0000] rev 557
Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 27 Mar 2009 10:34:43 +0000] rev 556
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 27 Mar 2009 07:24:52 +0100] rev 555
Fix and extend the migration script (#245)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 27 Mar 2009 07:24:18 +0100] rev 554
Bug fix in unify-sources.sh (#245)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 27 Mar 2009 09:30:22 +0000] rev 553
Merge
Akos Ladanyi <ladanyi@tmit.bme.hu> [Thu, 19 Mar 2009 15:41:29 +0000] rev 552
CMake subproject support fixes (#240)
Balazs Dezso <deba@inf.elte.hu> [Thu, 19 Mar 2009 08:40:34 +0100] rev 551
Fix lp related errors and warnings (#241 and #242)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 18 Mar 2009 16:18:05 +0000] rev 550
Switch on warnings when compiling the lib
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 16 Mar 2009 13:51:32 +0000] rev 549
Make it possible to use LEMON as a CMake subproject (#240)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 05 Mar 2009 10:13:20 +0000] rev 548
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 04 Mar 2009 14:09:45 +0000] rev 547
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 04 Mar 2009 14:56:09 +0100] rev 546
Doc improvements in GomoryHu (#66)
And make init() and start() private + bug fix in the test file.
Alpar Juttner <alpar@cs.elte.hu> [Wed, 25 Feb 2009 11:10:57 +0000] rev 545
Remane GomoryHuTree to GomoryHu (#66)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 25 Feb 2009 11:10:52 +0000] rev 544
Cut iterators for GomoryHuTree + doc cleanup + bug fixes (#66)
Janos Tapolcai <tapolcai@tmit.bme.hu> [Fri, 20 Feb 2009 17:17:17 +0100] rev 543
Porting Gomory-Hu algorithm (#66)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 04 Mar 2009 13:43:05 +0000] rev 542
Merge
Alpar Juttner <alpar@cs.elte.hu> [Sun, 01 Mar 2009 07:10:49 +0000] rev 541
Remove \bug and \todo comments
Alpar Juttner <alpar@cs.elte.hu> [Thu, 26 Feb 2009 07:39:16 +0000] rev 540
Fix newSolver()/cloneSolver() API in LP tools + doc improvements (#230)
- More logical structure for newSolver()/cloneSolver()
- Fix compilation problem with gcc-3.3
- Doc improvements
Alpar Juttner <alpar@cs.elte.hu> [Thu, 26 Feb 2009 09:39:02 +0000] rev 539
Fix Soplex config in autoconf (#230)
Balazs Dezso <deba@inf.elte.hu> [Mon, 23 Feb 2009 23:44:29 +0100] rev 538
Automatic GLPK env deallocation (#213)
Balazs Dezso <deba@inf.elte.hu> [Mon, 23 Feb 2009 22:54:25 +0100] rev 537
Fix GLPK tests (#213)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 24 Feb 2009 06:52:17 +0000] rev 536
Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 18:01:14 +0000] rev 535
Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 15:04:10 +0000] rev 534
Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 15:03:55 +0000] rev 533
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 23 Feb 2009 14:51:10 +0100] rev 532
Small improvements in DIMACS solver (#226)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 23 Feb 2009 14:53:45 +0100] rev 531
Avoid warnings in test/euler_test.h (#65)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 12:33:40 +0000] rev 530
Merge
Balazs Dezso <deba@inf.elte.hu> [Mon, 23 Feb 2009 13:12:05 +0100] rev 529
Fix the naming convention of guards and remove one unnecessary include
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 12:26:21 +0000] rev 528
Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 11:52:45 +0000] rev 527
CMAKE builds the tools/ dir, too (#228)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 11:49:57 +0000] rev 526
DIMACS solver utility (#226)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 11:48:47 +0000] rev 525
dimacs.h reads MAT files to both dir and undir graphs (#231)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 11:31:22 +0000] rev 524
Option for lgf-gen to draw the edges only
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 11:30:15 +0000] rev 523
Port lgf-gen from SVN -r3512 (#45)
- apply the migrate script
- apply the source unifyer
- fix the compilation
Akos Ladanyi <ladanyi@tmit.bme.hu> [Mon, 03 Nov 2008 11:59:54 +0000] rev 522
Test for euler.h (#65)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 11:30:15 +0000] rev 521
Rename euler() to eulerian() (#65)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 23 Feb 2009 11:30:15 +0000] rev 520
Port Euler walk tools from SVN -r3512 (#65)
Balazs Dezso <deba@inf.elte.hu> [Mon, 23 Feb 2009 11:58:39 +0100] rev 519
Fix several missing includes (#232)
Alpar Juttner <alpar@cs.elte.hu> [Sun, 22 Feb 2009 09:52:44 +0000] rev 518
Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 20 Feb 2009 21:37:19 +0000] rev 517
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 20 Feb 2009 18:43:34 +0100] rev 516
Fixes in adaptors.h to compile on AIX
Alpar Juttner <alpar@cs.elte.hu> [Mon, 16 Feb 2009 18:15:52 +0000] rev 515
Merge
Janos Tapolcai <tapolcai@tmit.bme.hu> [Fri, 23 Jan 2009 18:40:41 +0100] rev 514
Dirty hacking for VS 2005 in lp_base.h (#209)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 13 Feb 2009 16:05:21 +0000] rev 513
Merge
Balazs Dezso <deba@inf.elte.hu> [Fri, 13 Feb 2009 13:29:28 +0100] rev 512
Fixes for MSVC 2008 in grap_adaptors.h and edge_set.h (#194)
Several renamings and changes in adaptors and edge sets
- Fixing scope usage for MSVC
- ResidualDigraph based on SubDigraph instead of FilterArcs
- Use initialize() in adaptors and edge sets
- Wrap ListDigraph for edge set tests
Alpar Juttner <alpar@cs.elte.hu> [Fri, 13 Feb 2009 15:01:09 +0000] rev 511
Change LEMON's isnan() to isNaN() for the sake of AIX/xlC
Certain xlC versions implement isnan() as a #define.
Alpar Juttner <alpar@cs.elte.hu> [Fri, 13 Feb 2009 14:56:27 +0000] rev 510
Fix in lp_base.cc targeting AIX/xlC compatibility
Alpar Juttner <alpar@cs.elte.hu> [Tue, 10 Feb 2009 17:37:59 +0000] rev 509
Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 23 Jan 2009 16:42:07 +0000] rev 508
Merge (manually add cmake/FindGLPK.cmake to Makefile.am)
Alpar Juttner <alpar@cs.elte.hu> [Thu, 22 Jan 2009 14:46:15 +0000] rev 507
Suppress or fix VS2008 warnings + turn off faulty tests using CMAKE (#208)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 21 Jan 2009 18:18:41 +0000] rev 506
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 16 Oct 2009 10:21:37 +0200] rev 505
Use pathCopy(from,to) instead of copyPath(to,from) (#321)
The old version is kept as a deprecated alternative.
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 12 Jan 2009 23:11:39 +0100] rev 504
Slightly simplify adaptors_test.cc
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 12 Oct 2009 13:41:15 +0200] rev 503
Fix in pathSource() and pathTarget() (#250)
and extend the doc.
Akos Ladanyi <ladanyi@tmit.bme.hu> [Tue, 18 Aug 2009 21:39:35 +0100] rev 502
Remove duplicate list_graph.h entry from source list (#308)