AlMeta:QuiteUnusual:Concept mapping design doc
This is for the AntiWikipedia side. for the game side see:YMO_Prototype_Design_Doc
Users can selec their version, the version specified in the map/article that they followed to that node, the most popular version(one they are most likely to approve of that they haven't approved, ether directly of through a proxy), or select a user to see their version.
Should show versions that they are linkly to revise. show under user's menu(at the top of the list)(just use a randum unaprroved version in MVP. the one that has the highest likelyhood of being disaproved(disagree that the aproved tag aplies) of)
users
recommended display name
full name
articles
comments
tags
Can be agree that the tag aplies unset or disagree's that the tag aplies
if they approved the article =
Could be just another tag but needs to calculate the likelyhood of them disagreeing that it's aproved not just the likelyhood that it is approved but is that just 1=(approve likelyhood)?
Nodes that they have edited
friends list
ignore list
ignore list takes priority over friends list when deciding to show a node to the user
Authorities
order list of users. when deciding on which article to show for their version start with ones they approved then go their their authorities list look for one that they approved select the newest one if none of them have approved an article for that node do the same thing to thier authoritie's authoritie list.
Example with this graph:
- a
- b
- c
- d
- b
- e
- f
- d
- c
- x
- y
- z
- d
- e
- q
- r
- s
- for a get a's, b's, c's and d's aproves articles for the node, if it not empty selevt the newest one.
- if it is empty get b's authlist's( e's, f's and d's) approved articles for the node, if it not empty select the newest one.
- if it is empty get c's authlist's( x's, y's and z's) approved articles for the node, if it not empty select the newest one.
- if it is empty get d's authlist's approved articles for the node, since it's empty get e's authlist's (q's, r's, s's) approved articles for the node, if it not empty select the newest one.
- if it's empty get f's dauthlist's approved articles for the node, if it not empty select the newest one.
- if it's empty get d's authlist's approved articles for the node, it's empty so get x's authlist's apprived articles for the node, if it not empty select the newest one.
- if it's empty get y's authlist's approved articles for the node, if it not empty select the newest one.
- if it's empty get z's authlist's approved articles for the node, if it not empty select the newest one.
- if it's empty get q's authlist's approved articles for the node, if it not empty select the newest one.
- if it's empty get r's authlist's approved articles for the node, if it not empty select the newest one.
- if it's empty get s's authlist's approved articles for the node, if it not empty select the newest one.
- continue crawling the web of authority with the the first of q's authlist. continue through q's authlist
- continue crawling the web of authority with the the first of r's authlist. continue through r's authlist
- continue crawling the web of authority with the the first of s's authlist. continue through s's authlist
Nodes
title
List of articles
versions of the node
What maps are they in
What links connect to/from them
articles
== user that made node(shouldn't)
Wikibody
Templates
Update
If set to a user id it should use the current(display time) version of the node that that specified user would see if they went to the linked node. If not a user id(false? undefined?) use the specific article linked in the template
node
Article
THe version that they used at the time they made the article
What links connect to/from them
users that have approved this node(another tag?)
users that have made comments and tags
Links
What maps are they in?
Maps
Nodes
=== Article(the version that they where refering when they made the link)
links between them nodes
layout
Horizontal order
node1
node2
Left, overlaping, or right
Vertical order
node1
node2
Above,overlaping, below
relitive position
if a node has already been moved by a relative move the one that hasn't else find the center between them and move the nodes reletive to that.