File: TODO

package info (click to toggle)
graphthing 1.3.2-2
  • links: PTS, VCS
  • area: main
  • in suites: lenny
  • size: 856 kB
  • ctags: 700
  • sloc: cpp: 7,716; yacc: 209; sh: 206; lex: 188; makefile: 11
file content (51 lines) | stat: -rw-r--r-- 1,675 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
This is roughly in order of decreasing priority. If you have a request, send
it to me at <dsymonds@gmail.com>.

	* More output formats:
		- EPS (for LaTeX insertion)
		- GraphBase
		- xfig
		- JPEG/PNG, etc.
	* Editing of adjacency matrix
	* General appearance settings
		- fonts (size, face, etc.)
		- background colour
	* Moving entire graph around page (e.g. w/ Ctrl key)
	* Proper installer for Windows
		- NSIS (http://nsis.sf.net)?
	* Mac port:
		- Old version of bison!
		  (Makes *.tab.cc.h instead of *.tab.hh)
	* Pretty polynomial/matrix displays
	* Accelerators for various things
		- switching modes (space bar: but how to toggle toolbar btns?)
	* "Factorised" forms for chromatic polynomials
	* Help system
	* Quick overview of common statistics
	* Non-integer and negative edge weights
	* Graph layout algorithms
		- internalize some?
			+ spring embedding
		- call out to tools like dot/neato
		- simple zoom-to-fit
	* Digraphs
		- double arcs: (two directed edges between vertex pair)
			+ fix cycling with right-click
			+ fix text attachment positioning
			+ fix spline sizing
		- More network flow stuff
		- Q: in a digraph with an undirected edge, can it be traversed
			twice in an Eulerian cycle?
	* Combinatorial stuff:
		- automorphism group (integration with 'nauty'?)
		- Cycle index polynomial
	* Have undo dialog for multiple simultaneous undos, with descriptions
	* Multigraphs
		- curved edges (4-point bezier curves?)
		- loops
		- need to do a complete code audit!
	* More comprehensive testing
	* Poset stuff:
		- determine if a Hasse diagram
		- spit out minimal ordering
	* Travelling salesman problem (and other standard NP-hard problems)