Line breaks at column 80 were added, and all trailing whitespace was deleted. Code
comments were modified and some more were added.

It should be 'size_t' instead of 'long'.

This fixes the same problem as commit 6663be71, but which arises
when a filter range boundary is -inf (such as "<=100").

    
When only one of vertex or edge filtering was disabled, the allowed
range of the disabled filter was set to
]numeric_limits<double>::min(), numeric_limits<double>::max()[, and
the selected filtering property was the respective index. But
according to the STL documentation from GCC,
numeric_limits<>::min() returns:
    
   "The minimum finite value, or for floating types with
    denormalization, the minimum positive normalized value."
    
which is always positive for double (!), thus introducing a weird
regression, where the first vertex (index 0) is always filtered out if
only the edge filter is active, and vice-versa.

The Histogram type 'hist_t' should have a 'double' value, so that
counts of 1/2 can be added when it's known things are going to be
counted twice.

(and I don't know what that 'double_t' thing was doing there)

    
Filtered vertices and edges can be permanently removed from the graph
with --purge-vertices and --purge-edges, respectively. The edge or
vertex filter is automatically removed, afterwards. This is useful if
maximum speed is necessary, and saving and reloading the graph without
filtering is not desired.
    
(this commit also removes some trailing whitespaces)

This will increase memory usage, but guarantees, across different
platforms, that 'long' will always hold larger values than 'int'.

Remove graph rewiring for now, since it's quite buggy. It will be
re-commited when ready.

Complete overhaul of command line parsing, and support for loading graph-tool as whole as a python module
    
The command line parsing was completely rewritten. It now supports
better parsing of sub-options, with type checking and grouping
support. Error reporting was also significantly improved, and it now
warns of invalid options and option values, before the option is
executed. Some syntax has changed, such as range filtering:
--[vertex|edge]-range-filter was replaced by
--exclude-[vertex|edge]-range and --keep-[vertex|edge]-range, which
should have a clearer meaning. Ranges can also be specified now by
comparison operators (>,<,>=,<=,=), such as ">=10", to indicate a
range of (10, inf). In addition, ranges can now be easily open or
closed at either end, by suffixing the specific end with '*', to
indicate it is closed, ex: "10 700*" means (10,700].
    
The graph-tool script can now be loaded as a python module (it must be
renamed first to 'something.py'). All the command line options (except
'for' and 'history' which become irrelevant) are available as
functions, with full description and optional parameter support. In
addition, pure function objects can be given as parameters where
expressions are asked, instead of strings and files, which enables
convenient extension of graph-tool.

for undirected graphs

Simplify range filtering, and definitely remove python filtering
    
Simplify range filtering of vertices and edges, by always filtering
both at once, even if all vertices or edges are being considered. This
severely reduces compilation time and memory, at a small potential
cost in run-time speed, which will probably be overshadowed by other
things, such as dynamic_map look-ups ("premature optimization is the
root of all evil"). Also, remove python-filtering, since, in the end,
it is just code bloat, since it is quite slow for most uses and can be
replaced, generally, by python property editing + range filtering.

	* src/boost-workaround/boost/graph/kamada_kawai_spring_layout.hpp: annotated code with openmp constructs.

	* src/graph/graph_adaptor.hh: graph_type should be a typedef to the original graph.

	* src/graph/graph_properties.hh, src/graph/graph_properties.cc: added pos_t type.

	* src/boost-workaround/boost/graph/fruchterman_reingold.hpp: annotated code with openmp constructs.

	* src/graph/graph_layout.cc: new file with graph layout routines.

	* src/graph/graph.cc: removed graph layout routines.

	* src/graph/graph_community_network.cc (struct get_community_network): fixed inversion of directedness test.

	* src/graph/graph.cc (GraphInterface::LabelComponents): use vector_property_map instead of HashedDescriptor. Don't use a static map!

	* src/graph/graph_adaptor.hh: fixed edge descriptor equality comparison, which must rely on underlying edge, regardless of whether it's inverted or not.


git-svn-id: https://svn.forked.de/graph-tool/trunk@121 d4600afd-f417-0410-95de-beed9576f240

* src/graph/graph.cc (GraphInterface::LabelParallelEdges): use long instead of size_t for parallel edges property.

* src/graph/graph_properties.cc: call size_t by "size_t" not "long", since those are not the same type. This removes a bug where it is impossible to create/edit properties with type long.

* src/graph/graph.cc (GraphInterface::LabelParallelEdges): use vector_property_map instead of HashedDescriptorMap.


git-svn-id: https://svn.forked.de/graph-tool/trunk@120 d4600afd-f417-0410-95de-beed9576f240

        * src/graph/graph.cc (GraphInterface::LabelParallelEdges): use vector_property_map instead of HashedDescriptorMap.


git-svn-id: https://svn.forked.de/graph-tool/trunk@119 d4600afd-f417-0410-95de-beed9576f240

git-svn-id: https://svn.forked.de/graph-tool/trunk@118 d4600afd-f417-0410-95de-beed9576f240

        * src/graph-tool: added better error handling (output to stderr, cleaner information, return error status)  

        * src/graph/graph_bind.cc: added license info

        * src/graph-tool: added python metadata


git-svn-id: https://svn.forked.de/graph-tool/trunk@117 d4600afd-f417-0410-95de-beed9576f240

* src/Makefile.am: removed 'boost_workaround' dist files

* src/graph/graph_rewiring.cc: deleted blank lines.


git-svn-id: https://svn.forked.de/graph-tool/trunk@116 d4600afd-f417-0410-95de-beed9576f240

* src/graph/graph_extended_clustering.cc (GraphInterface::SetExtendedClusteringToProperty): init vector_property_map size, so that access becomes thread safe.

* src/graph/graph_clustering.cc (GraphInterface::SetLocalClusteringToProperty): init vector_property_map size, so that access becomes thread safe.


git-svn-id: https://svn.forked.de/graph-tool/trunk@115 d4600afd-f417-0410-95de-beed9576f240

        * ChangeLog: updated ChangeLog file with svn history

        * src/graph/graph_filtering.hh: added add_edge() and remove_edge() functions for filtered graphs

        * src/graph/shared_map.hh: included SharedContainer

        * src/graph/graph_rewiring.cc: initial support for random graph rewiring



git-svn-id: https://svn.forked.de/graph-tool/trunk@114 d4600afd-f417-0410-95de-beed9576f240

* removed exeption throwing in scalarS to improve performance


git-svn-id: https://svn.forked.de/graph-tool/trunk@113 d4600afd-f417-0410-95de-beed9576f240

git-svn-id: https://svn.forked.de/graph-tool/trunk@112 d4600afd-f417-0410-95de-beed9576f240

git-svn-id: https://svn.forked.de/graph-tool/trunk@109 d4600afd-f417-0410-95de-beed9576f240

git-svn-id: https://svn.forked.de/graph-tool/trunk@107 d4600afd-f417-0410-95de-beed9576f240

git-svn-id: https://svn.forked.de/graph-tool/trunk@106 d4600afd-f417-0410-95de-beed9576f240

git-svn-id: https://svn.forked.de/graph-tool/trunk@104 d4600afd-f417-0410-95de-beed9576f240

* include central point dominance


git-svn-id: https://svn.forked.de/graph-tool/trunk@103 d4600afd-f417-0410-95de-beed9576f240