Tic Tac Toe game using Graphs

Question

Does anyone know of an open-source implementation of Tic-Tac-Toe using Graphs? I'm reading through Michael Mann's Data Structures and Other Objects Using Java book and in chapter 14, he briefly mentions the use of directed graphs in implementing a game of Tic Tac Toe. I'm interested in seeing how one would implement something of this sort (and no, it's not a homework assignment).
If someone would be kind enough as to post a link to a site that offers mini-java applications, along with code that novice developers such as myself can traverse, please do so.
Thanks in advance.

Answer 1

As an added though, there's really no need to for each node to keep track of incoming connections, only outgoing ones. What I, personally would do is keep an array of 8 outgoing connections, one for each direction. If no connection was there, then that element in the array would be null. If a connection was there, then that element would be an edge connecting to another node, or the other node itself (depending on whether or not you explicitly implemented 'edges' in your graph).
That way, you could do something like:
    Node    s         = getOneOfTheEdgeNodes();
    boolean hasWinner = false;    
    try {
        for (int i = 0; i < 8; i ++) {
            if (s.getOutgoing(i).getNode().getOutgoing(i).getNode() != null) {
                hasWinner = true;
                break;
    } catch (NullPointerException npx) {
        // No winner.
    if (hasWinner)
        System.out.println(s.getPlayer() + " has won");Yeah, that's a shitty example, but hopefully you get my drift.
Jason