add symbol graph

Author: shellfly

cmd/symbol-graph/main.go

@@ -0,0 +1,68 @@
+/*
+   Execution:    go run cmd/symbol-graph/main.go filename.txt delimiter
+   Data files:   https://algs4.cs.princeton.edu/41graph/routes.txt
+                 https://algs4.cs.princeton.edu/41graph/movies.txt
+                 https://algs4.cs.princeton.edu/41graph/moviestiny.txt
+                 https://algs4.cs.princeton.edu/41graph/moviesG.txt
+                 https://algs4.cs.princeton.edu/41graph/moviestopGrossing.txt
+
+   %  go run cmd/symbol-graph/main.go routes.txt " "
+   JFK
+      MCO
+      ATL
+      ORD
+   LAX
+      PHX
+      LAS
+
+   % go run cmd/symbol-graph/main.go movies.txt "/"
+   Tin Men (1987)
+      Hershey, Barbara
+      Geppi, Cindy
+      Jones, Kathy (II)
+      Herr, Marcia
+      ...
+      Blumenfeld, Alan
+      DeBoy, David
+   Bacon, Kevin
+      Woodsman, The (2004)
+      Wild Things (1998)
+      Where the Truth Lies (2005)
+      Tremors (1990)
+      ...
+      Apollo 13 (1995)
+      Animal House (1978)
+
+
+   Assumes that input file is encoded using UTF-8.
+   % iconv -f ISO-8859-1 -t UTF-8 movies-iso8859.txt > movies.txt
+*/
+
+package main
+
+import (
+	"fmt"
+	"os"
+	"strings"
+
+	"github.com/shellfly/algo"
+	"github.com/shellfly/algo/stdin"
+)
+
+func main() {
+	sg := algo.NewSymbolGraph(os.Args[1])
+	g := sg.G()
+	stdin := stdin.NewStdIn()
+	for !stdin.IsEmpty() {
+		source := strings.Trim(stdin.ReadString(), " ")
+		if sg.Contains(source) {
+			s := sg.Index(source)
+			for _, v := range g.Adj(s) {
+				fmt.Println("  ", sg.Name(v))
+			}
+			fmt.Println()
+		} else {
+			fmt.Println("input not contains source: ", source)
+		}
+	}
+}

graph.go

@@ -28,6 +28,15 @@ func NewGraph(in *stdin.In) *Graph {
 	return g
 }
 
+// NewGraphV ...
+func NewGraphV(v int) *Graph {
+	adj := make([]*Bag, v)
+	for i := 0; i < v; i++ {
+		adj[i] = NewBag()
+	}
+	return &Graph{v: v, e: 0, adj: adj}
+}
+
 // V ...
 func (g *Graph) V() int {
 	return g.v

st.go

@@ -18,33 +18,38 @@ func (k StringKey) compareTo(other interface{}) int {
 	return 0
 }
 
-// ST is symbol table
-type ST struct{}
+// ST is symbol table implemented by go  map[string]int
+type ST map[string]int
 
-// Put add new key value pair into the st
-func (st ST) Put(key, value interface{}) {
+// NewST ...
+func NewST() ST {
+	return make(ST)
+}
 
+// Put add new key value pair into the st
+func (st ST) Put(key string, val int) {
+	st[key] = val
 }
 
 // Get add new key value pair into the st
-func (st ST) Get(key interface{}) (value interface{}) {
-	return nil
+func (st ST) Get(key string) int {
+	return st[key]
 }
 
 // Delete ...
-func (st ST) Delete(key interface{}) {
-	return
+func (st ST) Delete(key string) {
+	delete(st, key)
 }
 
 // Contains ...
-func (st ST) Contains(key interface{}) bool {
-	return false
-
+func (st ST) Contains(key string) bool {
+	_, ok := st[key]
+	return ok
 }
 
 // Size ...
 func (st ST) Size() int {
-	return 0
+	return len(st)
 }
 
 // IsEmpty add new key value pair into the st
@@ -53,6 +58,10 @@ func (st ST) IsEmpty() bool {
 }
 
 // Keys ...
-func (st ST) Keys() []interface{} {
-	return nil
+func (st ST) Keys() []string {
+	keys := make([]string, 0, len(st))
+	for k := range st {
+		keys = append(keys, k)
+	}
+	return keys
 }

stdin/in.go

@@ -12,6 +12,17 @@ type In struct {
 	scanner *bufio.Scanner
 }
 
+// NewInByLine return a pointer of In
+func NewInByLine(path string) *In {
+	inFile, err := os.Open(path)
+	if err != nil {
+		fmt.Println(err)
+		panic("Can not open file: " + path)
+	}
+	scanner := bufio.NewScanner(inFile)
+	return &In{scanner}
+}
+
 // NewIn return a pointer of In
 func NewIn(path string) *In {
 	inFile, err := os.Open(path)
@@ -31,6 +42,7 @@ func (in In) IsEmpty() bool {
 
 // ReadString return next string by delimiter of ' '
 func (in In) ReadString() string {
+
 	return in.scanner.Text()
 }
 

symbol_graph.go

@@ -0,0 +1,64 @@
+package algo
+
+import (
+	"strings"
+
+	"github.com/shellfly/algo/stdin"
+)
+
+// SymbolGraph ...
+type SymbolGraph struct {
+	st   ST
+	keys []string
+	g    *Graph
+}
+
+// NewSymbolGraph ...
+func NewSymbolGraph(filename string) *SymbolGraph {
+	st := NewST()
+	in := stdin.NewInByLine(filename)
+	for !in.IsEmpty() {
+		a := strings.Split(in.ReadString(), " ")
+		for i := 0; i < len(a); i++ {
+			if !st.Contains(a[i]) {
+				st.Put(a[i], st.Size())
+			}
+		}
+	}
+
+	keys := make([]string, st.Size())
+	for _, name := range st.Keys() {
+		keys[st.Get(name)] = name
+	}
+
+	g := NewGraphV(st.Size())
+	in = stdin.NewInByLine(filename)
+	for !in.IsEmpty() {
+		a := strings.Split(in.ReadString(), " ")
+		v := st.Get(a[0])
+		for i := 1; i < len(a); i++ {
+			g.AddEdge(v, st.Get(a[i]))
+		}
+	}
+	return &SymbolGraph{st, keys, g}
+}
+
+// Contains ...
+func (s *SymbolGraph) Contains(key string) bool {
+	return s.st.Contains(key)
+}
+
+// Index ...
+func (s *SymbolGraph) Index(key string) int {
+	return s.st.Get(key)
+}
+
+// Name ...
+func (s *SymbolGraph) Name(v int) string {
+	return s.keys[v]
+}
+
+// G ...
+func (s *SymbolGraph) G() *Graph {
+	return s.g
+}