hegyi@1: /* -*- C++ -*- hegyi@1: * hegyi@1: * This file is a part of LEMON, a generic C++ optimization library hegyi@1: * hegyi@1: * Copyright (C) 2003-2006 hegyi@1: * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport hegyi@1: * (Egervary Research Group on Combinatorial Optimization, EGRES). hegyi@1: * hegyi@1: * Permission to use, modify and distribute this software is granted hegyi@1: * provided that this copyright notice appears in all copies. For hegyi@1: * precise terms see the accompanying LICENSE file. hegyi@1: * hegyi@1: * This software is provided "AS IS" with no warranty of any kind, hegyi@1: * express or implied, and with no claim as to its suitability for any hegyi@1: * purpose. hegyi@1: * hegyi@1: */ hegyi@1: hegyi@1: #ifndef ALL_INCLUDE_H hegyi@1: #define ALL_INCLUDE_H hegyi@1: hegyi@1: #include hegyi@1: #include hegyi@1: hegyi@1: #include hegyi@1: hegyi@1: #include hegyi@1: #include hegyi@1: #include hegyi@1: #include hegyi@1: #include hegyi@1: hegyi@1: enum {E_WIDTH, E_COLOR, E_TEXT, EDGE_PROPERTY_NUM}; // arc properties; hegyi@1: enum {N_RADIUS, N_COLOR, N_TEXT, NODE_PROPERTY_NUM}; // node properties; hegyi@1: enum {N_MAPS, E_MAPS, ARROWS, PAR, EPS_PROPERTY_NUM}; // eps properties; hegyi@1: enum {MOVE, CREATE_NODE, CREATE_EDGE, ERASER, MAP_EDIT, TOOL_NUM}; // tools; hegyi@1: #define RANGE 3 hegyi@1: #define WIN_WIDTH 900 hegyi@1: #define WIN_HEIGHT 600 hegyi@1: #define MIN_EDGE_WIDTH 2 hegyi@1: #define MAX_EDGE_WIDTH 40 hegyi@1: #define MIN_NODE_RADIUS 2 hegyi@1: #define MAX_NODE_RADIUS 80 hegyi@1: hegyi@1: #ifndef MAIN_PART hegyi@1: extern std::vector arc_property_strings; hegyi@1: extern std::vector arc_property_defaults; hegyi@1: extern std::vector node_property_strings; hegyi@1: extern std::vector node_property_defaults; hegyi@1: extern int longest_property_string_length; hegyi@1: #endif //MAIN_PART hegyi@1: hegyi@1: using namespace lemon; hegyi@1: hegyi@1: typedef lemon::dim2::Point XY; hegyi@1: typedef ListDigraph Digraph; hegyi@1: typedef Digraph::Node Node; hegyi@1: typedef Digraph::Arc Arc; hegyi@1: typedef Digraph::ArcIt ArcIt; hegyi@1: typedef Digraph::InArcIt InArcIt; hegyi@1: typedef Digraph::OutArcIt OutArcIt; hegyi@1: typedef Digraph::NodeIt NodeIt; hegyi@1: hegyi@1: const std::string prog_name = "LEMON Digraph Editor"; hegyi@1: hegyi@1: enum MapType hegyi@1: { hegyi@1: NUM = 1 << 0, hegyi@1: STR = 1 << 1, hegyi@1: ALL = (1 << 0) | (1 << 1) hegyi@1: }; hegyi@1: hegyi@1: #endif // ALL_INCLUDE_H