Trouble with Iterators and Hashtables (Java) Post: 302719543

Sponsored Content

Top Forums Programming Trouble with Iterators and Hashtables (Java) Post 302719543 by DGPickett on Monday 22nd of October 2012 03:26:55 PM

10-22-2012

Registered User

So, you want a graph where each word object in the master container ihas the word and a container of references to words 1 character off. Then, you can walk the graph of one-off's avoiding retracing, to depth N. Does length always match, e.g., clocks is 1 letter different than clock? You might want length as a key for searching for one-off words during generate. Not sure what full capacity is, or how hash is really useful here, as opposed to a tree of length and value.

Indentation would be nice! Has anyone written a JAVA beautify yet? Many! We all deserve well formatted code. http://www.javaregex.com/jbeaut.html

Last edited by DGPickett; 10-22-2012 at 04:35 PM..

DGPickett

View Public Profile for DGPickett

Find all posts by DGPickett

2 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Trouble installing Java bin in ssh

Java is required for a game server I'm setting up.. I'm unable to install the java_ee_sdk-5_03-linux.bin self-executable. Tried using chmod but didn't have any success. Please help, I will be eternally greatfull :D

2. Ubuntu

Trouble setting up Java classpath

Saw an error while setting up an application called i2phex: # ./run.sh java.lang.RuntimeException: Failed to initialize phex.net.repres.i2p.I2PPresentationManager at phex.common.ManagerController.initializeManagers(ManagerController.java:78) at phex.Main.main(Main.java:161)After...

LEARN ABOUT SUSE

rpmgraph

RPMGRAPH(8)						      System Manager's Manual						       RPMGRAPH(8)

NAME

       rpmgraph - Display RPM Package Dependency Graph

SYNOPSIS

       rpmgraph PACKAGE_FILE ...

DESCRIPTION

       rpmgraph  uses PACKAGE_FILE arguments to generate a package dependency graph. Each PACKAGE_FILE argument is read and added to an rpm trans-
       action set. The elements of the transaction set are partially ordered using a topological sort. The partially  ordered  elements  are  then
       printed to standard output.

       Nodes  in  the  dependency  graph  are  package names, and edges in the directed graph point to the parent of each node. The parent node is
       defined as the last predecessor of a package when partially ordered using the package dependencies as a relation. That means that the  par-
       ent of a given package is the package's last prerequisite.

       The  output  is	in  dot(1)  directed graph format, and can be displayed or printed using the dotty graph editor from the graphviz package.
       There are no rpmgraph specific options, only common rpm options.  See the rpmgraph usage message for what is currently implemented.

SEE ALSO

       dot(1),

       dotty(1),

	http://www.graphviz.org/ <URL:http://www.graphviz.org/>

AUTHORS

       Jeff Johnson <jbj@redhat.com>

Red Hat, Inc.							   30 June 2002 						       RPMGRAPH(8)